18.
19.
20.
21.
22.
23.

24,
25.
26.
27.
28.
29.
90.
31.

3 D 51248
Simplify F (A, ‏,ظط‎ C, D) = £m (0, 2, 4, 5, 6, 7, 8, 10, 13, 15) using K-map.
Differentiate combinational and sequential logic circuits, with example.
What is race around condition ? Explain how this problem is removed.
With truth table and diagram explain the working of a multiplexer.
Differentiate synchronous and asynchronous counters.
Explain the working of R-2R ladder network.
(5 x 4 = 20 marks)
Part D
Answer any five questions.
Each question carries 8 marks.
What is meant by Universal gate ? Why NAND gates and NOR gates get this name ?
Explain weighted and non-weighted codes with example.
Generate even parity Hamming code to transmit the data bits 1011.
Differentiate between Decoder and Demultiplexer.
Construct a 4-bit up counter with T flip flop.
What is a Ring counter ?
Explain different types of shift registers.
Explain the working of Successive approximation ADC with suitable block diagram.
: (5 x 8 = 40 marks)