0% found this document useful (0 votes)
10 views15 pages

(PCO MME) Tut9-10 Logic Gate and Boolean Expression

The document outlines exercises related to logic gates and Boolean expressions, including truth table completion, logic circuit analysis, and simplification of Boolean expressions. It contains various exercises that require understanding of logic gates like AND, OR, NAND, NOR, and EXOR, as well as Boolean algebra principles. Additionally, it includes questions about the properties of Boolean functions and their simplifications.

Uploaded by

Nguyen Linh Nhi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views15 pages

(PCO MME) Tut9-10 Logic Gate and Boolean Expression

The document outlines exercises related to logic gates and Boolean expressions, including truth table completion, logic circuit analysis, and simplification of Boolean expressions. It contains various exercises that require understanding of logic gates like AND, OR, NAND, NOR, and EXOR, as well as Boolean algebra principles. Additionally, it includes questions about the properties of Boolean functions and their simplifications.

Uploaded by

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

LOGIC GATE and BOOLEAN EXPRESSION

PART I: LOGIC GATE

Exercise 1:

1. A Logic circuit has two inputs being X and Y X Y


fill in all the possible combinations.

2. The figure below shows a logic circuit and its incomplete truth table. Complete the below truth
table.

A B C Q
A
C Q 0 0
B 0 1
1 0
1 1

3. The figure below shows a logic circuit and its incomplete truth table. Complete its truth table.

A C A B C D Q
Q 0 0
B
0
D
11 0
1 1

4. The figure below shows a logic circuit and its incomplete truth table. Complete the below truth
table.
A
A B C D Q
C
Q 0
0

B D 1
1
5. The figure below shows a logic circuit and its incomplete truth table. Complete the below truth
table.
6. For the logic circuit below complete the truth table.
Exercise 2:

In the diagrams below, will the output indicated by the question mark be 0 or 1?
a)

b)

c)
d)

e)
Exercise 3:
E1. Obtain the rules for simplifying the logical expressions
x
(a) x + 0 which corresponds to the logic gate

x
(b) x + 1 which corresponds to the logic gate

E2. Obtain the rules for simplifying the logical expressions:


(a) x + x which corresponds to the logic gate x

(b) x · x which corresponds to the logic gate x

E3. Obtain the rules for simplifying the logical expressions:


(a) x + x’ which corresponds to the logic gate x

(b) x · x’ which corresponds to the logic gate x

Exercise 4:

http://www.ee.surrey.ac.uk/Projects/CAL/digital-logic/gatesfunc/QuizFrameSet.htm

type NAND construction NOR construction

NOT
AND

NAND

OR

NOR

XOR

XNO
R
1. What does an EXOR gate do?
Give a high output when one or more of its inputs are high
Give a high output when only one of its inputs are high
Give a low output when one or more of its inputs are high
Give a low output when only one of its inputs are high
2. Which of the following symbols represents a NOR gate?

D
3. Which one of the following truth tables represents the behavoir a NAND gate?

A B

C D
4. What does connecting together the inputs of NAND and NOR gates do?
 Help produce multi-input gates
 Produce and EXNOR gate
 Produce a NOT gate
 Damage the gate
5. How do you make a NAND gate out of an AND gate using inverters (NOT gates)?
 Invert the output from the AND gate
 Invert both the inputs to the AND gate
 Invert one of the inputs to the AND gate
 Invert both the inputs and output of the AND gate
6. What type of logic gate does this symbol represent?

 Exclusive OR
 Exclusive NOR
 OR
 NOR
7. How do you make a NOR gate out of an NAND gate using inverters (NOT gates)?
 Invert the output from the NAND gate
 Invert both the inputs to the NAND gate
 Invert one of the inputs to the NAND gate
 Invert both the inputs and output of the NAND gate

A B NOR Not A NotB NAND(NotA,NotB) OR(notA,NotB)


0 0 1 1 1 0 1
0 1 0 1 0 1 1
1 0 0 0 1 1 1
1 1 0 0 0 1 0

8. What type of logic gate's behaviour does this truth table represent?

 2 input OR
 3 input OR
 3 input EXOR
 4 input EXOR
9. What type of logic gate does this logic circuit configuration produce?
 NAND gate
 NOR gate
 EXOR gate
 EXNOR gate
10. How do you make an AND gate out of an OR gate using inverters (NOT gates)?
 Invert the output from the OR gate
 Invert both the inputs to the OR gate
 Invert one of the inputs to the OR gate
 Invert both the inputs and output of the OR gate

PART II: Boolean Algebra


The Boolean Inequalities are:

Exercise 5:
Exercise 6:
http://www.ee.surrey.ac.uk/Projects/CAL/digital-logic/boolalgebra/quiz/index.html

1. Give the relationship that represents the dual of the Boolean property A + 1 = 1?
(Note: * = AND, + = OR and ' = NOT)

1. A*1=1
2. A*0=0
3. A+0=0
4. A*A=A
5. A*1=1

2. Give the best definition of a literal?

1. A Boolean variable
2. The complement of a Boolean variable
3. 1 or 2
4. A Boolean variable interpreted literally
5. The actual understanding of a Boolean variable

3. Simplify the Boolean expression (A+B+C)(D+E)' + (A+B+C)(D+E) and choose the best answer.

1. A+B+C
2. D+E
3. A'B'C'
4. D'E'
5. None of the above

4. Which of the following relationships represents the dual of the Boolean property x + x'y = x + y?
1. x'(x + y') = x'y'
2. x(x'y) = xy
3. x*x' + y = xy
4. x'(xy') = x'y'
5. x(x' + y) = xy

5. Given the function F(X,Y,Z) = XZ + Z(X'+ XY), the equivalent most simplified Boolean
representation for F is:

1. Z + YZ
2. Z + XYZ
3. XZ
4. X + YZ
5. None of the above

6. Which of the following Boolean functions is algebraically complete?

1. F = xy
2. F=x+y
3. F = x'
4. F = xy + yz
5. F = x + y'

7. Simplification of the Boolean expression (A + B)'(C + D + E)' + (A + B)' yields which of the
following results?

1. A+B
2. A'B'
3. C+D+E
4. C'D'E'
5. A'B'C'D'E'

8. Given that F = A'B'+ C'+ D'+ E', which of the following represent the only correct expression for
F'?

1. F'= A+B+C+D+E
2. F'= ABCDE
3. F'= AB(C+D+E)
4. F'= AB+C'+D'+E'
5. F'= (A+B)CDE
9. An equivalent representation for the Boolean expression A' + 1 is

1. A
2. A'
3. 1
4. 0

10. Simplification of the Boolean expression AB + ABC + ABCD + ABCDE + ABCDEF yields
which of the following results?

1. ABCDEF
2. AB
3. AB + CD + EF
4. A+B+C+D+E+F
5. A + B(C+D(E+F))

https://www.brainpop.com/math/algebra/logicgates/quiz/print.pdf

Exercise 7:

Minimize the following Boolean Expression using


algebric simplification:
a) f (a,b, c) =a′b+bc′+bc+ab′c′?
b) F (A, B, C) = A'BC' + AB'C' + A'B'C' + A'B'C'
c) F(A,B,C)=(A+B)(A+C)
d) (A + B + C)(A +B + C)(A + B + C)
e) A′B′C′+A′B+ABC′+AC
f) F= C (B+C) (A+B+ C)
i) 𝐴′𝐵′𝐶𝐷+𝐴′𝐵′𝐶′𝐷+𝐴𝐵𝐶′𝐷′+𝐴′𝐵𝐶′𝐷+𝐴𝐵′𝐶′𝐷′
g) Y=C′+D′+A′B′CD

j)𝐴′𝐵′𝐶′𝐷+𝐴′𝐵′𝐶𝐷+𝐴′𝐵𝐶′𝐷′+𝐴′𝐵𝐶′𝐷+𝐴′𝐵𝐶𝐷′+𝐴𝐵
′𝐶′𝐷′+𝐴𝐵′𝐶′𝐷+𝐴𝐵𝐶′𝐷′+𝐴𝐵𝐶𝐷′+𝐴𝐵𝐶𝐷 = 𝐴′𝐵
′𝐷+𝐴′𝐶′𝐷+𝐴𝐵′𝐶′+𝐴𝐵𝐶+𝐵𝐷′ ???
k) 𝐴′𝐵′𝐶′𝐷′+𝐴′𝐵′𝐶′𝐷+𝐴′𝐵𝐶′𝐷+𝐴′𝐵𝐶𝐷+𝐴𝐵′𝐶′𝐷′+𝐴𝐵′𝐶′𝐷+𝐴𝐵′𝐶𝐷′+𝐴𝐵𝐶′𝐷
′+𝐴𝐵𝐶′𝐷+𝐴𝐵𝐶𝐷

= 𝐵𝐷+𝐴𝐶′+𝐵′ 𝐶′ ???
l)
Simplify this Boolean expression: A'BC+AB'C+A'B'C' + AB'C + AB?

https://www.quora.com/How-can-you-minimize-the-following-Boolean-expression-using-algebric-
simplification-f-a-b-c-a-b-bc-bc-ab-c

Exercise 8:

Simplify The Following Expressions Using Boolean Algebra

Exercise 9:

Design a circuit (3 input) which gives a high input only when there is even
number of low or high inputs.
Read more on Sarthaks.com - https://www.sarthaks.com/441889/design-circuit-
input-which-gives-high-input-only-when-there-is-even-number-low-high-inputs

Following truth table gives a high input, only when there is even number of low
or high inputs:

You might also like