Scribd
Upload
233 views3 pages

Question Bank For Digital Systems

This document contains questions related to digital electronics and instrumentation & control engineering. It covers topics like binary systems, Boolean algebra, logic gates, simplification of Boolean functions, combinational logic, and combinational logic with MSI and LSI. There are over 50 questions in total across various units testing knowledge of digital concepts, number systems, logic operations, circuit design and integrated circuits.

Uploaded by

ekta vasani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
233 views3 pages

Question Bank For Digital Systems

This document contains questions related to digital electronics and instrumentation & control engineering. It covers topics like binary systems, Boolean algebra, logic gates, simplification of Boolean functions, combinational logic, and combinational logic with MSI and LSI. There are over 50 questions in total across various units testing knowledge of digital concepts, number systems, logic operations, circuit design and integrated circuits.

Uploaded by

ekta vasani
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

INSTRUMENTATION & CONTROL ENGINEERING

SUBJECT CODE: 3131704 SEMESTER – III SUBJECT NAME: DIGITAL ELECTRONICS

Question Bank
UNIT 1: BINARY SYSTEM: Digital computer and digital systems, Binary Number,
Number base conversion Octal and Hexadecimal Number, complements, Binary
Codes, Binary Storage and register, Binary Logic, Integrated Circuit

1. Show the comparision between 1’s complements and 2’s complements.


2. Explain reflected code in detail.
3. Perform the following conversions: i. Binary to Decimal: (1010.011)2 ii. Hexadecimal
to Decimal: (2AF.31)16 iii. Decimal to Binary: (345.75)10 iv. Hexadecimal to Binary:
(306.D)16
4. Convert (163.875)10 to binary
5. Explain gray code in detail.
6. Give logic diagram and truth-table of EX-OR Gate
7. Subtract (3250-72532)10 using 10s compliment
8. Convert the following numbers to decimal: (10101.101)2 , (330.4)8 , (A325)16
9. Represent the decimal number 8620 in BCD, Excess-3, and Gray code.

UNIT 2: BOOLEAN ALGEBRA AND LOGIC GATES: Basic Definition, Axiomatic Definition
of Boolean Algebra, Basic Theorem and Properties of Boolean Algebra, Minterms And
Maxterms, Logic Operations, Digital Logic Gates, IC digital Logic Families

1. Explain Duality principle and DeMorgan theorem with suitable example.


2. List all possible Minterms and Maxterms for three binary variables with their
designation.
3. Show the Boolean function F = xy + x’z in product of maxterm and sum of minterm
form.
4. Define noise margin, propagation delay and fan out.
5. Simplify the Boolean function F =A’C+A’B+AB’C+BC.
6. Explain the commutative law, associative law, and distributive law in Boolean algebra
with example
7. Expand A+BC'+ABD'+ABCD to min terms and max terms.
8. Reduce the expression (B+BC)(B+B'C)(B+D)=B
9. F= x y + x' y' + y' z implement with gates
10. Derive the SOP expression for following term AB'C' + ABC' + AB'CD + A'BC' + AB
11. Reduce the expression A+B[AC+(B+C')D]=A+BD
SIMPLIFICATION OF BOOLEAN FUNCIONS: Different types, K Map method, Product of
sum Simplification, NAND or NOR implementation, Don’t Care condition, Tabulation
method

1. Using k map simplify the Boolean function F(x,y,z,w) = Σ (0,1,2,4,5,6,8,9,12,13,14)


2. Simplify the 4 variable Boolean expression using K-Map: F(x,y,z,w) = Σ
(0,3,4,5,8,10,11,12,13,14)
3. Simplify Boolean function F = A’B’C’+B’CD’+A’BCD’+AB’C’ using K map
4. Simplify the Boolean expression F(A,B,C,D) = Ʃ(2,3,6,7,8,10,11,13,14) using K Map
5. Minimize the following function using tabulation method: F(w, x, y, z) = ∑ (1, 4, 6, 7,
8, 9, 10, 11, 15)
6. Reduce using mapping the expression Σ m(0,1,2,3,5,7,8,9,10,12,13) using K-map and
implement it with NAND.
7. Minimize and implement the following output functions using K-map F1=Σ
m(1,2,3,6,8,12,14,15) F2=Π M(3,4,5,7,11,13,15)+D(6,8).
8. Covert to another canonical form 1. F(A,B,C)=∑(1,7) 2. F(W,X,Y,Z)=П(1,2,5,15) 3.
F(a,b,c,d,e)=∑(1,2,7,8,9,10,11,13,14,23)
9. Simplify: A’B + A’BC’ + A’BCD + A’BC’D’E
10. Implement the following Boolean function F= (A + B′) (CD + E) with NAND gates
11. Reduce using K-mapping the expression F = Σ(1,5,6,12,13,14 )+d(2,4) where d is don’t
care condition. Find out SOP
12. Simplify the Boolean function using the tabulation method
F(A,B,C,D,E,F,G)=∑(20,28,38,39,52,60,102,103,127)
13. Simplify the following Boolean function F(A,B,C,D) =Σ(0,1,2,5,8,9,10).Implement the
simplified equation using NAND gates only
14. Minimize the following function using tabulation method: F(w, x, y, z) = ∑
(0,1,2,8,10,14,15)
15. Simplify the following equation using K-map and implement using logic gates:
F(A,B,C,D) = ∑(0,1,2,3,5,7,8,9,10,12,13)

COMBINATIONAL LOGIC: Introduction, Design Procedure, adder, subtractor, Code


Conversion, Universal Gate

1. Show that NAND and NOR are universal gates.


2. Design a full adder circuit using half adders and OR gate.
3. Explain AND-OR-INVERT implementation with equivalent nondegenarate form
4. Design full subtractor with necessary truth table, K map and final design.
5. Design Full Adder using two Half Adder and one two input OR gate.
6. Design 3 – bit Gray code to binary code converter.
7. Realize Ex-OR gate and NOT gate using NOR gate.
8. Explain binary to gray and gray to binary conversion with circuit diagram and truth
table.
COMBINATIONAL LOGIC WITH MSI AND LSI: Introduction, Binary Parallel Adder,
Decimal Adder, The look ahead carry Adder, Excess-3 Adder, Binary Multipliers, Parity
bit Generators/checkers, Magnitude Comparator, Encoder, Decoder, Multiplexer,
Demultiplexer, Hazards and hazards free realization.

1. Write applications of Multiplexers and Demultiplexers.


2. How does an encoder differ from a decoder?
3. Design BCD to Excess -3 code converter with necessary truth table, K map and final
design
4. Design odd parity checker with suitable implementation.
5. Explain 4-bit magnitude comparator
6. What is Parity Generator? Discuss different types of parity generators
7. Explain the basic principle of working of 4:1 Multiplexer.
8. Implement the following function with 8:1 multiplexer: F(A, B, C, D)= ∑(0, 1, 3, 4, 8,
9, 15)
9. Design 3-to-8-line decoder with neat sketch and truth table.
10. Explain BCD adder with diagram and truth table

- Prepared by:
- Ekta Vasani
- EC Department

You might also like