B 2165

B.E./B.Tech.DEGREEEXAMINATION,MAY/JUNE'2007'

Fourth Semester

Electronics and Communication Engineering

EC 242_ DIGITAL ELECTRONICS

Time : Three hours Maximum : 100 marks

Answer ALL questions.

PARTA-(10 x2=2}marks)

m
1. Convert the binary number 10112to gray code'

co
2. Minimise the function using Booleanalgebra f =x(y +w'z)+wx'z '

3.
N.
What is the advantage of using Schottky TTL gate?
va
4. Defrne propagation delaY.
na

5. Design a 2 input NAND gate using 2 : 1 multiplexer'

aa

6. Design a half adder'

M

7. write the characteristic equation of JKFF and show how JKFF can be
convertedinto'T'FF?
w.

g. Draw the logic diagram of 4 bit universal shift register.

ww

9. What is a hazard in asynchronoussequential circuit?

10. What are the different modes of operation in asynchronoussequential circuits?

PARTB-(5x16=80marks)

11. (a) Find the minimum sum of products expression using K-map for the
function F =2m(7,9,10,11,I2,L3,I4,L5) and teaLize the minimized
(16)
function using only NAND gates.

Or

(b) si-pl& using Quine-McCluskymethod F =Lm(0,1,2,3,10 J1,L2,L3,14,15)'

(16)
L2. (a) Draw the circuit diagrams of 2 input cMos NoR gate and cMos
NAND gate usingCMOSlogicand explaintheir operation. (16)

Or

(b) What are the different types of T'TL gates available? Explain their
operations taking suitable example. (16)

13. (a) Design a 4bit comparator using logic gates. (16)

Or

(b) Implement the given functions using PIIOM and PAL

Fr-Zm(0,1,3,5,7,9)

F z = L m ( 1 , 2 , 4 , ,78 , 1 0 , 1 1' ) (16)

L4. (a) Design a synchronous counter which counts in the sequence

0, 2, 6, I, 7, 5, 0 .... using D FFS. Draw the logic diagram and state

m
diagram.

co
Or

(b) (i)
N.
Write short notes on semiconductormemories. (6)

Reduce the given state table using implication chart (tabular

va
(ii)
method). (10)
x=0 x=1 z
na

A B D 1
B D F 1
aa

C D A 0
D D E 0
M

E B C 1
F C D 0
w.

15. (a) (i) Write short notes on races and cycles that occur in fundamental
ww

mode circuits. (10)

(ii) What is an essential hazard? Expiain with example. (6)

Or

(b) (i) Explain how hazard free realisation can be obtained for a Boolean
function. (8)

(ii) Discuss a method used for race free assignmentswith exampie. (U)

B 2165