Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

question bank for digital electronics, Exams of Electronics

Damodaram Sanjivayya National Law UniversityElectronics

u like these questions fknbfkvnidngjnoi jsmvfslcml;dkapojg ncfjfnsolowifj

Typology: Exams

2017/2018

Uploaded on 08/10/2018

ankur23
ankur23 🇮🇳

5

(1)

1 document

1 / 16

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
EC6302 DIGITAL ELECTRONICS
QUESTION
BANK
UNIT –I
MINIMIZATION TECHNIQUES AND LOGIC GATES
Part – A
1. Apply De-Morgan’s theorem to simplify A+BC.
2. Define the term prime implicants and Essential prime implicants.
3. Draw the XOR logic using only NAND gates.
4. Implement the following Boolean function with NOR – NOR logic
F = Π (0, 2, 4,5,6)
5. Express the switching function f (ABC) = B in terms of minterm.
6. Define minterm & Maxterm. Give examples.
7. Simplify the given Boolean Expression F= x’+xy+xz’+xy’z’.
8. Prove that the logical sum of all minterms of a Boolean function of 2 variables is 1.
9. Show that a positive logic NAND gate is a negative logic NOR gate.
10. If A & B are Boolean variables and if A=1 & A+B=0, Find B?
11. Realize F = A’B+AB’ using minimum universal gates.
12. Write the Boolean expression for the output of the system shown in figure.
www.studentskey.in
1
Page 1 of 13
pf3
pf4
pf5
pf8
pf9
pfa
pfd
pfe
pff

Partial preview of the text

Download question bank for digital electronics and more Exams Electronics in PDF only on Docsity!

EC6302 DIGITAL ELECTRONICS

QUESTION

BANK

UNIT –I

MINIMIZATION TECHNIQUES AND LOGIC GATES

Part – A

  1. Apply De-Morgan’s theorem to simplify A+BC.
  2. Define the term prime implicants and Essential prime implicants.
  3. Draw the XOR logic using only NAND gates.
  4. Implement the following Boolean function with NOR – NOR logic F = Π (0, 2, 4,5,6)
  5. Express the switching function f (ABC) = B in terms of minterm.
  6. Define minterm & Maxterm. Give examples.
  7. Simplify the given Boolean Expression F= x’+xy+xz’+xy’z’.
  8. Prove that the logical sum of all minterms of a Boolean function of 2 variables is 1.
  9. Show that a positive logic NAND gate is a negative logic NOR gate.
  10. If A & B are Boolean variables and if A=1 & A+B=0, Find B?
  11. Realize F = A ’ B+AB ’ using minimum universal gates.
  12. Write the Boolean expression for the output of the system shown in figure.

www.studentskey.in

Page 1 of 13

  1. Write down fan-in & fan-out of a standard TTL IC.
  2. Prove that AB+A’C+BC = AB + A’C
  3. Implement the following Boolean function with NAND – NAND logic F = ∑ (0, 1, 3, 5)
  4. What are don’t care terms?
  5. What are universal gates implement AND gate using any one universal gate?
  6. What are the advantages of Schottky TTL family?
  7. Define the term (i). Propagation delay (ii). Power dissipation
  8. Draw an active high tri-state Gate & write its truth table. Part – B
  9. a). i). Simplify the following function using K – map, f=ABCD+AB’C’D’+AB’C+AB & realize the SOP using only NAND gates and POS using only NOR gates (12) ii). Simplify the logic circuit shown in figure (4)

UNIT –II

COMBINATIONAL

CIRCUITS

Part – A

  1. What is combinational circuit? Give examples.
  2. Draw the block diagram of n-bit parallel adder
  3. Write an expression for borrow and difference in a full Subtractor circuit.
  4. Differentiate a decoder from a Demultiplexer.
  5. Design Half – adder using only NAND gates.
  6. (^) What is code converter? List their types.
  7. Draw a logic diagram of 1 to 4 data distributor
  8. Express Gray code 10111into binary numbers.
  9. Implement full adder using multiplexer.
  10. Draw the block diagram of a 2’s complement 4 – bit adder/ Subtractor.
  11. Write the function table and logic diagram of a 4:1 data selector.
  12. Implement the following function using suitable multiplexer F= Σm(0,2,5,7)
  13. Relate carry generate, carry propagate, sum and carry-out of a carry look ahead adder.
  14. Design a single bit magnitude comparator to compare two words A and B.
  15. What is priority encoder?
  16. Design a three bit even parity generator.
  17. Draw the logic diagram of a serial adder.
  18. Design a half subtractor combinational circuit to produce the outputs Difference and Borrow.
  19. Draw the logic diagram of a 2 bit multiplier.
  20. Suggest a solution to overcome the limitation on the speed of an adder.

Part – B

  1. (i). Implement the following function using suitable multiplexer F (A, B, C, D) = Σ(1, 3, 4, 11, 12, 13, 14 , 15 ) (8) (ii). Draw the logic diagram of a 2-bit by 2-bit binary multiplier and explain its operation. (8)
  2. Draw the block schematic of Magnitude comparator and explain its operation (16)
  3. Draw & explain the block diagram of a 4-bit parallel adder / Subtractor (16)
  4. (i) Design & implement the conversion circuits for BCD to Excess – 3 code. (10) (ii) Implement full subtractor using Demultiplexer. (6)
  1. Design an Excess – 3 to BCD code converter. Uses don’t care (16)
  2. (^) (i). Implement full adder using decoder. (
    1. (ii).Realize F(w, x, y, z)=^ Σ^ (1,4,6,7,8,9,10,11,15) using 8 to 1 Mux (
  1. Explain the operation of carry look ahead adder with neat diagram (16)
  2. (i). Draw and explain the BCD adder circuit. (
    1. (ii). Design a seven segment decoder circuit to display the numbers from 0 to
    1. (
  3. (i). Draw the logic diagram of BCD to Decimal decoder and explain its operations. (
  1. (ii).Explain even parity checker and generator. (6)
  1. Draw & explain the block diagram of a 4-bit serial adder to add contents of two registers. (16) UNIT –III SEQUENTIAL CIRCUITS Part – A
  2. Compare Asynchronous and Synchronous sequential logic.
  3. Draw the state diagram and characteristics equation of a D FF.
  4. What is latch? What is the difference between latch and flip flop?
  5. Realize T Flip Flop using SR Flip Flop
  6. How does the JK FF differ from an SR FF in its basic equation?
  7. Define Synchronous counter.
  8. (^) Define Setup and Hold time.
  9. What is the condition on JK FF to work as D FF?
  10. What is race around condition? How do you eliminate it?
  11. Mention any two differences between the edge triggering and level triggering.
  12. Draw the state diagram of MOD -10 counters.
  13. What is sequential circuit? Give some example.
  14. Draw a NAND based logic diagram of Master Slave JK FF.
  15. Convert Transparent flip flop into a JK flip flop.
  16. Differentiate Asynchronous and Modulus counter
  1. i). Design and explain the working of an 4-bit Parallel counter (8) ii). Design and working of a BCD ripple counter with timing diagram. (8)
  2. i).Design a 3 bit synchronous counter which counts in the sequence 000, 001, 011, 010,100, 110, (repeat) 000 …using D flip flop. (10) ii).Analyze the logic diagram and draw the state diagram for the given logic. (6)
  3. i).Design and explain the working of an 4-bit Up/Down ripple counter (8) ii). Design and working of a synchronous MOD- 5 counter. (8)
  4. i).Design a synchronous counter with states 0, 1, 2, 3, 0, 1, .... using JK flip flop. (8) ii).Construct a JK FF using a D FF, a 2:1 Multiplexer and an inverter. (8)
  5. i).Design and explain the working of an 4-bit Up/Down Parallel counter. (10) ii). Realize JK Flip Flop using SR Flip Flop (6)
  6. (i).Explain the operation of universal shift register with neat block diagram. (8) (ii). Explain the working Master/Slave JK FF (8)
  7. i). Draw the logic diagram for a 5- bit serial load shift register using D FF & explain. (10) ii). Write notes on state minimization. (6)
  8. Draw a 4-bit SISO SIPO, PIPO and PISO shift register and draw its waveforms (16)
  9. i). Draw an asynchronous decade counter & explain its operation with neat waveforms.(8) ii). Design a 3-bit binary counter using T FF that has a repeated sequence of 6 states. 000- 001-010-011-100-101-110. Give the state table, state diagram & logic diagram. (8)
  10. Sequential circuit has three flip flops A, B, and C; one input x_in ; and one output y_out. The state diagram is shown in below figure. The circuit is to be designed by treating the unused states as don’t care conditions. Analyze the circuit obtain from the design to determine the effect of the unused states. Use T flip flops in the design. (16)

UNIT –IV

MEMORY DEVICES

Part – A

  1. How the memories are classified.
  2. What is an EPROM?
  3. Compare and contrast static RAM and dynamic RAM
  4. What is PLD? List their types.
  5. Explain write operation with an example.
  6. Distinguish between PAL and PLA.
  7. Which memory is called volatile? Why?
  8. Write the advantages of EPROM over a PROM.
  9. Compare the features of PROM, PAL and PLA
  10. What is access time and cycle time of a memory?
  11. What is PLA? How does it differ from PAL and GAL?
  12. What is memory decoding?
  13. Implement the Exclusive-OR function using PROM
  14. Write the advantages of E 2 PROM over an EPROM.
    1. Implement the function F1=∑ (0, 1, 2, 5, 7) and F2 = ∑ (1, 2, 4, 6) using PROM.
    2. Draw the static and dynamic RAM cells.
    3. Implement a 2-bit multiplier using ROM.
    4. What is meant by memory expansion? Mention its limit.
  1. i). Realize the following function using PLA F (w, x, y, z) = Π (0, 3, 5, 7, 12, 15)
    • d (2, 9). (8) ii). Implement Binary to Gray code converter using PROM devices (8)
  1. Implement the following Boolean functions using 4 × 3 × 4 PAL (16) i. W(A, B, C, D) = ∑ (0, 2, 6, 7, 8, 9, 12, 13) ii. X (A, B, C, D) = ∑ (0, 2, 6, 7, 8, 9, 12, 13, 14). iii. Y(A, B, C, D) = ∑ ( 2, 3, 8, 9, 10, 12, 13) iv. Z(A, B, C, D) = ∑ (1, 3, 4, 6, 9, 12, 14)
  2. i). Explain the principle of operation of Bipolar SRAM cell. (8) ii). How can one make 64X8 ROM using 32X4 ROMs? Draw such a circuit & explain. (8) UNIT –V SYNCHRONOUS AND ASYNCHRONOUS SEQUENTIAL CIRCUITS Part – A
  3. Differentiate synchronous and asynchronous sequential circuits?
  4. What are the two types of Asynchronous sequential circuits?
  5. Differentiate Moore machine and Mealy machine.
  6. Define flow table and primitive flow table.
  7. Write a Verilog HDL model of a full subtractor circuit.
  8. Define state table and state assignment.
  9. Draw the basic building blocks of an Algorithmic State Machine chart?
  10. Differentiate stable and unstable state.
  11. Write a Verilog behavioral model of a Transparent flip flop with reset input.
  12. Draw block diagram for Moore and Mealy model.
  13. Define the terms race and critical race.
  14. What is a state diagram? Give an example
  15. Write a Verilog code for 4-to-2 Encoder using gate level model.
  16. What are Hazards? How it can be avoided?
  17. Compare the ASM chart with a conventional flow chart.
  18. Differentiate fundamental mode and pulse mode asynchronous sequential circuits.
  19. Design a 3 input NAND gate using Verilog.
  20. What is the cause for essential Hazard?
  21. Write a Verilog model of 4:1 multiplexer circuit.
  22. Write analysis procedure of synchronous sequential circuits.

i). Reduce the number of states in the following state table, and tabulate the reduced state table. (8)

a f^ b^^0 b d c 0 0 c f e 0 0 d g a 1 0 e d c 0 0 f f b 1 1 g g h 0 1 h g a 1 0

ii). Analyze the synchronous sequential logic circuit and derive the transition table and state diagram. (8)

Present State Next State Output X = 0 X =1 X =0 X=

  1. Design a clocked synchronous sequential machine using T flip flops for the following state diagram. Use state reduction if possible .also use straight binary state assignment. (16)

ii). What is ASM? Give the basic notations. (4)