Scribd
Upload
39 views2 pages

DDCO Q Bank

Uploaded by

shadow.range03
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
39 views2 pages

DDCO Q Bank

Uploaded by

shadow.range03
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/ 2

Apply Boolean properties to reduce the following Boolean expressions to the indicated number of literals:

(i)(A’ + C) (A’ + C’) (A + B + C’D) to four literals


(ii)A’C’ + ABC + AC’ to three literals
Use Boolean properties for the Boolean function F = xy’z + x’y’z + w’xy + wx’y + wxy
(i)Obtain the truth table of F.
(ii)Draw the logic diagram, using the original Boolean expression.
Discuss the Boolean theorems and postulates in detail?
Use K-Map to simplify the following Boolean expressions
A’B’C’D’+ AC’D’+ B’CD’ + A’BCD + BC’D
Solve the following Boolean function F using K-Map , together with the don’t-care conditions d , and then
express the simplified function in SOP and POS form.
F(A,B,C,D) = Ʃ(4, 12,7,2,10)
d(A,B,C,D) = Ʃ(0, 6, 8)
Model the following Boolean function F , together with the don’t-care conditions d , using no more than two
NOR gates:
F(A, B, C, D) = Ʃ(2, 4, 10, 12, 14)
d(A, B, C, D) = Ʃ(0, 1, 5, 8)
Assume that both the normal and complement inputs are available.
Determine a 3-bit adder combinational circuit using 2 bit adders
Design a half subtractor using 2:4 combinational circuit?
Design a full subtractor using 3:8 combinational circuit?
Demonstrate the validity of the following identities by means of truth tables
(i) x + yz = ( x + y )( x + z )
(ii) x(y + z) = xy + xz
Solve the following Boolean expressions to a minimum number of literals. Also draw logic diagrams of the
circuits that implement the original and simplified expressions
(i)(x + y) (x + y’)
(ii)xyz + x’y + xyz’
Explain the Boolean theorems and postulates in detail
Simplify the following Boolean expressions, using four-variable maps:
A’B’C’D + AB’D + A’BC’ + ABCD + AB’C
Solve the following Boolean function F , together with the don’t-care conditions d , and then express the
simplified function in SOP and POS form.
F(A,B,C,D) = Ʃ(0, 6,8,13,14)
d(A,B,C,D) = Ʃ(2, 4, 10)
Model the multiple-level NOR circuit for the following expression: CD(B + C)A + (BC’ + DE’)

Present the multiple-level NAND circuit for the following expression: w(x + y + z) + xyz
Design a 3-bit subtractor combinational circuit using 2 bit subtractors
Discuss the combinational circuit that decodes 3 input variables?

Discuss the combinational circuit that encodes 4 input variables?


Demonstrate the validity of the following identities by means of truth
(i) DeMorgan’s theorem for three variables: (x + y + z)’ = x’y’z’
(ii) (xyz)’ = x’ + y’ + z’
F = xy'z + x'y'z + w'xy + wx'y + wxy
(i)Use Boolean algebra to simplify the function to a minimum number of literals (ii)Present the truth table for the
same
(iii)Model the logic diagram from the simplified expression
Explain the Boolean theorems and postulates in detail

Simplify the following Boolean expressions, using four-variable maps:


A’B’C’D’ + BC’D + A’C’D + A’BCD + ACD’
Solve the following Boolean function F , together with the don’t-care conditions d , and then express the
simplified function in SOP and POS form.
F(x, y, z) = Ʃ(0, 1, 4, 5, 6)
d(x, y, z) = Ʃ(2, 3, 7)
Present a logic diagram using only two-input NOR gates to implement the following function: F(A, B, C, D) =
(A ⊕ B)'(C ⊕ D)
Explain the implementation of a 2-bit adder and 3-bit adder combinational circuits?

Describe a combinational circuit that decodes 2 input variables?

Describe a combinational circuit that encodes 8 input variables?

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