Saturday, July 21, 2012

DATA STRUCTURES AND ALGORITHMS EE2204 APRIL/MAY 2010 ANNA UNIVERSITY QUESTION PAPER


B.E./B.Tech. DEGREE EXAMINATION, APRIL/MAY 2010
Third Semester
Electrical and Electronics Engineering
EE2204 — DATA STRUCTURES AND ALGORITHMS
(Common to Electronics and Instrumentation Engineering and Instrumentation and
Control Engineering)
(Regulation 2008)
Time: Three hours Maximum: 100 Marks
Answer ALL Questions
PART A — (10 × 2 = 20 Marks)

1. List out the areas in which data structures are applied extensively.
2. Convert the expression ((A+B)*C-(D-E)^(F +G)) to equivalent Prefix and
Post fix notations.
3. How many different trees are possible with 10 nodes?
4. What is an almost complete binary tree?
5. In an AVL tree, at what condition the balancing is to be done?
6. What is the bucket size, when the overlapping and collision occur at same
time?
7. Define graph.
8. What is a minimum spanning tree?
9. Define NP hard and NP complete.
10. What is meant by dynamic programming?
                                                                        PART B — (5 × 16 = 80 Marks)
11. (a) (i) What is a linked list? Explain with suitable program segments any four operations of a linked list. (Marks 12)
(ii) Explain with a pseudo code how a linear queue could be converted into a circular queue. (Marks 4)
Or
(b) (i) What is a stack ADT? Write in detail about any three applications of stack. (Marks 11)
(ii) With a pseudo code explain how a node can inserted at a user specified position of a doubly linked list. (Marks 5)

12. (a) (i) Discuss the various representations of a binary tree in memory with suitable example. (Marks 8)
(ii) What are the basic operations that can be performed on a binary tree? Explain each of them in detail with suitable example. (Marks 8)
Or
(b) (i) Give an algorithm to convert a general tree to binary tree. (Marks 8)
(ii) With an example, explain the algorithms of in order and post order traversals on a binary search tree. (Marks 8)
13. (a) What is an AVL tree? Explain the rotations of an AVL tree. (Marks 16)
Or
(b) (i) Explain the binary heap in detail. (Marks 8)
(ii) What is hashing? Explain any two methods to overcome collision problem of hashing. (Marks 8)
14. (a) (i) Explain Dijkstra's algorithm and solve the single source shortest path problem with an example. (Marks 12)


(ii) Illustrate with an example, the linked list representation of graph. (Marks 4)
Or
(b) (i) Write the procedures to perform the BFS and DFS search of a graph. (Marks 8)
(ii) Explain Prim's algorithm to construct a minimum spanning tree from an undirected graph. (Marks 8)
15. (a) (i) With an example, explain how will you measure the efficiency of an algorithm. (Marks 8)
(ii) Analyze the linear search algorithm with an example. (Marks 8)
Or
(b) Explain how the travelling salesman problem can be solved using greedy algorithm. (Marks 16)
 

ELECTRONIC DEVICES AND CIRCUITS EE2203 MODEL QUESTION PAPER


B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER 2011.
Third Semester
Electrical and Electronics Engineering
EE 2203 — ELECTRONIC DEVICES AND CIRCUITS
(Regulation 2008)
Time : Three hours Maximum : 100 marks
Answer ALL questions.     
PART A — (10 × 2 = 20 marks)

1. What is meant by dynamic resistance of diode?
2. Differentiate between zener breakdown and avalanche breakdown.
3. Draw the h-parameter equivalent circuit of a CE BJT configuration.
4. What is the application of optocoupler?
5. What is pinch off voltage?
6. Give any two differences between E-MOSFET and D-MOSFET.
7. What are the advantages of differential amplifier?
8. State Barkhausen criteria.
9. Sketch the output waveform for the clipper shown in the figure below.
Neglect the drop across the diode.
10. What is intrinsic standoff ratio in UJT?

PART B — (5 × 16 = 80 marks)

11. (a) Draw the circuit diagram and explain the operation of full wave rectifier using center tap transformer and using bridge rectifier without center tap transformer. Obtain the expression for peak inverse voltage. (16)
Or

(b) (i) With neat diagram explain the construction and working of LED. (8)
(ii) Explain the working of LCD seven segment display using square wave supply. (8)

12. (a) Draw the circuit for determining the transistor common base characteristics and explain how the characteristics are measured and draw the graphs. (16)
Or     
(b) For a common emitter circuit draw the h-parameter equivalent circuit and write the expressions for input impedance, output
impedance and voltage gain. (16)

13. (a) Draw the circuit diagram of common source FET amplifier and give the design steps to find the component values used in the circuit. (16)
Or     


(b) Explain the construction and working of enhancement MOSFET and depletion MOSFET. Draw the characteristics. (16)
14. (a) Explain the concept of negative feedback in amplifier. Derive the expressions for voltage gain, input impedance and output impedance. (16)
Or     
(b) (i) With a neat diagram, explain the construction and working of BJT RC phase shift oscillator. (8)
(ii) Explain the construction and working of Hartley oscillator. (8)

15. (a) (i) Explain the construction, equivalent circuit and operation of UJT. Draw the characteristics of UJT. (8)
(ii) Explain how UJT is used to generate saw tooth waveform. (8)
Or     
(b) Explain the operation of collector coupled monostable multivitrator with neat circuit diagram and draw the various waveforms. (16)