Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

[1 ] a)Verify the following Boolean theorem using truth tables. A.(B+C) = A.B+A.C

(b) A diagram of a logical circuit is given below. Answer the parts (i) ,(ii) and (iii) using it.

(i) Write down the Boolean expression for the (output) F, in the given logical circuit using
(input) A ,B, C.

(ii) Convert the output F of the logical circurit, that is f(A,B,C) into the sum of product (SOP)
Normal form.

(iii) Convert the expression obtained in the above into the product of sum (POS) Normal form.
(c) Solve the following Boolean expression by using “Karnaugh Map”.

iv) f (A, B, C, D) = A'BCD + A'BCD'+ AB'CD' +AB'CD + A'B'CD + A'B'CD' + AB'C'D'+

AB'C'D + A'B'C'D + A'B'C'D'

(c). Answer the following questions considering the following logic circuit.

Nawodani Samarasinghe 0714464570

Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

[2]
(i) Draw the truth table considering for every AND gate that output is 1.

(ii) Write down the Boolean expression for the output of the above circuit using a truth table.

(iii) Simplify the above expression using Boolean algebra or Karnaugh (K-Map).
(iv) Design the logic circuit for the answer you have obtained in above (iii).
(v) Convert the Boolean expression you obtained for the above part (ii) to Product of Sum
(POS).

MCQ

1]What is the equivalent logic gate of the above logic gate? 1) AND gate 2) OR gate 3)
XOR gate 4) NOR gate 5) NOT gate

2]What is the output of Boolean expression using demorgan theorem?

(1) 0 (2) 1 (3) X (4) Y (5) X.Y

Nawodani Samarasinghe 0714464570

Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

3]The value of 𝐴'+𝐴 in Boolean logic is, බූලියන් තර්කනයේ 𝐴 '+A හි අගය,

1) 1 2) 0 3) A' 4) 𝐴 5) 10

4]Equivalent of X+(X+Y) is,

X + (X + Y) ට සමාන වන්යන්,
A) X+XY
B) X+Y
C) Y
D) ((X+Y)')'

1) A,B Only 2) B,D Only 3) A,B,C Only 4) A,B,D Only

5]

6]The simplified result of the Boolean function 𝑥𝑦̅𝑧 + 𝑥̅𝑦̅𝑧 + 𝑥𝑦𝑧

(1) 𝑥𝑦 (2) 𝑦𝑧 (3) 𝑥̅𝑦 (4) 𝑦̅𝑧 (5) 𝑧(𝑥 + 𝑦̅)

Consider the following logic circuit.

7]Consider the following Boolean function.

𝑓(𝑥, 𝑦) = 𝑥̅(𝑥 + 𝑦) + (𝑦 + 𝑥)(𝑥 + 𝑦̅)

Which of the following is the simplified form of 𝑓(𝑥, 𝑦)?

(1) 𝑥 (2) 𝑦 (3) 𝑥̅ (4) 𝑥 + 𝑦 (5) 𝑦̅

Nawodani Samarasinghe 0714464570

Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

8]What is the equivalent form(s) of the following Boolean expression?

𝑓(𝑥, 𝑦, 𝑧) = 𝑥̅𝑦 + 𝑥𝑦𝑧̅ + 𝑥𝑦𝑧
A – 𝑥̅𝑦 + 𝑦
B–𝑦
C–𝑥
D – 𝑥̅𝑦 + 𝑥
E – 𝑥̅𝑦 + 𝑥𝑦
(1) A only (2) B only (3) C only (4) B, E only (5) A, B, C, D, E all

9]Consider the following combinational logic gate.

What is the simplified result of the above combinational logic gate?

(1) 𝐴𝐵 + 𝐶 (2) 𝐴̅𝐵 ̅ + 𝐵𝐶 (3) 𝐴𝐵 + 𝐵𝐶 (4) 𝐴̅𝐵 + 𝐶 (5) 𝐴𝐵 ̅ + 𝐶

10] Consider the following logic circuit diagram:

What is the equivalent gate for the above circuit diagram?

(1) NOR gate. (2) OR gate (3) AND gate (4) NOT gate (5) NAND gate

11] What is the answer to the Boolean expression when F = (X.Y)(X+Y) is simplified?
(1) 0 (2) 1 (3) X.Y (4) (X+Y) (5) (X.Y)

12]

Nawodani Samarasinghe 0714464570

Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

13]
The Boolean expression for the truth table

(1) 𝐵̅(A + 𝐶̅ ) ( 𝐴̅+ C)

(2) 𝐵(𝐴 + 𝐶)(𝐴̅ +𝐶̅ )
(3) 𝐵̅(A + C) ( 𝐴̅+ 𝐶̅ )
(4) 𝐵(𝐴 + 𝐶̅ )(𝐴̅ +C)
(5) 𝐵(𝐴̅ + 𝐶̅ )(𝐴̅ +C)
14]

1. (ABC)+ (ABC) (BC) Is the simplest form in the Boolean translation

(1) 0 (2) 1 (3) A (4) BC (5)AB

15]

(x + y)(x + 1)
The translation is derived using Boolean mathematics
(1) x +y (3) x + (y + 1) (5)1
(2) x(1 + y) (4) x + (y.1)
16] Y = AB + CD,
The Boolean expression can be solved using NAND gates with two inputs. The
number of minimum gates is the number,
(1) 2 (4) 3
(2) 4 (5) 6
(3) 5
17]

18]

Nawodani Samarasinghe 0714464570

Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

[15],[16]

17),18),19)

20)

Nawodani Samarasinghe 0714464570

Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

21)

Nawodani Samarasinghe 0714464570

Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

[3]

There is an only one door to go inside the defense room in a building. That door always shut and
locked. Three devices are fixed in front of this door, one device for scan the finger print, another
device for input secrete code and last device for read the magnetic stripe of the identity card of a
person. The following conditions must be satisfied to open the defense room‟s door when a
person goes inside the room. A person must scan his/her finger print and input secrete code
or input identity card to that specific devices. The door will be open when the data are input
above mentioned devices correctly.
The following table assigns Boolean values for the above functionalities

Functionalities Boolean Value

The Door is closed 1
The door is open 0
Finger Print detect as correct 1
Finger Print detect as incorrect 0
Select code identify as correct 1
Select code identify as incorrect 0
Identity card is correct 1
Identity card is incorrect 0
Construct the truth table for the conditions that are open the door.
(ii) Write the Boolean expression to represent the truth table constructed in the question (i).
(iii) Simplify the Boolean expression derived in question (ii). (Write the rules clearly that used to
simplify expression)
(iv) Draw the logic circuit for the simplified expression.

Nawodani Samarasinghe 0714464570

Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

[4]
(a) State the following Boolean Laws.
(i) De Morgan’s Law
(ii) Associative Law

(b) A coin is tossed 3 times. A win is said to occur if the result obtained is Heads for at least 2
tosses. Taking A, B, C as inputs and W as output, given that A, B, C are 1 if the result is
Heads or 0 if the result is Tails; and W is 1 if a win occurs otherwise it is 0.

(i) Construct a truth table.

(ii) Write a Boolean expression for W in the form of SOP (sum of product).
(iii) Simplify the expression obtained in (ii) above using Karnaugh map.
(iv) Draw a combined gate for the simplified expression obtained in (iii).

[5]

State control system of an electrically operated train has been designed to light up the alarm bulb
in an alarming situation. There are 04 sensors to identify this state. When the manual switch is
on,
the first sensor is activated. When fire flames occur, the second sensor is activated. When the
temperature is higher than 50 0C, the third sensor is activated. When the pressure increases over
the 1 atm, the forth sensor is activated.

The alarm signal bulbs are lit for the following states.
• The first sensor is activated.
• The second sensor and the third sensor are activated together.
• The third sensor and the fourth sensor are activated together.
• The second sensor and the fourth sensor are activated and the first sensor is deactivated.
Activated state of all the signals - The logical value is 1.
When the alarm bulb is on - The logical value is 1.
(a) Develop a truth table to represent the functionality of the above system.
(b) (i) Derive a Boolean expression to represent the truth table obtained in section (a) above.
(ii) Simplify the Boolean expression obtained in section b (i) above, using a Karnaugh map.
(iii) Design a logic circuit diagram for the Boolean expression you have received in section b
(ii) above.
(iv) Express the Boolean expression you have received in section b (ii) above, convert as a
Product of Sum (POS) form.

[6]

Simplify the following Boolean expressions by using Boolean theorems

Nawodani Samarasinghe 0714464570

Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

Simplify the following Boolean expressions by using K-maps

Nawodani Samarasinghe 0714464570

Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

Nawodani Samarasinghe 0714464570

Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

Nawodani Samarasinghe 0714464570

Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

Nawodani Samarasinghe 0714464570

Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

Nawodani Samarasinghe 0714464570

Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

Nawodani Samarasinghe 0714464570

Revision Grade 12/13 - 2020/2021 -Logic Gates And Boolean Algebra

Nawodani Samarasinghe 0714464570