Questions

Transcription

Questions

COMPUTER SCIENCE AND ENGINEERING
Computer Organization
Course Title
Course Code
Regulation
Course Structure
Computer Organization
Course Coordinator
Team of Instructors
N Shiva Krishna and K Karunakar Goud
R13
Lectures
5
Tutorials
1
Practicals
-
Credits
4
Objective:
This question bank has been prepared by the faculty of Dept of CSE, who have taught the
computer organization course, keeping in mind the need for outcome based education to enhance problem
solving and comprehensive skills of the student.
Group - A (Short Answer Questions)
Blooms
S. No
1
2
3
4
5
6
7
8
9
10
11
12
Questions
2 MARKS QUESTIONS
UNIT – I
Explain the functional units of a general computer?
Explain the role of program counter in addressing modes?
Course
Taxonomy Outcome
Level
Understand
Understand
1
1
Discuss the different types of addressing modes?
Define condition codes? Can a processor be designed without any condition
codes?
Explain the four basic types of operations that need to be supported by an
instruction set?
Describe the Auxiliary carry flag usage?
Understand
1
Knowledge
Understand
1
1
1
1
Define conditional code/ status registers in computer organization?
Explain load and store architecture in microprocessor?
Discuss data structures that can be best supported using (a) indirect addressing
Discuss in detail instruction formats with various examples?
Explain different types of addressing modes in branch instructions?
Knowledge
Understand
Understand
Knowledge
Understand
Understand
1
1
1
1
1
1
1
0
Blooms
S. No
Questions
Unit II
Course
Taxonomy
Understand
1
1
List out the major functions of I/O system?
Understand
2
1
Explain the program-controlled I/O with an example?
Understand
3
4
5
6
7
8
9
10
11
12
1
2
3
4
5
6
7
8
9
10
Discuss memory mapped I/O in computer organization?
Distinguish between memory mapped I/O and I/O mapped I/O?
Distinguish between a synchronous and an asynchronous data transfer
mechanisms?
Differentiate synchronous and asynchronous communication?
Explain strobe control in asynchronous data transfer along with hand shaking
problem
Discuss interrupt masks provided in any processor?
Define modes of data transfer in memory organization?
Define asynchronous bus with read and write cycles?
Explain different hazards in pipeline concept while an instruction is transferd?
Define different factors considered while designing an I/O subsystem?
List the different methods used for handling the situation when multiple
Interrupts occur?
UNIT - III
Distinguish between the write-through and write-back policies pointing out their
merits and demerits?
Define the virtual memory organization and explain briefly?
Explain cache memory to reduce the execution time?
Define CPU registers, Main memory, Secondary memory and cache memory?
List the various types of semiconductor RAMs?
Define Random Access Memory and types of RAMs present?
Explain the necessary for memory hierarchy?
Define HIT and MISS ratio in memory with an example?
Differentiate SRAM and DRAM?
List out two kinds of address locality of reference in cache memory?
Apply
Apply
Understand
Understand
Understand
Understand
Understand
Knowledge
Knowledge
Apply
Knowledge
Understand
Knowledge
Knowledge
Knowledge
Understand
Knowledge
Understand
Knowledge
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
Blooms
S. No
Questions
Course
Taxonomy Outcome
Level
1
11
List out the two parameters for performance of a computer system?
Knowledge
1
12
State the differences between static and dynamic memories?
Knowledge
1
13
Define virtual or logical address?
Knowledge
1
UNIT - IV
List out the major features of 8086 Microprocessors?
Knowledge
2
2
2
Discuss the significance of flags in flag register in 8086?
Understand
3
Explain how physical address is generated in 8086?
Understand
4
Explain the advantage of using memory segmentation?
Understand
5
Discuss how queue, speed up processing?
Understand
6
Explain about index registers?
Understand
7
Classify the usage of SI and DI registers?
8
Describe the functions of BIU?
Understand
9
Explain about timing and control unit in 8086?
Understand
10
List out the sequence of signals that occurs on address bus and data bus when
Knowledge
2
2
2
2
2
Apply
2
2
2
2
microprocessor fetches an instruction?
2
11
Explain why 8086 internal architecture is divided into BIU and EU? Discuss the
Understand
2
A-bus, B-bus and C- bus and their use?
2
12
List the internal registers in 8086 Microprocessor?
Knowledge
13
Explain the advantages of pipelining?
Understand
2
UNIT - V
2
1
Define relative memory addressing with an example?
Understand
2
Explain the use of push and pop instruction in 8086 ?
Understand
2
Blooms
S. No
Questions
Course
Taxonomy Outcome
Level
2
3
Discuss the function of stack pointer?
Understand
4
Distinguish between inter segment and intra segment jump instructions in 8086?
Apply
5
Differentiate between near CALL and far CALL instructions?
Apply
6
Explain about DOS function call?
Apply
7
State the difference between machine language and assembly language?
Apply
8
Define macro and procedure? Discuss the advantages of macro?
Understand
9
Explain the function of XLAT and CWD instructions in 8086?
Understand
10
Explain the two techniques to convert binary data to ASCII ?
Understand
11
Explain DAA, DAS instructions with examples?
Understand
12
Explain the instructions related to arithmetic and logical shift?.
Understand
13
Describe how REP instruction is used along with string instructions?
Understand
2
2
2
2
2
2
2
2
2
2
Group - II (Long Answer Questions)
Blooms
S. No
Questions
Course
Taxonomy Outcome
Level
UNIT – I
Define an instruction format? Explain different types of instruction formats in
detail.
Knowledge
2
Explain different types of addressing modes with Suitable examples?
Understand
3
Define an interrupt? Explain Types of interrupts?
Knowledge
4
Illustrate one-address and zero-address instruction formats, With Examples?
Apply
5
Explain i) Implied mode ii) Immediate Mode iii) Register Mode iv) Register
Understand
1
1
1
1
1
1
1
indirect mode v) Direct addressing mode with Examples.
1
6
Explain different program control instructions in CPU?
Understand
7
Discuss status bit conditions with Diagram?
Understand
8
Explain conditional branch instructions?
Understand
9
Compare different instruction formats?
Understand
10
Define program interrupt? Explain External interrupts and internal interrupts.
Knowledge
1
1
1
1
1
11
Explain i) Indirect addressing Mode ii) Relative addressing Mode iii) Auto
increment or auto decrement mode. Iv) Indexed addressing mode and Base
register addressing mode.
UNIT – II
Understand
1
Explain the DMA transfer technique with the block diagram?
Understand
2
Describe input-output-processor (IOP) Organization in detail?
Understand
3
Compare I/O versus Memory bus?
Understand
1
1
1
Blooms
S. No
Questions
Course
Taxonomy Outcome
Level
1
4
Explain DMA Controller with the block diagram?
Understand
5
Differentiate isolated I/O and memory mapped I/O?
Understand
6
Discuss Strobe Control method of Asynchronous data transfer technique?
Understand
7
Explain Asynchronous communication interface with diagram?
Understand
8
Discuss various techniques used for Modes of Transfer?
Understand
9
Explain 8089 Input-Output processor?
Understand
10
Describe asynchronous serial transfer?
Understand
11
Discuss Handshaking method of Asynchronous data transfer technique?
UNIT - III
Understand
1
Explain briefly about memory hierarchy?
Understand
2
Discuss RAM and ROM chips with diagrams?
Understand
3
State and Explain virtual memory organization technique?
Remember
4
Describe in detail about associative memory?
Remember
5
Define cache memory? Explain Associative mapping technique?.
Remember
6
Define a mapping function? Explain Set-Associative mapping technique?
Remember
7
Define virtual memory? Discuss Address mapping using pages in virtual
Remember
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
memory?
1
8
Explain i) ROM ii) PROM iii)EPROM iv)EEPROM.
Understand
9
Explain i) Write through policy ii) write back policy iii) Hit and Miss ratio.
Understand
10
Explain virtual memory Address translation?
Understand
11
Explain briefly about Memory connection to CPU?
UNIT – IV
Explain the various addressing modes of 8086 with examples?
Understand
1
1
1
1
Understand
2
2
2
Explain difference between 8086 and 8088?
Apply
3
Explain what are the GPR & SPR registers in 8086?
4
Classify flag register in 8086 and explain flag instruction set?
Apply
5
Distinguish between min mode and max mode of 8086?
Apply
2
Understand
2
2
2
6
Explain the functional block diagram of 8086and write about the functions of
Understand
2
each block?
2
7
Differentiate between physical address, effective address and offset address?
Apply
8
Explain with example how physical address is generated?
Understand
9
Discuss the addressing modes provided by 8086with examples?
Understand
10
Describe and explain the minimum mode configuration of 8086 with read and
2
2
2
Apply
2
write cycles of timing diagram?
2
11
Describe pin diagram of 8086 and explain each pin?
Apply
UNIT - V
2
1
Discuss the instructions formats of 8086 with examples?
Understand
2
Describe the following instructions with examples
Understand
2
2
i)IMUL ii) XLATE iii) XCHG iv) MOVSB
2
3
Explain Arithmetic instruction set of 8086 with examples?
Understand
4
Explain data transfer instructions of 8086 with examples?
Understand
5
Distinguish macros & procedures?
Understand
6
Explain short notes on JUMP instructions with examples?
Understand
7
Explain the following instructions i). WAIT ii). HLT iii). ESC iv). NOP.
Understand
8
Explain If AL contains A0H, what happens when the instruction CBW is
Understand
2
2
2
2
2
2
executed?
2
9
Explain the uses of Shift & rotate instructions?
Understand
10
Differentiate jump & loop instructions?
11
Explain short notes on string instructions?
Understand
12
Identify the logical instructions available in 8086?
Understand
2
Apply
2
2
Group - III (Critical Thinking / Analytical Questions)
Blooms
S. No
Questions
Course
Taxonomy Outcome
Level
1
UNIT – I
Calculate how many one-address instructions can be formulated when A
Apply
1
Computer has 32-bit instructions and 12-bit address with 250 two-address
1
instructions?
1
2
List a program to evaluate the arithmetic statement.
Knowledge
1
X= A [B+C (D+E)] Using Zero address instructions.
1
F(G+H)
1
3
Calculate the number of times control unit refer to memory when it fetches and
Apply
1
executes an indirect addressing mode instruction if the instruction is a
1
computational type requiring an operand from memory?
1
4
Calculate the address field of an indexed addressing mode instruction to make it
Apply
1
the same as a register indirect mode instruction?
1
5
List the basic differences between a branch instruction, a call subroutine
Knowledge
1
instruction, and a program interrupt?
1
6
The memory unit of a computer has 256K words of 32 bits each. The computer
Apply
1
has an instruction format with four fields: an operation field, a register address
1
field, a mode field, and a memory address. Determine the instruction format and
1
the number of bits in each field if the instruction is in one memory word?
1
7
S. No
The program in a computer compares two unsigned numbers A and B by
performing a subtraction A-B and updating the status bits. Let A=01000001 and
B=10000100, Calculate the values of Status bits C (borrow) and Z?
Questions
Apply
Taxonomy Outcome
Level
1
2
UNIT - II
Indicate whether the following constitute a control, status, or data transfer
commands.
a. Skip next instruction if flag is set.
b. Seek a given record on a magnetic disk.
A CPU with a 20-MHZ clock is connected to a memory unit whose access time
is 40 ns. Formulate a read and write timing diagrams using a READ strobe and
Understand
Apply
1
3
4
5
a WRITE strobe, Include the address in the timing diagram.
Calculate the minimum number of bits that a frame must have in the bit-oriented
protocol?
Calculate the number of characters per second can be transmitted over 1200baud line in each of the following modes?
a. Synchronous serial transmission.
b. Asynchronous serial transmission with two stop bits.
In most computers an interrupt is recognized only after the execution of the
current instruction. Consider the possibility of acknowledging the interrupt at
any time during the execution of the instruction. Discuss the difficulty that may
arise?
Analyze how DMA interrupt have priority over the processor interrupt when
Apply
1
Apply
1
Understand
1
Apply
1
both interrupts occur simultaneously?
UNIT – III
S. No
Questions
Taxonomy Outcome
Level
1
A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8). Calculate the
number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM
Apply
1
Blooms
S. No
Questions
Course
Taxonomy Outcome
Level
from 1K × 8 RAM?
2
Calculate The amount of ROM needed to implement a 4 bit multiplier?
Apply
3
A computer has a 256 K Byte, 4-way set associative, write back data cache with
Apply
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
1
block size of 32 Bytes. The processor sends 32 bit addresses to the cache
controller. Each cache tag directory entry contains, in addition to address tag, 2
valid bits, 1 modified bit and 1 replacement bit. Calculate the number of bits in
11
the tag field of an address?
4
A 4-way set-associative cache memory unit with a capacity of 16 KB is built
Apply
using a block size of 8 words. The word length is 32 bits. The size of the
physical address space is 4 GB. Calculate The number of bits for the TAG field?
5
In a k-way set associative cache, the cache is divided into v sets, each of which
Apply
consists of k lines. The lines of a set are placed in sequence one after another.
The lines in set s are sequenced before the lines in set (s+1). The main memory
blocks are numbered 0 onwards. Calculate The main memory block numbered j
1 1
must be mapped to any one of the cache lines from?
6
Consider two cache organizations: The first one is 32 KB 2-way set associative
Apply
with 32-byte block size. The second one is of the same size but direct mapped.
The size of an address is 32 bits in both cases. A 2-to-1 multiplexer has a latency
of 0.6 ns while a k bit comparator has a latency of k/10 ns. The hit latency of the
set associative organization is h1 while that of the direct mapped one is h2.
11
Calculate The value of h1?
7
In many computers the cache block size is in the range 32 to 128 bytes. Discuss
Understand
the main advantages and disadvantages of making the size of the cache blocks
1
1
larger or smaller?
8
An eight-way set-associative cache consists of a total of 256 blocks. The main
Apply
1
1
memory contains 8192 blocks, each consisting of 128 words.
1
1
1. Calculate number of bits in the main memory address?
1
1
1
1
1
1
1
1
1
1
1
1
1
1
2. Calculate number of bits in the TAG, SET and WORD fields?
9
Calculate numbers of 128 x 8 RAM chips are needed to provide a memory
1 1
capacity of 2048 bytes?
Apply
10
Explain how will you calculate time Tb to access a block of data in serial access
11
memory?
Apply
11
Calculate the number of page faults using First In First out (FIFO) Page
Apply
Replacement Algorithm for the following CPU References.
11
3 45
4 7 4 0 67 47 6 5 6 4 5 3 4 5
1 1
Assume Main Memory contains 4 frames.
12
1
2
3
4
5
6
7
Calculate the number of page faults using Least Recently used (LRU) Page
Replacement Algorithm for the following CPU References.
11
7 0
0 30 423 03 2 1 2 0 1 7 0 1
Assume Main Memory contains 3 frames.
UNIT – IV
Explain the loop instructions of 8086? Explain the use of DF flag in the
execution of string instructions?
Explain common function signals of 8086?
Explain about HOLD response sequence?
Explain hardware and software, vectored and non-vectored, I/O and processor
2
interrupt in 8086?
Explain the architecture of 8086 with BIU and EU units and implementation of
pipelining and instruction queue techniques?
Explain how odd memory bank is accessed in 8086?
Explain segmentation of memory in 8086?
Apply
Understand
2
Understand
Understand 2
Understand
Understand
2
Understand
Understand 2
Blooms
S. No
Questions
Course
Taxonomy Outcome
Level
1
2
3
4
5
6
UNIT - V
Describe a program to read ASCII code after a strobe signal is sent from a
Keyboard?
Describe a program to add a profit factor to each element in a cost array and
puts the result in a prices array?
Identify the errors in the following instructions or groups of instructions.
Describe an assembly language program to find sum of squares?
Explain a program sequence thatcompares thefirst 10 bytes beginning
atCHAR_1with the first10bytes beginning at CHAR_2 and branches toMATCH.
If they are equal, but otherwise continues in sequence
Describe program sequences that will perform the followingoperations
ontwodigit packed BCD number.
a. A=B+(C-6)
b. A=(X+W) – (Z– (U*5))
Prepared by: N Shiva Krishna and G Karunakar Goud
Understand
2
Understand
2
Apply
Understand 2
Understand
2
Apply
2
MARRI EDUCATIONAL SOCIETY’S GROUP OF INSTITUTIONS
MARRI LAXMAN REDDY INSTITUTE OF TECHNOLOGY & MANAGEMENT
(Approved by AICTE, New Delhi & Affiliated JNTU, Hyderabad)
COMPUTER SCIENCE AND ENGINEERING
QUESTION BANK
2014 - 2015
Course Name
: DESIGN AND ANALYSIS OF ALGORITHMS
Course Code
: A40508
Class
: II B. Tech II Semester
Branch
: Computer Science and Engineering
Year
: 2014 – 2015
Course Faculty
:
d
D.Shivaramakrishna,T.S.Srinivas
OBJECTIVES
To meet the challenge of ensuring excellence in engineering education, the issue of quality needs to be
addressed, debated and taken forward in a systematic manner. Accreditation is the principal means of
quality assurance in higher education. The major emphasis of accreditation process is to measure the
outcomes of the program that is being accredited.
In line with this, Faculty of Institute of Aeronautical Engineering, Hyderabad has taken a lead in
incorporating philosophy of outcome based education in the process of problem solving and career
development. So, all students of the institute should understand the depth and approach of course to be
taught through this question bank, which will enhance learner’s learning process.
PART – A (SHORT ANSWER QUESTIONS)
S. No
Question
Blooms
Taxonomy
Level
Program
Outcome
UNIT – I
1
Define the term algorithm and state the criteria the algorithm should satisfy.
Remember
a
2
Define order of an algorithm and the need to analyze the algorithm.
Remember
a
3
Define asymptotic notations: big ‘Oh’, omega and theta?
Remember
b
4
List the two different types of recurrence
Remember
a
5
State the best case and worst case analysis for linear search
Remember
a
2
2
6
7
If f(n)=5n + 6n + 4, then prove that f(n) is O(n )
Give the recurrence equation for the worst case behavior of merge sort.
Remember
Remember
a
b
8
Compute the average case time complexity of quick sort
Remember
b
9
Define algorithm correctness
Remember
a
10
Describe best case, average case and worst case efficiency of an algorithm?
Remember
a
11
Explain the term amortized efficiency
Understand
a
12
Define order of growth
Remember
a
13
How do you measure the algorithm running time?
Understand
a
1|Page
S. No
14
15
16
Question
Describe the role of space complexity and time complexity of a program are
necessary?
Explain algorithm design technique?
19
Use step count method and analyze the time complexity when two n×n
matrices are added
What is meant by divide and conquer? Give the recurrence relation for
divide and conquer.
Define Control Abstraction and write the computing time of divide and
conquer.
List out any two drawbacks of binary search algorithm.
20
List out the drawbacks of Merge Sort algorithm.
17
18
Blooms
Taxonomy
Level
Understand
Program
Outcome
Understand
c
Apply
a
Understand
c
Remember
a
Remember
a
Remember
a
a
UNIT - II
1
Describe union operation on sets
Remember
a
2
Describe find operation on sets
Remember
a
3
Define a spanning tree and minimal spanning tree
Remember
a
4
Define depth first search
Remember
a
5
Define breadth first search
Remember
a
6
Differentiate Breadth first search and depth first search
Remember
a
7
Describe AND/OR graph
Remember
a
8
Explain game tree
Remember
a
9
Define an articulation point?
Remember
a
10
Define a connected and bi-connected component.
Remember
a
UNIT - III
1
Define greedy method
Remember
a
2
Define job sequencing with deadlines problem
Remember
a
3
Define minimum cost spanning tree
Remember
a
4
State the principle of optimality
Remember
b
5
Define prims algorithm
Remember
a
6
Define kruskal algorithm
Remember
a
7
Define single source shortest path problem
Remember
a
8
Define dynamic programming.
Remember
a
9
List the features of dynamic programming
Remember
a
10
Distinguish greedy method and dynamic programming
Remember
a
Remember
a
Apply
a
UNIT - IV
1
State the principle of Backtracking
2
Write control abstraction for backtracking
3
List the applications of backtracking?
Remember
a
4
Define a dead node
Remember
c
5
Differentiate live node and dead node
Remember
a
6
Define state space tree
Remember
a
7
Define is solution space
Remember
a
8
Define solution states and answer state?
Remember
a
2|Page
S. No
Question
9
Explain 8 – Queens problem
10
Explain Sum of Subsets problem
Blooms
Taxonomy
Level
Apply
Program
Outcome
Apply
a
a
b
UNIT - V
1
Define class P
Remember
2
Compare NP-hard and NP-completeness
Remember
a
3
Define NP- hard problem
Remember
d
4
Define NP-complete problem
Remember
a
5
Define deterministic problem?
Remember
a
6
Define non-deterministic problem
Remember
b
7
Define a decision problem?
Remember
a
8
Explain optimization problem
Understand
a
9
Explain max clique problem?
Understand
c
10
Define halting problem
Remember
a
PART – B (LONG ANSWER QUESTIONS)
S. No
Blooms Taxonomy Program
Level
Outcome
Question
UNIT - I
1
Understand
2
Discuss various the asymptotic notations used for best case average case
and worst case analysis of algorithms.
Differentiate between priori analysis and posteriori analysis.
Understand
a
3
Discuss binary search algorithm and analyze its time complexity
Understand
c
4
Understand
a
5
Explain quick sort algorithm and simulate it for the following data 20,
35, 10, 16, 54, 21, 25
Explain Iterative binary search algorithm
Understand
d
6
Illustrate merge sort algorithm and discuss time complexity
Understand
a
7
Describe strassen’s matrix multiplication.
Understand
a
8
Discuss amortized analysis
Understand
b
9
10
Explain probabilistic analysis
Sort the list of numbers using merge sort: 78, 32, 42, 62, 98, 12, 34, 83
Understand
apply
b
c
a
UNIT - II
1
Explain breadth first search algorithm with example
Understand
a
2
Explain depth first search algorithm with example
Understand
d
3
Discuss various tree traversal techniques with examples
Understand
a
4
Compare and contrast BFS and DFS.
Understand
e
5
Explain in detail about AND/OR graphs
Understand
a
6
Explain waiting rule for finding UNION of sets and collapsing rule
Understand
a
7
Differentiate divide and conquer and greedy method
Understand
b
8
Discuss game trees
3|Page
Understand
a
UNIT - III
1
2
Explain in detail job sequencing with deadlines problem with example
Explain single source shortest path problem with example
Apply
Apply
a
a
3
Explain knapsack problem with example
4
Explain prims algorithm with example
Understand
Apply
b
a
5
Explain kruskal algorithm with example
Understand
d
6
Explain the concept multistage graphs with example.
Understand
a
7
Explain optimal binary search tree algorithm with example
Understand
c
8
Explain 0/1 knapsack problem with example
Understand
a
9
Explain all pairs shortest path problem with example
Understand
a
10
Describe the travelling salesman problem and discuss how to solve it
using dynamic programming?
Understand
a
Apply
Apply
a
c
Understand
a
Apply
a
UNIT – IV
4
Write an algorithm for N-queens problem using backtracking
Explain subset-sum problem and discuss the possible solution strategies
using backtracking.
Describe graph coloring problem and write an algorithm for m-coloring
problem
Write an algorithm for Hamiltonian cycle with an example
5
Explain properties of LC search
6
Describe control abstraction for LC Search
7
1
2
3
Apply
a
Understand
b
Explain principle of FIFO branch and bound
Apply
a
8
Explain principle of LIFO branch and bound
Apply
a
9
Explain the method of reduction to solve travelling sales person problem
using branch and bound
Explain TSP using branch and bound method with example
Apply
d
Apply
a
Remember
a
c
10
UNIT – V
1
State and prove cook’s theorem
2
Explain deterministic and non-deterministic algorithms
Apply
3
Write non deterministic algorithm for sorting and searching
Apply
a
4
Write a non-deterministic knapsack algorithm
Apply
b
5
6
Explain how P and NP problems are related
Distinguish NP- hard and NP-complete problems
Apply
Understand
a
a
7
Explain decision problem with an example
Apply
c
8
Explain chromatic number decision problem and clique decision problem
Apply
a
9
Explain the strategy to prove that a problem is NP-hard
Apply
b
10
Explain intractable problems with examples
Apply
b
PART – C (PROBLEM SOLVING AND CRITICAL THINKING QUE STIONS)
S. No
Question
Blooms
Taxonomy Level
Program
Outcome
Understand
a
UNIT – I
1
Solve the following recurrence relation
4|Page
S. No
Question
Program
Outcome
Understand
a
Understand
a
Apply
a
Understand
a
____ = _2_ _
2
3
+ _, __ __1_ = 2
2
Solve the following recurrence relation
T(n) = 7T(n/2) + cn2
Solve the recurrence relation
_,
_=1
Blooms
Taxonomy Level
6
____ = _ 3_ __ + __,
_ > 1,
_ __ _______ 2
Explain quick sort
2
3 5 9 71 46 8 2
Sort the list of numbers using merge sort
33, 44, 2, 10, 25, 79, 86, 47, 14, 36
Show that the average case time complexity of quick sort is O(n log n)
7
Understand merge sort on letters
8
Understand strassen’s matrix multiplication on following matrices
4
5
9
10
algorithm and simulate it for following data sequence:
4
5
5
9
,
2
10
1
6
H, K, P, C, S, K, R, A, B, L
Write and solve recurrence relation for strassen’s matri x multiplication
Solve the following recurrence_relation
____
= _2_ _2
+ 1,
Apply
a
Understand
a
Understand
a
Apply
a
Understand
a
Understand
a
__ __1_ = 2
UNIT - II
1
2
Illustrate BFS traversal of following graph
List
the articulation points from the following graph
b
Understand
3
Write inorder,
5|Page
preoreder, post order traversal of the following tree
Understand
a
S. No
4
Question
Blooms
Taxonomy Level
Illustrate DFS and BFS traversals of following graph
Program
Outcome
a
Understand
5
Illustrate DFS traversal of following graph
Understand
a
6
Illustrate BFS traversal of
Understand
a
7
List the articulation points from the following graph
Understand
a
8
Write in order, preorder, post order traversal of the following tree
Understand
b
6|Page
following graph
S. No
Question
9
Illustrate BFS and DFS traversals of following graph
10
Illustrate DFS travers al of following graph
Blooms
T axonomy Level
Understand
Program
Outcome
b
Understand
c
Understand
a
Understand
a
Understand
a
Apply
a
Understand
a
UNIT - III
1
2
3
Compute the optimal solution for job sequencing with deadlines using
greedy method. N = 4, profits (p1, p2, p3, p4) = (100, 10, 15, 27),
Deadlines (d1,d2, d3, d 4) = (2, 1, 2, 1)
Compute the optimal solution for knapsack problem using greedy
method N = 3, M = 20, (p1, p2, p3) = (25, 24, 15), (w1, w2, w3) = (18,
15, 10)
Construct minimum cost spanning tree using
a) prims algorithm b) kruskal algorithm
4
Apply single source sh ortest path algorithm for the following graph
5
Use optimal binary sear ch tree algorithm and compute wij, cij, rij,
0<=i<=j<=4, p1=1/10, p2=1/5, p3=1/10, p4=1/120, q0=1/5, q1=1/10, q2=
1/5, q3= 1/20, q4 = 1/2 0.
7|Page
S. No
Question
6
Construct optimal binary search for (a1, a2, a3, a4) = (do, if, int, while),
p(1 : 4) = (3, 3, 1, 1) q(0 : 4)= (2, 3, 1, 1, 1)
Solve the solution for 0/1 knapsack problem using dynamic programming
(p1, p2, p3, p4) = (11, 21, 31, 33), (w1, w2, w3, w4) = (2, 11, 22, 15),
M=40, n=4
Solve the solution for 0/1 knapsack problem using dynamic programming
N=3 , m=6 profits (p1, p2, p3) = (1, 2, 5) weights (w1, w2, w3) = (2, 3,
4)
Find the shortest tour of traveling sales person for the following cost
matrix using dynamic Programming
7
8
9
10
∞
12
5
7
11
∞
13
6
4
9
∞
18
10
3
2
∞
Calculate shortest distances using all pairs shortest path algorithm
Blooms
Taxonomy Level
Understand
Program
Outcome
a
Apply
a
Apply
a
Understand
a
Understand
a
UNIT - IV
1
Sketch the state space tree degenerated by 4 queens problem
Understand
a
2
Understand
a
3
Apply the backtracking algorithm to solve the following instance of the
sum of subsets problem S = {5, 10, 12, 13, 15, 18} and d=30
Sketch the state space tree generated all possible 3-color,4-node graph
Understand
a
4
Identify Hamiltonian cycle from the following graph
Understand
a
8|Page
S. No
5
Question
Blooms
Taxonomy Level
Understand
Program
Outcome
a
Draw the portion of state space tree generated by LCBB by the following
knapsack problem n = 5 , (p1, p2, p3, p4, p5) = (10, 15, 6, 8, 4), (w1, w2,
w3, w4, w5) = (4, 6, 3, 4, 2) and m = 12
Draw the portion of state space tree generated by FIFO knapsack for the
instance N = 4 , (P1, P2, P3, P4)= ( 10, 10, 12, 18 ) , ( w1, w2, w3,w4) =
( 2, 4, 6, 9 ) , m = 15
Solve the following instance of travelling sales person problem using
Least Cost Branch Bound
Understand
a
Understand
a
Understand
a
Identify Hamiltonian cycle from the following graph
Understand
A
Apply the backtracking algorithm to color the following graph
Understand
b
Solve the following instance of travelling sales person problem using
Least Cost Branch Bound
6
7
8
9
10
9|Page
∞
12
5
7
11
∞
13 6
4
9
∞ 18
10
3
2
∞
S. No
Question
Blooms
Taxonomy Level
Program
Outcome
UNIT - V
1
Remember
a
2
Show that satisfiability is at most three literals reduces to chromatic
number
Prove Hamiltonian cycle is in NP
Understand
a
3
Prove circuit-SAT is in NP
Understand
a
4
Understand
a
5
List two problems that have polynomial time algorithms justify your
answer
Explain 3CNF satisfiability problem
Remember
a
6
Explain P type problems with examples
Remember
b
HOD, COMPUTER SCIENCE AND ENGINEERING
10 | P a g e
Dundigal, Quthbullapur (M), Hyderabad –500043, R.R Dist, A.P
Course Code: A40507
Course Title: Database Management System
Year and Semester: II B .Tech. II Sem
Q.N
O
QUESTIONS
BLOOMS
TAXONOMY
LEVEL
PROGR
AM
OUTCO
ME
2 MARKS QUESTIONS(PART-A)
UNIT-1
1
List the advantages of DBMS?
KNOWLEDGE
e
2
List the database Applications?
KNOWLEDGE
l
3
Explain about instances and schemas of database?
UNDERSTAND
b
4
Explain Data Independence?
UNDERSTAND
b
5
Explain database Access for applications Programs
UNDERSTAND
c
6
Define (i)Database (ii)DBMS
KNOWLEDGE
l
7
Explain about Database storage structure?
UNDERSTAND
b
8
Explain about Transaction management?
UNDERSTAND
b
9
Explain the Query Processor?
UNDERSTAND
b
10
Define (i)Entity (ii)Attribute
KNOWLEDGE
b
11
Define Relationship and Relationship set?
KNOWLEDGE
b
12
Discuss about Data Definition language?
UNDERSTAND
d
13
Discuss about Data Manipulation language?
UNDERSTAND
d
14
Explain about querying relational data?
UNDERSTAND
i
15
Explain the History of Data base Systems?
UNDERSTAND
c
1
16
Discuss how can you change the data in the table?
UNDERSTAND
d
17
List various types of attributes?
KNOWLEDGE
b
18
Discuss How can you alter and destroy tables?
UNDERSTAND
d
UNIT-2
1
Explain relational database query?
UNDERSTAND
d
2
State about SELECT operation in Relational algebra?
KNOWLEDGE
a
3
State about PROJECT operation in Relational algebra?
KNOWLEDGE
a
4
Define Aggregate Functions?
KNOWLEDGE
a
5
Discuss the use of rename operation?
UNDERSTAND
a
6
Explain about division operation?
UNDERSTAND
a
7
Discuss the basic form of SQL query?
UNDERSTAND
b
8
Define Null Values.
KNOWLEDGE
b
9
Define tuple variable with its syntax?
KNOWLEDGE
b
10
Define Dynamic SQL?
KNOWLEDGE
k
11
Define Assertions?
KNOWLEDGE
g
12
Discuss about trigger?
UNDERSTAND
d
13
Explain how to add a NOT NULL column to a table?
APPLY
b
b
UNIT-3
1
Define redundancy?
KNOWLEDGE
2
Define functional dependency? Why are some
functional dependencies trivial?
KNOWLEDGE
3
Discuss normalization?
UNDERSTAND
d
d, k
4
Explain functional dependency with example?
2
UNDERSTAND
d
5
Explain fully functional dependency with example?
UNDERSTAND
d
6
Demonstrate transitive dependency? Give an example?
APPLY
k
7
Discuss Domain-Key Normal Form?
UNDERSTAND
g
8
Define Armstrong axioms for FD’s?
KNOWLEDGE
d
9
Define First Normal Form
KNOWLEDGE
d, k
10
Define Second Normal Form.
KNOWLEDGE
d, k
11
Define Third Normal Form.
KNOWLEDGE
d, k
12
Define Fourth Normal Form.
KNOWLEDGE
d, k
UNIT-4
1
Define a Transaction? List the properties of transaction
KNOWLEDGE
c
2
Discuss different phases of transaction?
UNDERSTAND
c
3
Discuss recoverable schedules?
UNDERSTAND
l
4
Discuss cascade less schedules?
UNDERSTAND
c
5
Define Two Phase Commit protocol?
KNOWLEDGE
c
6
Demonstrate the implementation of Isolation?
APPLY
l
7
Discuss the Procedure to test Serializability ?
UNDERSTAND
c
8
Explain about different types of locks?
UNDERSTAND
b
9
Discuss about Failure Classification?
UNDERSTAND
b
10
Define a checkpoint and When does it occur?
KNOWLEDGE
b
11
Discuss the failures that can occur with loss of Nonvolatile storage?
UNDERSTAND
12
Demonstrate Conflict Serializability?
13
Discuss View Serializability?
UNIT-5
3
l
APPLY
b
UNDERSTAND
b
1
Discuss about data on External storage?
UNDERSTAND
e
2
Explain Clustered Indexes?
UNDERSTAND
d, l
3
Discuss the Primary and Secondary indexes?
UNDERSTAND
d, l
4
Define Tree Indexing?
KNOWLEDGE
d, l
5
Explain Hash based Indexing?
UNDERSTAND
d, l
6
Discuss the intuition for Tree Indexes?
UNDERSTAND
d, l
7
Define Indexed Sequential Access Method?
KNOWLEDGE
d, l
8
Discuss about Overflow pages and Locking
considerations of ISAM?
UNDERSTAND
9
Discuss the Cost model of Heap files?
UNDERSTAND
e
Discuss the Cost model of Sorted files?
UNDERSTAND
e
9
Discuss the Cost model of Clustered files?
UNDERSTAND
e
10
Discuss the impact of Workload on Indexes?
UNDERSTAND
e
k
10 MARKS QUESTIONS(PART-B)
UNIT-1
1
Compare and contrast file Systems with database
systems?
UNDERSTAND
2
Explain Data Abstraction and discuss levels of
Abstraction?
UNDERSTAND
3
Discuss about different types of Data models?
UNDERSTAND
b
4
Describe the Structure of DBMS?
UNDERSTAND
b
5
Explain additional features of the ER-Models.
UNDERSTAND
b
6
Discuss about the Concept Design with the ER Model?
UNDERSTAND
b
7
Explain about views and updates on views?
UNDERSTAND
l
4
b
b
8
Explain different types of database users and write about
the functions of DBA?
UNDERSTAND
9
Explain about different types of integrity constraints?
UNDERSTAND
b
10
Discuss about the logical database Design?
UNDERSTAND
d, l
11
Differentiate strong entity set and weak entity set? Give
an ER diagram with a weak entity set.
UNDERSTAND
12
Differentiate between relation schema and relational
instance ?Define the terms arity and degree of s
relation? What are domain constraints?
UNDERSTAND,
KNOWLEDGE
a
13
Describe an outer join?
UNDERSTAND
a
14
Describe logical connectives of SQL?
UNDERSTAND
a
15
Discuss about active databases?
UNDERSTAND
g
c
d, l
UNIT-2
1
Explain about different set operations in Relational
algebra with an example?
UNDERSTAND
2
Define a Join? Explain different types of joins?
KNOWLEDGE,
UNDERSTAND
a
3
Discuss about Domain Relational calculus in detail?
U
a
4
Define a trigger. And explain its three parts? Discuss the
differences between row level and statement level
triggers?
KNOWLEDGE,
UNDERSTAND
d
5
Explain about Group by and Having clauses with
examples?
UNDERSTAND
6
Discuss about Complex integrity constraints in SQL?
UNDERSTAND
7
Discuss different types of aggregate operators with
examples in SQL?
UNDERSTAND
8
a) Define a nested query?
KNOWLEDGE
b) Tell a nested query to find the names of sailors who
5
a
b
d
a
b,d,l
have reserved both a red and green boat?
c) Write a nested query to find the names of sailors who
have reserved all boats?
9
a) Discuss correlated nested queries?
b) Tell the names of sailors who have reserved a red
boat?
UNDERSTAND,
KNOWLEDGE
b,d,l
c) Tell the names of sailors who have not reserved a red
boat?
10
a) Explain Relational calculus?
b) Tell a TRC query to find the names of sailors who
have reserved boat 103?
UNDERSTAND,
KNOWLEDGE
a
c) Tell a DRC query to find the names of sailors who
have reserved boat 103?
UNIT-3
1
IIustrate redundancy and the problems that it can cause?
APPLY
2
Define decomposition and how does it address
redundancy? Give the problem s that may be caused by
the use of decompositions?
KNOWLEDGE
3
Define functional dependencies.How are primary keys
related to FD’s?
KNOWLEDGE
4
Define normalization? Explain 1NF, 2NF, 3NF Normal
forms?
KNOWLEDGE,
UNDERSTAND
d,l
5
Define BCNF .How does it differ from 3NF?
KNOWLEDGE
d,l
6
Discuss properties of decompositions?
UNDERSTAND
d,l
7
Explain about Schema refinement in Database design?
UNDERSTAND
d,l
8
Explain about Multivalued dependencies and Fourth
normal form with example?
UNDERSTAND
6
g,h
b,g,h
d,k
d, l
9
Discuss about Join dependencies and Fifth normal
form?
UNDERSTAND
10
Explain Inclusion dependencies with example?
UNDERSTAND
d, l
UNDERSTAND,
APPLY
b, c, d
d ,l
UNIT-4
1
Explain the ACID properties. and
Illustrate them through examples?
2
Discuss How do you implement Atomicity and
Durability?
UNDERSTAND
3
Explain Concurrent execution of transaction with
examples?
UNDERSTAND
4
Discuss Serializability in detail?
UNDERSTAND
5
Discuss two phase locking protocol and strict two phase
locking protocols?
UNDERSTAND
6
Describe Timestamp based locking protocols?
UNDERSTAND
d, l
7
Describe Validation-based locking protocols?
UNDERSTAND
d, l
8
Discuss in detail Multiple Granularity?
UNDERSTAND
d, l
9
Explain in detail Storage structure?
UNDERSTAND
b, i
10
Discuss Deferred database modification and Immediate
database modification?
UNDERSTAND
11
Discuss how do you recover from Concurrent
transactions?
UNDERSTAND
12
Explain Buffer Management?
UNDERSTAND
13
Explain different types of Advanced Recovery
Techniques?
UNDERSTAND
14
Explain in detail about Remote Backup systems?
UNDERSTAND
UNIT-5
7
d
d, l
b
d, l
d, l
c ,l
b
c, k, l
k
1
Explain in detail about Hash based Indexing and Tree
based Indexing?
UNDERSTAND
2
Compare I/O costs for all File Organizations?
UNDERSTAND
b, c ,l
3
Explain in detail about ISAM?
UNDERSTAND
d, l
4
Explain B+ trees? Discuss about this Dynamic Index
Structure?
UNDERSTAND
5
Demonstrate How do you search a given element in B+
trees? Explain with example?
UNDERSTAND
6
Demonstrate How do you insert an element in B+ trees?
Explain with example?
UNDERSTAND
7
Demonstrate How do you delete an element in B+ trees?
Explain with example?
UNDERSTAND
8
Explain in detail about Static Hashing?
UNDERSTAND
b, c ,l
9
Explain in detail about Extendible Hashing?
UNDERSTAND
b, c, l
10
Explain in detail about Linear Hashing?
UNDERSTAND
b, c ,l
11
Compare and contrast Extendible Hashing with Linear
Hashing?
UNDERSTAND
d, l
d,l
d, h
d, h
d, h
b, c, l
PROBLEM SOLVING/ANALYTICAL/CRITICAL THINKING QUESTIONS
UNIT-1
1
1)Consider the following ER Diagram.
APPLY
Discuss how many minimum numbers of tables are
needed to represent M, N, P, R1, R2?
8
b, c, l
2
Let E1 and E2 be two entities in an E/R diagram with
simple single-valued attributes. R1 and R2 are two
relationships between E1 and E2, where R1 is one-tomany and R2 is many-to-many. R1 and R2 do not have
any attributes of their own. What is the minimum
number of tables required to represent this situation in
the relational model?
3
Does the View exist if the table is dropped from the
database?
4
We can convert any weak entity set to strong entity set
by simply adding appropriate attributes. Why, then, do
we have weak entity sets?
APPLY
b, c, l
KNOWLEDGE
d, c, l
APPLY
b, c ,l
UNIT-2
1. Consider the following relational schema
Employee (empno,name,office,age)
Books(isbn,title,authors,publisher)
Loan(empno, isbn,date)
Write the following queries in relational algebra.
a. Find the names of employees who have borrowed a
book Published by McGraw-Hill?
a, b
APPLY
b. Find the names of employees who have borrowed all
books Published by McGraw-Hill?
c. Find the names of employees who have borrowed
more than five different books published by McGrawHill?
d. For each publisher, find the names of employees who
have borrowed?
2. Given the Students relation as shown below
9
APPLY
d
For (Student Name, Student Age) to be the key for this
instance, then the value of X should not be equal to
what?
3. Given the relations
employee (name, salary, deptno) and
department (deptno, deptname, address)
APPLY
a
Which of the queries cannot be expressed using the
basic relational algebra operations (U, -, x,
, p)?
4. Write SQL Query to find second highest salary of
Employee from Employee table?
UNIT-3
1. Consider a relation scheme R = (A, B, C, D, E, H) on
which the following functional dependencies hold: {A–
>B, BC–> D, E–>C, D–>A}. What are the candidate
keys of R?
2. Consider the following relational schemes for a library
database:
Book (Title, Author, Catalog no, Publisher, Year, Price)
Collection (Title, Author, Catalog no) with in the
following functional dependencies:
I. Title Author --> Catalog no
II. Catalog no --> Title Author Publisher Year
III. Publisher Title Year --> Price
Assume {Author, Title} is the key for both schemes.
What normal forms can you apply for Book and
Cancellation
3. Consider a schema R (A, B, C, D) and functional
dependencies A -> B and C -> D. Then the
decomposition of R into R1 (A, B) and R2(C, D)
10
APPLY
APPLY
d, l
APPLY
d, l
APPLY
d, l
belongs to which one or both (dependency preserving
and loss less join)?
4. Prove that: if α → β and α → γ then α → βγ
APPLY
a
APPLY
d, l
UNDERSTAND
d
APPLY
d, l
UNIT-4
1. Consider the following transactions with data items P
and Q initialized to zero:
T1: read(P);
read(Q);
If P=0 then Q:=Q+1;
write(Q);
T2: read(Q);
read(P);
If Q=0 then P:=P+1;
write(P);
Any non-serial interleaving of T1 and T2 for concurrent
execution leads to A serializable schedule or non
serializable schedule?
2. Which of the following concurrency control protocols
ensure both conflict serialzability and freedom from
deadlock?
I. 2-phase locking
II. Time-stamp ordering
3. Consider the transactions T1, T2, and T3 and the
schedules S1 and S2 given below.
T1:r1(X);r1(Z);w1(X);w1(Z)
T2:r2(Y);r2(Z);w2(Z)
T3:r3(Y);r3(X);w3(Y)
S1:r1(X);r3(Y);r3(X);r2(Y);r2(Z);
w3(Y);w2(Z);r1(Z);w1(X);w1(Z)
11
S2: r1(X); r3(Y); r2(Y); r3(X); r1(Z);
r2(Z); w3(Y); w1(X); w2(Z); w1(Z)
Which one of the schedules is conflict-serializable?.
4. Suppose that there is a database system that never fails.
Is a recovery manager required for this system?
UNIT-5
APPLY
c
APPLY
d, l
APPLY
b
3. A clustering index is defined on the fields of which
type?
APPLY
d, l
4. What is the minimum space utilization for a B+ tree
index?
APPLY
d, l
APPLY
d, l
1. Consider a B+-tree in which the maximum number of
keys in a node is 5. What is the minimum number of
keys in any non-root node?
2. In the index allocation scheme of blocks to a file, On
what the maximum possible size of the file depends?
5. Consider the B+ tree index of order d = 2 shown in
Figure
1. Show the tree that would result from inserting a data
entry with key 9 into this tree.
2.Show the B+ tree that would result from deleting the
data entry with key 8 from the original tree, assuming
that the left sibling is checked for possible redistribution
12
MARRI LAXMAN REDDY
Institute of Technology & Management
Dundigal, Quthbullapur (M), Hyderabad-500043.
Department of Electronics & Communication Engineering
II Year B.Tech. ECE II-Sem
ENVIRONMENTAL STUDIES
QUESTION BANK
Course Name
Course Code
Class
Branch
Year
Course Faculty
:
:
:
:
:
:
ENVIRONMENTAL STUDIES
54004
II- B.Tech
E.C.E,CIVIL ,CSE
2014 – 2015
B.KUMARASWAMY & P.VIJAYAKUMAR
OBJECTIVES:
To learn the basics of radar transmitter and receiver and radar equation, to predict the range and
study the applications of radar. types of radar like cw radar, FMCW radar, doppler effect, MTI
radar, tracking radar operation, to study radar receivers and displays.
1.
GROUP - A (SHORT ANSWER QUESTIONS)
UNIT – 3
Biodiversity and
Biotic resources
S. No.
1.
2.
3.
2.
Question
Define biodiversity
Explain genetic diversity, species diversity
ecosystem diversity
What do your mean by consumptive use value, productive
use value
Blooms
Taxonomy
Level
Understanding
evaluating
Understanding
a,e,k,l
a,e,k,l
j,d
4.
social value, ethical value and option value of biodiversity
5.
What are the major causes of man-wildlife conflicts
6.
Define poaching of wild life
Knowledge
a,e,d,j
7.
What is Red Data Book ?
Comprehension
a,e,l,k
8.
What is meant by in situ conservation of biodiversity
Evaluating
d,j
9.
What ex-situ conservation of biodiversity ?
Knowledge
d,j
10.
What is meant by habitat loss
GROUP - B (LONG ANSWER QUESTIONS)
Analysis
Course
Outcomes
Understanding
Understanding
d,j
d,j
a,e
UNIT – 3
Biodiversity and
Biotic resources
S. No.
Question
Blooms
Taxonomy
Level
Course
Outcomes
1.
Comment upon Indian biodiversity with special reference as
a megadiversity nation.
Analysis
a,e,k,l
2.
What are the major threats to biodiversity
Understanding
a,e,k,l
Knowledge
j,d
Knowledge
d,j
3.
4.
What is meant by in situ and ex-situ conservation of
biodiversity ? Give examples
(A)Name the types of plants for which gene sanctuaries in
Indiaexist.
(B) Name the animals for whose protection and
conservations specific projects have been launched in our
country.
5.
Find out the endangered species in india
Applying
d,j
6.
What is meant by Man wild life conflicts
Knowledge
a,e,d,j
7.
Explain the hot spots of biodiversity
Knowledge
a,e,l,k
8.
Explain the biodiversity values with examples
Evaluating
d,j
9.
Classification of biodiversity
10.
What are the major causes of man-wildlife conflicts ?
Discuss theremedial steps that can curb the conflict.
3.
Understanding
d,j
Knowledge
a,e
GROUP - C (ANALYTICAL QUESTIONS)
UNIT – 3
Biodiversity and
Biotic resources
S. No.
Question
6.
Name the animals for whose protection and
conservations specific projects have been launched in
our country.
What are hotspots of biodiversity ? Which are the
hotspots found in India ? Discuss their salient features
How can measured the Species diversity
What do you mean by extinct, endangered,
vulnerable and rare species
Name the types of plants for which gene sanctuaries in
India
exist
How many biodiversity hot spots in india
7.
Write five important biosphere reserves
8.
9.
10.
Who is introduced biodiversity
1.
2.
3.
4.
5.
Name the any 2 plants are used to prepare drugs
What is meant by habitat fragmentation
Blooms
Taxonomy
Level
Course
Outcome
s
Applying
a,e,k,l
Applying
a,e,k,l
create
j,d
Knowledge
d,j
Applying
d,j
Knowledge
a,e,d,j
Understanding
Knowledge
Knowledge
Knowledge
a,e,l,k
d,j
d,j
a,e
1. GROUP - A (SHORT ANSWER QUESTIONS)
UNIT – 4
S. No.
1.
2.
Question
Define pollution.
. What are the natural and man made pollutants
Blooms
Taxonomy
Level
Knowledge
Understanding
Course
Outcomes
a,e,k,l
a,e,k,l
3.
. Give an account of indoor air pollution
Knowledge
j,d
4.
Explain about the noise pullution
Knowledge
d,j
Analysis
d,j
Knowledge
a,e,d,j
5.
Write short notes on biomagnification
6.
What is meant by B.O.D and C.O.D
7.
Short notes on water pollution
Understanding
a,e,l,k
8.
Short notes on air pollution.
Understanding
d,j
9.
What is meant by soil pollution
Understanding
d,j
10.
List the water pollution sources
Knowledge
a,e
Blooms
Taxonomy
Level
Course
Outcomes
2. GROUP - B (LONG ANSWER QUESTIONS)
UNIT –4
S. No.
Question
1.
Give an account of the adverse effects of air pollution
Analysis
a,e,k,l
2.
. Briefly describe the sources, effects and control of noise
pollution.
Applying
a,e,k,l
3.
Enumerate with examples the major sources of surface
water pollution
and ground water pollution.
Knowledge
j,d
4.
Discuss various sources of marine pollution. How can you
prevent
pollution of our oceans ?
evaluating
d,j
Analysis
d,j
6.
What adverse effects can solid wastes cause ? How can the
solid
waste be managed.
Knowledge
a,e,d,j
7.
How can you, as an individual, prevent environmental
pollution
Knowledge
a,e,l,k
5.
Classify solid waste. What are the sources of urban and
industrial
solid wastes ?
3. GROUP - C (ANALYTICAL QUESTIONS)
UNIT – 4
S. No.
Question
Blooms
Taxonomy
Level
Course
Outcomes
1.
.Sound pollution frequency expressed in
Knowledge
a,e,k,l
2.
Blue baby syndrome is caused by the presence of in drinking
water.
Evaluating
a,e,k,l
3.
Minamata disease occurred due to consumption of fish
contaminated with
4.
Highest proportion in the vehicular exhaust
5.
Air pollutants affects plants by entering through
Understanding
j,d
Knowledge
d,j
Analysis
d,j
UNIT – 5
1.
What do you mean by sustainable development
Blooms
Taxonomy
Level
Knowledge
2.
. Discuss the measures to conserve water.
Knowledge
3.
What are greenhouse gases and greenhouse effect
4.
What is meant by acid rain ? How does it form
5.
Discuss the salient features of earth summit
6.
What is meant by environmental impact assessment
7.
Discuss the salient features of. Environmental(protection) act 1986
8.
What are the bio-medical wastes
9.
What are the hazardous wastes
10.
Discuss about gloal warming
S. No.
Question
Understanding
Understanding
Understanding
a,e,k,l
j,d
d,j
d,j
a,e,d,j
Knowledge
a,e,l,k
Knowledge
Understanding
UNIT – 5
a,e,k,l
Analysis
Understanding
Course
Outcomes
d,j
d,j
a,e
S. No.
Question
1.
Discuss the natural formation and occurrence of ozone in
the stratosphere.
2.
Discuss various measures for wasteland reclamation.
3.
4.
5.
6.
7.
8.
Discuss the salient features of (a) Wildlife (Protection) Act,
1972. (b) Forest (Conservation Act), 1980.
What are the different methods to propagate environmental
awareness in the socity
What are the major limitations to successful implementation
of our enviornmental legislation
Explain the muncipalsolid waste manage ment handling rules 2000
.
Why do we refer to Environmental Protection Act, 1986 as
an
Umbrella Act. Discuss the Major Environmental Protection
Rules,1986.
Population, consumerism and waste production are
interrelated .Comment
9.
Which are the agents responsible for ozone depletion ?
10.
Explain the bio-medical waste manage ment handling rules
Blooms
Taxonomy
Level
Course
Outcomes
Analysis
a,e,k,l
create
a,e,k,l
Understanding
j,d
Knowledge
d,j
evaluating
d,j
Analysis
a,e,d,j
Knowledge
a,e,l,k
Understanding
d,j
Analysis
d,j
Knowledge
a,e
UNIT - 7
S. No.
1.
2.
Question
summarize the matched filter receiver.
Extend the function of matched filter receiver with non-white
noise input.
3.
ilustrate the non matched filter receiver.
4.
formulate an expression for impulse response of matched filter
receiver.
5.
Discuss zero-crossing detector.
6.
summarize the notch filter equations.
7.
Calculate the matched filter receiver response with non-white
noise input.
8.
Discuss non-matched filter receiver.
9.
Summarize the cross correlation receiver.
10.
illustrate the Zero-crossing detector
Blooms
Taxonomy
Level
Understanding
Course
Outcomes
a,e,k,l
understanding
a,e,k,l
Knowledge
j,d
creating
d,j
Understanding
d,j
Knowledge
a,e,d,j
Applying
a,e,l,k
Understanding
d,j
Comprehension
d,j
Knowledge
a,e
UNIT - 8
S. No.
Question
Blooms
Taxonomy
Level
Course
Outcomes
Knowledge
a,e,k,l
1.
Define noise figure.
2.
Distinguish between the terms: noise figure, noise temperature and
system noise temperature of receivers.
3.
List out the applications of phased array antennas
Knowledge
j,d
4.
Define a duplexer.
Knowledge
d,j
5.
Illustrate the basic concept of phased array antennas.
Applying
d,j
6.
Explain how circulator can be act as a duplexer.
Knowledge
a,e,d,j
7.
Describe receiver protectors.
Knowledge
a,e,l,k
8.
Discuss radar CRT phosphor characteristics.
Understanding
9.
Discuss about aperture illumination and aperture efficiency.
Understanding
10.
Where we will use the Duplexer.
Understanding
a,e,k,l
d,j
d,j
Knowledge
a,e
Blooms
Taxonomy
Level
Course
Outcomes
UNIT - 8
S. No.
Question
1.
List out the general characteristics and requirements for a radar
receiver.
Knowledge
a,e,k,l
2.
Formulate the expression for the noise figure of two networks
that are in cascade.
Knowledge
a,e,k,l
3.
Discuss about the mixers in the radar receiver.
4.
List out the different types of displays used for radar applications
and their characteristics.
Knowledge
d,j
5.
List out the merits and demerits of phased array antennas.
Knowledge
d,j
6.
Explain in detail about N-element linear array and derive the
radiation pattern expression.
Analysis
a,e,d,j
7.
Explain the various types of duplexers used in radars.
Analysis
a,e,l,k
8.
Formulate an expression for noise figure for 3 networks in
cascade.
Knowledge
d,j
9.
Describe the Radiation pattern and feed arrangements for array
antennas in a radar system.
Knowledge
d,j
Understanding
j,d
10.
Explain the terms sidelobe radiation and aperture efficiency as
applicable to radar systems.
Analysis
a,e
Course
Outcomes
UNIT - 8
S. No.
Question
Blooms
Taxonomy
Level
1.
Three networks units each of 10dB, 6dB and 3dB gains
respectively are cascaded. Solve for the overall noise figure of the
system.
Applying
a,e,k,l
2.
A radar receiver is connected to a 50ohms resistance antenna that
has an equivalent noise resistance of 30ohms.calculate the noise
figure of the receiver and the equivalent noise temperature of the
receiver.
analysis
a,e,k,l
3.
Three networks units each of 12dB, 8dB and 9dB gains
respectively are cascaded. Solve for the overall noise figure of the
system.
Knowledge
j,d
4.
A radar receiver is connected to a 60ohms resistance antenna that
has an equivalent noise resistance of 40ohms.calculate the noise
figure of the receiver and the equivalent noise temperature of the
receiver.
Knowledge
d,j
5.
List the characteristics of Radar display units.
Knowledge
d,j
6.
Collect the disadvantages of Balanced Type duplexers.
Knowledge
a,e,d,j
7.
Describe Aperture illumination.
Knowledge
a,e,l,k
8.
Explain change of Beam width with steering angle.
Analysis
d,j
9.
Describe the feed arrangements of an antenna array.
Knowledge
d,j
10.
Explain Broad side array and end fire array
Analysis
a,e
MARRI LAXMAN REDDY
Institute of Technology & Management
Dundigal, Quthbullapur (M), Hyderabad-500043.
Department of Computer Science And Engineering
Unit wise Question Bank
Class
: FORMAL LANGUAGES AND AUTOMATA THEORY
: A40509
: II B. Tech II Semester
Branch
: Computer Science and Engineering
Year
:
Course Faculty
: Mr.K.L.NARASIMHA RAO
Course Name
Course Code
2014 – 2015
OBJECTIVES
 The purpose of this course is to acquaint the student with a overview of the theoretical
foundations of computer science.
 Classify machines by their power to recognize languages.
 Employee finite state machines to solve problems in computing
 Explain deterministic and non-deterministic machines
 Comprehend the hierarchy of problems arising in the computer sciences.

Group - A (Short Answer Questions)
S. No.
1.
2.
3.
Questions
UNIT – III
Define Greibach normal form.
Define nullable Variable.
State the nullable variables from the following CFG.

S
Blooms
Taxonomy
Level
Course
Outcomes
Remember
Remember
Remember
9
8
9
Remember
Remember
Remember
Remember
Remember
Remember
Understand
8
10
11
9
10
10
10
Apply
Understand
Remember
12
12
12
ABCa | bD

BC |b

B b|ε

A
C
Đ|ε

D d
4.
5.
6.
7.
8.
9.
10.
1.
2.
3.
State the symbol is used to label the interior node of the parse tree.
Define the language of PDA accepted by final state.
List the steps to convert CFG to PDA.
Define CNF.
Define PDA.
Define NPDA.
Differentiate between deterministic and nondeterministic PDA.
UNIT - IV
Write the Turing Machine model.
Explain the moves in Turing Machine
Define an ID of a Turing Machine?
4.
5.
6.
7.
8.
9.
10.
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Define the Language of Turing Machine.
List types of TM
Define Turing Machine.
Write the difference between Pushdown Automata and Turing
Machine.
Explain Church’s Hypothesis.
Define Context sensitive language.
Define multi head Turing Machine, multi dimensional Turing
Machine.
UNIT - V
Define Chomsky hierarchy of languages.
Define Universal Turing Machine
Define LR(0) grammars.
Define decidability & undecidability
Define P,NP problems.
Define Rice ‘s theorem
Give examples for Undecidable Problems
Define Turing Machine halting problem.
Define Turing Reducibility
Define PCP.
Remember
Remember
Remember
Apply
12
12
12
12
Understand
Remember
Remember
12
12
12
Remember
Remember
Remember
Remember
Remember
Remember
Understand
Remember
Remember
Remember
4
12
5
13
13
13
13
13
13
13
Blooms
Taxonomy
Level
Course
Outcomes
Apply
9
Understand
8
Apply
9
Apply
Apply
9
11
Understand
9
Understand
8
Apply
10
Group - II (Long Answer Questions)
S. No.
1.
2.
Questions
UNIT – III
Write a short notes on Chomsky Normal Form and Griebach Normal
Form.
Show that the following grammar is ambiguous with respect to the
string aaabbabbba.

S

A
B
3.

aB | bA
aS| bAA| a
bS | aBB | b
Use the following grammar :
S


A
ABC | BbB
aA | BaC|aaa

B
bBb| a|D

C
CA|AC

D
4.
5.
S

A

B
C
6.
7.

aABB | aAA
aBB | a
bBB|A
a
Discuss the Pumping lemma for Context Free Languages concept
with example.
Show that the following CFG ambiguous.
S
C
8.
ɸ
Eliminate ε-productions.
Eliminate any unit productions in the resulting grammar.
Eliminate any useless symbols in the resulting grammar.
Convert the resulting grammar into Chomsky Normal Form
Illustrate the construction of Griebach normal form with an example.
Write the procedure to convert CFG to PDA and also convert the
following CFG to PDA.



iCtS | iCtSeS | a
b
L ={ anbn | n >= 1}
Construct a PDA to accept the language
by a final state. Draw
the graphical representation of the PDA.
Also show the moves made by the PDA for the string aaabbb
9.
10.
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
Give an example for deterministic PDA.
Write the procedure to convert from the given PDA to a CFG. Give
an example.
UNIT – IV
Define a Turing Machine. With a neat diagram explain the working
of a Turing Machine.
Construct a Turing Machine that accepts the language
L = {an b n| n ≥1}. Give the transition diagram for the Turing
Machine obtained
Construct a Turing Machine to accept the following language.
L = { 0n1n0n | n ≥1}
L = {0n1 n | n ≥1}. Give the transition diagram for the Turing
Machine obtained and also show the moves made by the
Turing machine for the string 000111.
Construct a Turing Machine to accept the language
L= { wwR | w € ( a + b ) *}
Define Recursive and Recursively Enumerable languages?
Write the properties of recursive and recursively enumerable
languages
L = {x2nyn| n ≥0}. Give the transition diagram for the
Turing Machine obtained.
L = {1n2 n3n | n ≥1}. Give the transition diagram for the Turing
Machine obtained and also show the moves made by the
Turing machine for the string 111222333.
Construct a Turing Machine to implement Subtraction ( m-n ).
UNIT – V
Explain the concept of undecidability problems about Turing
Machine
Write a note on Modified PCP and Multi stack Turing machine.
Explain individually classes P and NP
Write a shot notes on post's correspondence problem
Explain the Halting problem with an example
Write a short notes on universal Turing machine
Write a short notes on Chomsky hierarchy
Write a short notes on Context sensitive language and linear
bounded automata
Write a short notes on NP complete , NP hard problems
Define LR(0) items with an example.
Understand
Apply
10
11
Remember
12
Apply
12
Apply
12
Apply
12
Apply
12
Remember
Apply
12
12
Apply
12
Apply
12
Apply
12
Understand
12
Apply
Understand
Apply
Understand
Apply
Apply
Apply
13
13
13
13
12
4
4
Apply
Remember
13
5
Group – III (Critical Thinking /Analytical Questions)
S. No.
1
2
Questions
UNIT - III
Construct PDA for equal number of x’s and y’s
Convert the following grammar into GNF
A1
A2


Blooms
Taxonomy
Level
Course
Outcomes
Apply
Understand
10
9
Apply
10
Understand
11
A2 A3
A3 A1 /b

A3 A1 A2 /a
3
Construct NPDA for L = { W WR /W ϵ ( X + Y)*}
M = ({q1,q2},{0,1}.{R,B,G},δ,q1,R,ϕ}
4
Convert the following PDA to CFG
δ(q0,0,z0)={q0,xz0)
δ(q0,0,x)=(q0,xx)
δ(q0,1,x)=(q1,ϵ)
δ(q1,1,x) = (q1,ϵ)
δ(q1,ϵ,x)=(q1,ϵ)
δ(q1,ϵ,z0)=(q1,ϵ)
1
2
3
4
1
2
3
UNIT - IV
L = {a2nbn| n ≥0}. Give the transition diagram for the
Turing Machine obtained.
Construct a Turing Machine that gives two’s compliment for the
given binary representation.
Construct a Turing Machine to accept the following language.
L = { xnynzn | n ≥1}
Construct a Turing Machine which shift non block symbols 2 cells
to the right.
UNIT - V
Explain PCP and MPCP with examples.
Explain Turing theorem ,Halting problems, Turing Reducibility.
Construct LR(0) for

S
E
E
4


12
Apply
12
Apply
12
Apply
12
Understand
Understand
Apply
13
13
5
Apply
5
E
E*B
E+B
Construct LR(0) for
A
Apply


B b
aAa/B

Questions

Transcription

Similar documents

Rosalinda - Southern Living Plants

Happy Times - Sprint Horticulture

Hypericum prolificum.pub

Lisianthus - The Sun Valley Group

puzzle - Dallas Voice

Opuntia humifusa.pub

THE FLOWER AND GARDEN FESTIVAL

7. Teacher - student relationship (*) During the

Queen Mum - Southern Living Plants

hyderabad hearsay