16.
17.
18.
19.
20.
21.
22.
28.

25.
26.
27.

28.

29.
30.
31.

2 C 31131
Part C

Answer any five questions.
Each question carries 4 marks.

Write a brief note on Gray Code. Give example. =
Explain the types of counters and its applications.
State and prove De Morgan’s theorems.
List all the Boolean rules.
Define Encoder and Decoder.
Explain Full adder Circuit. ச
Perform binary subtraction using 2’s compliment (i) 38-27 (ii) 53-42.
What are the Applications of A/D Convertors ?
(5 x 4 = 20 marks)
Part D

Answer any five questions.
Each question carries 8 marks.

Briefly explain the different types of shift registers.

Explain the Johnson’s Counter and its applications.

With a neat diagram explain 4 bit parallel binary adder.

Explain the working of JK Flip flop with a neat diagram.

Simplify the boolean function F (A, B,C, D) = 5°(0, 2, 4,5, 6, 7, 8, 10, 13,15) using K maps. Draw
the equivalent logic circuit using basic gates.

Draw and explain with a neat diagram multiplexer and demultiplexer.

Explain Successive approximation D/A Conversion method.

Explain R-2R D/A Converter

(5 x 8 = 40 marks)