Scribd
Upload
242 views6 pages

Introduction To Gates Assignment

The document contains questions related to Boolean algebra, logic circuits and binary addition. It asks the reader to: 1) Simplify Boolean expressions and draw corresponding logic circuits. 2) Create truth tables for given logic circuits and expressions. 3) Write Boolean expressions for half adders and full adders based on given truth tables, simplify the expressions, and draw the corresponding circuits. 4) Draw a two-bit binary adder circuit using two full adders and create its truth table. The questions require applying concepts of Boolean algebra like simplification using laws of AND, OR and De Morgan's theorems. They also involve drawing logic circuits for Boolean expressions and creating/verifying truth

Uploaded by

yasinthara
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
242 views6 pages

Introduction To Gates Assignment

The document contains questions related to Boolean algebra, logic circuits and binary addition. It asks the reader to: 1) Simplify Boolean expressions and draw corresponding logic circuits. 2) Create truth tables for given logic circuits and expressions. 3) Write Boolean expressions for half adders and full adders based on given truth tables, simplify the expressions, and draw the corresponding circuits. 4) Draw a two-bit binary adder circuit using two full adders and create its truth table. The questions require applying concepts of Boolean algebra like simplification using laws of AND, OR and De Morgan's theorems. They also involve drawing logic circuits for Boolean expressions and creating/verifying truth

Uploaded by

yasinthara
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
Download as pdf or txt
Download as pdf or txt
You are on page 1/ 6

Questions

1. Draw a circuit diagram corresponding to the following Boolean expression:

(A + B)(B + C)

2. Draw a circuit diagram corresponding to the following Boolean expression:

(AB + C)D

3. Draw a circuit diagram corresponding to the following Boolean expression:

A’B + (B+C)’

4. Draw a circuit diagram corresponding to the following Boolean expression:

(AB)’ + (CD)’

5. Show the behavior of the following circuit with a truth table:


A

A B AB A+B AB + (A+B)
0 0
0 1
1 0
1 1

6. Show the behavior of the following circuit with a truth table:


A

A B A’ AB A’  (AB)
0 0
0 1
1 0
1 1
7. Show the behavior of the following circuit with a truth table:
A

C
A B C A’ BC A’(BC)
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
8. Show the behavior of the following circuit with a truth table:
A

A B C AB (BC)’ C’ (AB+C’)’ (BC)’ + (AB+C’)’


0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Boolean Algebra

Questions

1. Simplify the following logic expression up to the level


A.(B+C) + A.B.(A+B+C)
2. Consider the circuit below:

a) Create the truth table for the circuit.


b) Write down the corresponding Boolean algebra expression.
c) Simplify the circuit. Explain which Boolean algebra theorems that are used.

3. Write down a logic expression to detect decimal 2, 3, 4 and 5 and simplify it by using Boolean
algebra. Construct the logic circuit according to the final expression in Tinkercad. (Place LEDs
to indicate all the inputs and outputs). Check whether it gives the correct output and measure
the output voltage and fill the Output column.

A B C Output
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

4. Simplify the following logic expression and construct the circuit according to the final
expression in Tinkercad (Place LEDs to indicate all the inputs and outputs). Write down the
truth table for the operation of the circuit. Measure the output voltage and fill the Output
column. Final expression should be; AB + BC +AC

ABC + ABC + ABC + ABC


A B C Output
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1

5. You are given the following truth table where A,B,C,D are inputs to the circuit and Q is the
output. Write down the logic expression for Q and simplify it by using Boolean algebra. Draw
the circuit diagram. Construct the logic circuit according to the final expression in Tinkercad
(Place LEDs to indicate all the inputs and outputs). Add “Output” column for the table and
measure the output voltage and fill the Output column.
A B C D Q
0 0 0 0 1
0 0 0 1 0
0 0 1 0 1
0 0 1 1 1
0 1 0 0 1
0 1 0 1 1
0 1 1 0 0
0 1 1 1 1
1 0 0 0 1
1 0 0 1 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 1
1 1 1 0 0
1 1 1 1 1
Binary Addition

Input Output
A B S C
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1

Truth Table of a half adder

Input Output
C A B S C1
0 0 0 0 0 A
S
1 0 0 1 0 B
C1
0 1 0 1 0 A
C
1 1 0 0 1 A
0 0 1 1 0
1 0 1 0 1 Block diagram of a full adder
0 1 1 0 1
1 1 1 1 1

Truth Table of a full adder

Questions

1. Write down the logic expressions for half adder circuit using the truth table provided above.
Simplify it by using Boolean algebra and construct the circuit on Tinkercad according to the
final expression (Place LEDs to indicate all the inputs and outputs). Check whether it gives the
correct output and measure the output voltages and fill the Output column.
2. Write down the logic expressions for full adder circuit using the truth table provided above.
Simplify it by using Boolean algebra. Construct the circuit according to the final expression.
Construct the logic circuit according to the final expression in Tinkercad (Place LEDs to
indicate all the inputs and outputs). Check whether it gives the correct output and measure the
output voltages and fill the Output column. Final expressions should be;
S = C  ( A  B)  : XOR gate

C1= C. ( A  B ) + A.B
3. Draw a circuit using two full adders that adds two two-bit binary values. Show its
corresponding truth table. Construct the logic circuit according to the final expression in
Tinkercad (Place LEDs to indicate all the inputs and outputs). Check whether it gives the
correct output and measure the output voltages and fill the Output column.

You might also like