Download as doc, pdf, or txt
Download as doc, pdf, or txt
You are on page 1of 2

B.

Tech-III-Computer Science
MODEL PAPER
Digital Electronics
Time allowed: 3 hours

Maximum marks: 100

Note: Attempt five questions at least one from each unit.


Unit-I
Ques1) Solve the following using Quine McCluskey Method and verify using K-Map
f = (0, 1, 4, 11, 13, 15) + d (5, 7, 8)

20

Ques2)
a) Explain the working of Tri-state (3-state) TTL gate.

b) State De Morgans Laws. Also Explain the NAND multilevel implementation in details?
12
Unit-II
Ques3)
a) What do you mean by a full adder circuit? Explain the working and logical implementation of full
adder?
10
b) Design a BCD to Gray Code Converter. Use doesnt care.

10

Ques4)
a) Implement the following Boolean function using 4 : 1 MUX
F(A, B, C, D) = (0, 1, 2, 4, 6, 9, 12, 14)

b)

What do you mean by Binary Divider? Also explain with relevant diagram. What is carry look ahead
adder?
12
Unit-III

Ques5)
a) What is Ripple counter? Also discuss BCD Ripple counter with neat state diagram.
b)

Explain various types of shift counters with relevant diagrams.

10
10

Ques6)
a) Explain 555 Timer in detail? Explain the working of Monostable Multivibrator with 555 Timer
Circuit.
10
b) Convert SR-Flip Flop into D flip flop D Flip Flop into J-K flip flop?

10

Unit-IV
Ques7) What do you mean by RAM and ROM also discuss various types of RAM devices? Describe RAM
organization in detail.
20
Ques8)
a)
b)

What are Programmable logic arrays and discuss implementation of a PLA using ROM?
Write a short note on:
1) FPGA

10

2) CPLDs.

10

You might also like