Scribd
Upload
24 views2 pages

STLD

This document appears to be an exam for a third semester computer science and engineering course covering switching theory and logic design. It contains 10 short answer questions covering topics like binary conversions, boolean algebra, logic gates, flip-flops, counters, and more. Students are asked to answer question 1, which has 10 short parts, and 4 additional questions of their choosing. The questions test understanding of fundamental digital logic concepts.

Uploaded by

ANUPAMA Ponnu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
24 views2 pages

STLD

This document appears to be an exam for a third semester computer science and engineering course covering switching theory and logic design. It contains 10 short answer questions covering topics like binary conversions, boolean algebra, logic gates, flip-flops, counters, and more. Students are asked to answer question 1, which has 10 short parts, and 4 additional questions of their choosing. The questions test understanding of fundamental digital logic concepts.

Uploaded by

ANUPAMA Ponnu
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 2

Reg. No.

133 S 13
FOUR YEAR B.TECH. DBGREE EXA.MINATION _ APRIL, 2016.
THIRD SENIESTER EXAMINATION
COMPUTER SCIENCE AND ENGINEERING
SWITCHING THEORY AND LOGIC DESIGN (STLD)
(scHENtE - 2013)

Time : 3 Hours Max. Marks : 70

Note : Question No. 1 is compulsory and it must be answered first in Sequence at


one place only.

Answei any FOUR from the remaining.

1. (a) Find the binary equivalent of (TAC.lD)ru. (10 x 1 = 10)

(b) Find the complement of the function A + B + A' B'C .

(c) What are essential prime implicants?


(d) What is race around condition?
(e) What is the d.ifference between combinational and sequential logic
circuits?
(0 What is the difference between Latch and Fiip'flop?
(g) How is the capacity of a PLA is specified?
(h) What is a universal shift register?
(r) What i.s a Johnson Counter?
(j) What is Duality Principie?

2. (a) Convert the foLlowing decimal numbers in to equivalent octal numbers.


(i) (442s.625)Lo (ii) (791.125)10 (iii) (11.9375)10. (7)

(b) Represent the decimal number 27 in binary form using


(i) BCD code (ii) Excess-3 code (iii) Gray code (iv) Octal code. (8)

3. (a) Verifi, whether the following operations are commutative but not
associative

(i) NAND (ii) NOR (8)

(b) Express the following boolean functions of sum of minterms and product
of max terms. (1)

F (A, B,C) = (A'+B) (B'+C) .

Turn Over
4. (a) Simplify the foilowing Boolean function using K-map. (6)

F t A, B,C, D, E) =I (1, 3, 4. 7, 9,15,23,26,27,28,31)


(b) Simplify the following Boolean function using Tabulation method.
F (W, X,Y ;Z) = I(1, 4, 6,7,8,9,10,1 1,15) . (e)

5. (a) Design and expiain iook ahead czrr3r generator and impiement 4-bit fuil
Adder with iook ahead carry. (9)
(b) Design a combinationai circuil that accepts a 3-bit numbcr and convert it
to square of that number. (6)

6. (a) Expiain the operation of R-S master slave flip-flop. Explain its truth
table. (8)
(b) Give the proceclure for design of clocked sequential circuii;s. (Zl

7. (a) Design a 3-bit binarv synchronous trp-down counter. (8)


(b) L)esign a ,lohnson counter and e;<plain rvith tirning sequences. (7)

133 s 13

You might also like