TED (15)- 3133 Res' No "" " '

Signature "
- 2ol5)
'
(REVISION

DIPLOMA EXAMINATION IN ENGINEERING/TECHNOLOGY/

MANAGEMENT/COMMERCIAL PRACTICE _ APRIT,' 2OI9
DIGITAL COMPUTER PRINCIPLES
lTime : 3 hotxs
(Maximum marks : 100)

E
PART A

EG
-
(Maximum ma*s : l0)
Marks

LL
I Answer a// questions ln one or two sentences' Each question carries 2 marks'

CO
l. Convert (41.6875)'0 to binary

2. Which gates are called univenal gates and why ?

3. What is don't care condition ? C

Mention its use
NI
4. What are flip-flops ? Give examples'
CH

5. What is hamming code, also specify its applicatiors ? (5x2 = l0)

TE

PART B
-
LY

(Maximum marks : 30)

PO

II Answer any fve of the following questions Each question carries 6 ma*s'

l.SimptifthefollowingBooleanfimctionstoaminimumnumberofliterals.
N

Also implement the Boolean firnctions with gates'

DI

(a) F(X, Y, z): (x + YXY + Z) (b) F(X' Y, Z) = xY + x'Z + vZ

A'

2. Design a firll adder circuit using wo half adden. Realize it using logic diagram
and block diagram.
M

3. Minimize the expression Ffi. Y. A -- x0.2.3. 4. 5. 6) using K- mao and implement

it in NAND logic.

4. Compare and contrast combirational and sequential circuits'

5. Using suitable example explain race condition' How can it be avoided ?

6.tksi$azl.bitringcounter.Alsofepres€ntitusingtimingdiagramandstatediagram.
7 . Categoize and expiain different types of RQMS' (5x6 = 30)

t4el [r'r'o'
i--F

Marks
c
-
'ART mada: 60)
(Maximum
(Answer one full question from each unit. Each full question carries 15 marks.)

UNrr I
-
II Define Boolean algebra. List the Boolean laws for algebraic expressions. l5
On
IV (a) Express the following boolean expressions in minterms and maxterms.
(i) A+B (ii) A(B+A)B l0
(b) state De Morgan's Theorem. using it, reduce the following expressions.

E
(i) AB (CD i EF(AB + eD) (ii) AB + A + AB

EG
5

Ur'rrr II
-

LL
(a) Minimize the following expression using K-map I

F(W, X, Y, Z): >(1,4,7, 10, 13) + 2615, 14, 15)

CO
5
(b) Design a 2-bit magnitude comparator and illustrate using a neat logic diagram. l0
On
(a) Minimize the following expression using K-map:
C
NI
F(A, B. C. D) = I(4. 5.7, t2, t4. 15) + 1613, 8, t0) 5

(b)
CH
Design and explain the working of a 4-input multiplexer with the help of logic
diagram. What are the applications of multiplexers ? l0
UNrr lll
TE

-
UI (a) Design JK flip-flop using D flipflop and verify it using characteristic table and
equation. )
LY

(b) Design ii syrchronous 3-bit down counter. l0

PO

On
VU (a) Design T flip-flop using JK flip-flop and veriff it using characteristic table and
equation. 5
N

(b) Design a synchronous Mod-6 counter using JK flip flop. l0

DI

UNrr IV
-
A'

D( Realize the following firnctions using a PAL with four inputs and 3-wide AND-OR
s0ucture along with the PAL programming table.
M

Fr (A, B, C, D) = lm(6, 8, 9, 12, 13, 14, 15)

Fz (A, B, C, D) : Im( l, 4, 5, 6, 7 , 10, ll, 12, l3)
F: (A, B, C, D) : Im(4, 5, 6,'7, 10, 1l)
F+ (A, B, C, D) : Im(4, 5,6,7,9, 10, 11.12, 13, 14, l5) l5
On
(a) Briefly explain the different specification parameten of DAC. 5

(b) Using appropriate example explain error detection and conection using hamming code. l0