Scribd
Upload
29 views2 pages

Module-II DE QUESTION BANK

Uploaded by

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

Module-II DE QUESTION BANK

Uploaded by

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

VARDHAMAN COLLEGE OF ENGINEERING,

HYDERABAD
Autonomous Institute, Affiliated to JNTUH
(Regulations: VCE-R22)
DIGITAL ELECTRONICS
Question Bank Module-II
S. Question Course Bloom’s
No Outcomes Levels
1. Simplify the following Boolean functions using K-map CO1 L4
F1(A,B,C) = Σ m(4, 5, 6, 7)
F2(A,B,C)= Σ m(2, 3, 4, 5)
2. Simplify the Boolean functions using K-map CO1 L4
F(x, y, z) = Σ m(0, 2, 4, 5, 6)

3. For the Boolean function CO1 L4


F = A’C + A’B + AB’C + BC
(a) Express this function as a sum of minterms .
(b) Find the minimal sum-of-products expression using K-map.
4. Simplify the following Boolean functions, using four-variable maps: CO1 L4
(a) F (w, x, y, z) = Σ m (1, 4, 5, 6, 12, 14, 15)
(b) F (A, B, C, D) = Σ m (2, 3, 6, 7, 12, 13, 14)
5. Simplify the following Boolean functions: CO1 L4
(a) F(A, B, C, D) = ∏ (11, 3, 5, 7, 13, 15)
(b) F(A, B, C, D) = ∏ (11, 3, 6, 9, 11, 12, 14)
6. Simplify the following Boolean functions, using Karnaugh maps: CO1 L4
(a) F (x, y, z) = Σ m (2, 3, 6, 7)
(b) F (A, B, C, D) = Σ m 4, 6, 7, 15)
7. Find all the prime implicants for the following Boolean functions, CO1 L4
and determine which are essential:
(a) F (w, x, y, z) = Σ m (0, 2, 4, 5, 6, 7, 8, 10, 13, 15)
(b) F (A, B, C, D) = Σ m (0, 2, 3, 5, 7, 8, 10, 11, 14, 15)
8. Draw a NAND logic diagram that implements the complement of CO1 L4
the following function:
F(A, B, C, D) = Σ m (0, 1, 2, 3, 6, 10, 11, 14)
9. Draw a NOR logic diagram that implements the following function: CO1 L4
F(A, B, C, D) = Σ m (1, 4, 5, 6, 12, 14, 15)
10. Simplify the following functions, and implement them with two- CO1 L4
level NAND gate circuits:
(a) F(A, B, C, D) = AC’D’ + A’C + ABC + AB’C + A’C’D’
(b) F(A, B, C, D) = A’B’C’D + CD + AC’D
11. Simplify the following Boolean functions, using four-variable maps: CO1 L4
(a) F (w, x, y, z) = Σ m (1, 4, 5, 6, 12, 14, 15), which has the don’t-
care conditions d (w, x, y, z) = Σ m (0, 2, 11)
12. Implement the following Boolean functions with universal gates CO1
and basic gates.
L4
F= A (B +CD) +BC’
F= (A + B’) (CD + E)
13. Identify all the prime implicants and essential prime implicants of CO1 L4
the following functions using K-Map.
F(A, B, C, D,E) = ∑m(0, 1, 2,5, 6, 7, 8, 9, 10, 13, 14, 15,19,)
14. Obtain the minimal POS expression for πM(0, 1, 2, 4, 5, 6, 9, 11, 12, CO1 L4
13, 14, 15) and implement it in NOR logic?
15. Simplify the Boolean function F(w, x, y, z) = Σm(1, 3, 7, 11, CO1 L4
15)+Σd(0, 2, 5).
16. Simplify the following functions and implement them with two-
level NAND gate circuits CO1 L4
F(A,B,C,D)=A'B'C'D+CD+AC'D
17. Simplify the following Boolean function F, together with the don’t-
care conditions d, and then express the simplified function in sum-
CO1 L4
of-minterms form:
F(A,B,C,D)= Ʃ(0, 1, 4, 5, 6) , d(A,B,C,D) = Ʃ (2,3,7)
18. Find all the prime implicants for the following Boolean functions,
and determine which are essential:
CO1 L4
F (w, x, y, z) = Ʃ (0,2,7,8,9,10,12,13,14,15)

19. Find all the prime implicants for the following Boolean function
and determine which are essential: CO1 L3
F(A,B,C,D)=∑m(0,2,3,5,7,8,10,11,14,15).
20. Simplify the following Boolean function F,
CO1 L4
F(A,B,C,D)=∑m(0,3,5,8,10,11,14,15)+ d (1,2,7,12) .
Short Answer Questions
1 Simplify the following Boolean function using two-variable K-map CO1 L3
F(A,B)=Σm(0,1,2,3)
2 Describe the Following terms:
I. Prime implicants CO1 L2
II. Essential Prime implicants
3 Simplify the following Boolean function using three-variable map
CO1 L2
F(x,y,z)=Σm(0,1,2,3,4,5,6,7)
4 Implement the Boolean function using minimum number of NAND
CO1 L2
gates F=a+bc.
5 Explain the procedure involved in the minimization of Boolean
CO1 L2
expressions using K-map?
6 Implement basic gates AND, OR using NAND gates. CO1 L3
7 How do you find the octets, quads and pairs in a Karnaugh map? CO1 L2
8 How will you construct a three-variable Karnaugh map from a
CO1 L2
given three inputs A, B, and C truth table?
9 How will you construct a Four -variable Karnaugh map from a
CO1 L2
given four inputs A, B, and C and D truth table?
10 Draw the logic circuit of the following function using NAND Gate
CO2 L3
AB’+A’B
11 What are don’t care conditions? CO1 L2
13 Implement basic gates AND, OR using NOR gate. CO1 L3
14 Implement basic gates AND, NOT using NOR gate. CO1 L3
15 Implement basic gates OR, NOT using NAND gate. CO1 L3

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy