PART-A

(20*2=40MARKS)
ANSWER ALL QUESTIONS

1.   Mention the advantages of ICs over discrete components?

2.   What is the use of buried n + layer in Monolithic IC transistor?
3.   Define Sheet resistance.
4.   What are the two common methods for obtaining integrated capacitors?
5.   Draw the circuit of Op amp as clamper
6.   Define band-pass filter
7.   Write transfer function of op amp as integrator
8.   Define comparator and also draw its transfer characteristics
9.   Briefly explain analog multiplication process.
10.   What is Schmitt trigger? Mention its application.
11.   Define FSK modulation
12.   Define Lock-in-Range and capture range of PLL.
13.   Draw the transfer characteristics of a 3-bit DAC
14.   Calculate the values of the LSB,MSB and full scale output for an 8-bit DAC for the 0 to
10V range
15.   Give the disadvantage of flash type A/D converter
16.   Which is the fastest ADC and why?
17.   Write the frequency of oscillation(f0) equation for triangular wave generator
18.   How frequency to voltage converted in OP AMP.
19.   Define monolithic switching regulator
20.   What do you mean by opto-coupler?

PART-B
(5*12=60 MARKS)
ANSWER ANY FIVE QUESTIONS

21.   a) Explain in detail about Widlar current source    8   

b) Briefly explain about slew rate of an op-amp 4
22. a) Discuss in detail about the AC performance characteristics of an op-amp    8
b) What is current mirror? Explain. 4
23. a) How op amp can be used as an antilog amplifier?    6
b) Explain about op-amp integrator    6
24. a) Discuss in detail about Gilbert multiplier cell    6
b) With neat block diagram explain the operating principles of PLL    6
25. a) Explain in detail about Voltage controlled oscillator    8
b) Describe the application of PLL as AM detection    4
26. a) Explain the operation of successive approximation type A/D converter 8
b) What output voltage would be produced by a D/A converter whose output range is 0 to 10V 4
and whose input binary number is (1) 10(for a 2-bit D/A converter) (2) 0110(for a 4-bit DAC)?
27. a) With neat diagram explain the operation of instrumentation amplifier    8
b) Design an inverting summing amplifier using op-amp 4
28. a) Explain the operation of a op-amp    8
b) Write short notes on operation on function generator    4

Read more:
http://discuss.itacumens.com/index.php/topic,93442.msg131390.html#msg131390#ixzz1CV8glS
Ls

THIRD SEMESTER

COMPUTER SCIENCE AND ENGINEERING

CS1201 DATA STRUCTURES

(common to Chemical, petrochemical, IT, ECE, E&I, ICE and Textile)

(REGULATION 2007)
Time : Three hours Maximum : 100 marks
Answer ALL questions.
PAR T A – (10×2=20 marks)
1. Define : Algorithm.
2. What is an asymptotic notation? Mention its types.
3. Write the address calculation formula for locating a in an array.
4. What is a Priority Queue?
5. What are siblings?
6. Define hash function.
7. What is the total number of comparisions and total number of exchanges in Bubbler sort for the worst
case situation?
8. What is the need for external sorting?
9. What is a directed graph?
10. Define Biconnectivity.
PART B – (5×16=80 marks)
11. (a) How Top-down design is different from normal method of problem solving? (
(b) Write an algorithm to print all prime numbers upto 100. (
Or
12. (a) How an algorithm is verified? Explain. (
(b) Write an algorithm to print Fibonacci series. (
13. (a) Explain how the storage representations can be performed in 2-D array. (
(b) Explain how the given expression is converted into postfix expression using stack.
A+((B*D+E/F)^G-H)/C+E*F)-B*E
Or
14. (a) Give an algorithm for inserting a node in a linked list. (8 )
(b) Explain how linked list is used for polynomial multiplication. (8 )
15. Explain in detail the Hashing functions and collision handling techniques. (16)
Or
16. (a) Explain AVL trees with representations. (8 )
(b) Explain the priority queues with array representations. (8 )
17. (a) Explain Shell sort algorithm with suitable example. (8 )
(b) Explain the time complexity of the above algorithm. (8 )
Or
18. Explain Heap sort algorithm for HEAP tree constructions with example. (16)
19. (a) Explain Dijkstra’s Algorithm and find the shortest path for the graph. (10)

50

10
10
30 20 100

60
(b) Explain linked list representation of graph. (6)
Or
20. (a) Discuss in detail the depth first search traversal algorithm for graph. (8 )
(b) Write a brief note on applications of graphs with suitable example. (8 )

Read more: http://discuss.itacumens.com/index.php/topic,45208.0.html#ixzz1CVAyFPma