Digital Logics and Microprocessor

Lab Assessment 3
Registration No.: 19BIT0267
Name: ANKIT KUMAR
Slot: L47 + L48

1. Implement the following Boolean function F(ABCD)=m0+m3+m4+m5+m12+m13 using a

Truth Table:
A B C D F
0 0 0 0 1
0 0 0 1 0
0 0 1 0 0
0 0 1 1 1
0 1 0 0 1
0 1 0 1 1
0 1 1 0 0
0 1 1 1 0
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 1
1 1 0 0 1
1 1 0 1 0
1 1 1 0 0
1 1 1 1 0

Expression: F = A’C’D’ + A’B’CD + BC’

Circuit Diagram:
2. Bank Vault with three keys.

Truth Table:
A B C Z
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 0
1 0 1 1
1 1 0 1
1 1 1 1

Expression:
Z = AB + BC + AC

Circuit Diagram:
3. Implement the following Boolean function
F(ABCD)=m0+m3+m4+m5+m12+m13+m14+m15 using a multiplexer.

Truth Table:
A B C D F Y
0 0 0 0 1 I0
0 0 0 1 0 I1
0 0 1 0 0 I2
0 0 1 1 1 I3
0 1 0 0 1 I4
0 1 0 1 1 I5
0 1 1 0 0 I6
0 1 1 1 0 I7
1 0 0 0 0 I8
1 0 0 1 0 I9
1 0 1 0 0 I10
1 0 1 1 0 I11
1 1 0 0 1 I12
1 1 0 1 1 I13
1 1 1 0 1 I14
1 1 1 1 1 I15

Expression:
F = AB + A’BC’ + A’C’D + A’B’CD

Circuit Diagram:
4. Design a 3-bit binary to Gray code converter.

Truth Table:

A B C X Y Z
0 0 0 0 0 0
0 0 1 0 0 1
0 1 0 0 1 1
0 1 1 0 1 0
1 0 0 1 1 0
1 0 1 1 1 1
1 1 0 1 0 1
1 1 1 1 0 0

Expression:
X=A
Y = A’B + AB’
Z = B’C + BC’

Circuit Diagram:
5. Design a combinational logic circuit that takes 4-bit Binary input and outputs 4-bit 8 4 -2 -1
code.

Truth Table:
BCD 8 4 -2 -1
A B C D S1 S2 S3 S4
0 0 0 0 0 0 0 0
0 0 0 1 0 1 1 1
0 0 1 0 0 1 1 0
0 0 1 1 0 1 0 1
0 1 0 0 0 1 0 0
0 1 0 1 1 0 1 1
0 1 1 0 1 0 1 0
0 1 1 1 1 0 0 1
1 0 0 0 1 0 0 0
1 0 0 1 1 1 1 1

Expression:
S1= A+BC+BD
S2= B⊕(C+D)
S3=C⊕D
S4=D

Circuit Diagram:
6. Implement the following Boolean function
F(ABCD)=m0+m3+m4+m5+m12+m13+m14+m15 using a 4X1 multiplexer.

Truth table:
A B C D F S2 S1 S0 Y
0 0 0 0 1 0 0 0 I0
0 0 0 1 0 0 0 1 I1
0 0 1 0 0 0 1 0 I2
0 0 1 1 1 0 1 1 I3
0 1 0 0 1 1 0 0 I4
0 1 0 1 1 1 0 1 I5
0 1 1 0 0 1 1 0 I6
0 1 1 1 0 1 1 1 I7
1 0 0 0 0
1 0 0 1 0
1 0 1 0 0
1 0 1 1 0
1 1 0 0 1
1 1 0 1 1
1 1 1 0 1
1 1 1 1 1

Expression:
F = AB + A’BC’ + A’C’D + A’B’CD

Circuit Diagram:
7. Design BCD to seven segment display

Truth Table:
D.N D C B A a b c d e f g
0 0 0 0 0 1 1 1 1 1 1 0
1 0 0 0 1 0 1 1 0 0 0 0
2 0 0 1 0 1 1 0 1 1 0 1
3 0 0 1 1 1 1 1 1 0 0 1
4 0 1 0 0 0 1 1 0 0 1 1
5 0 1 0 1 1 0 1 1 0 1 1
6 0 1 1 0 1 0 1 1 1 1 1
7 0 1 1 1 1 1 1 0 0 0 0
8 1 0 0 0 1 1 1 1 1 1 1
9 1 0 0 1 1 1 1 1 0 1 1

Circuit Diagram:
8. Design 8X1 mux using two 4x1 mux and one 2X1 mux.

Truth table:

S2 S1 S0 Y S1 S0 Y S0 Y
0 0 0 I0 0 0 I0 0 I0
0 0 1 I1 0 1 I1 1 I1
0 1 0 I2 1 0 I2
0 1 1 I3 1 1 I3
1 0 0 I4
1 0 1 I5
1 1 0 I6
1 1 1 I7

Circuit diagram:
9. Design a combinational logic circuit which reads a 4 variable input X and produces a four
variable output Y according to the following equation. Y = X mod 4.

Truth Table:

X0 X1 X2 X3 Y0 Y1 Y2 Y3
0 0 0 0 0 0 0 0
0 0 0 1 0 0 0 1
0 0 1 0 0 0 1 0
0 0 1 1 0 0 1 1
0 1 0 0 0 0 0 0
0 1 0 1 0 0 0 1
0 1 1 0 0 0 1 0
0 1 1 1 0 0 1 1
1 0 0 0 0 0 0 0
1 0 0 1 0 0 0 1
1 0 1 0 0 0 1 0
1 0 1 1 0 0 1 1
1 1 0 0 0 0 0 0
1 1 0 1 0 0 0 1
1 1 1 0 0 0 1 0
1 1 1 1 0 0 1 1

Expression:
Y2 = X2
Y3 = X3

Circuit Diagram:
10. Let variables T represent being tall, H being heavy and F being fast. Let’s consider anyone
who is not tall (T’) as short, not heavy as light and not fast as slow. Write a Boolean
equation to represent the following: You may ride (represented by R) a particular
amusement park ride only if you are either tall and light, or short and heavy and fast.

Truth Table:
T H F R
0 0 0 0
0 0 1 0
0 1 0 0
0 1 1 1
1 0 0 1
1 0 1 1
1 1 0 0
1 1 1 0

Expression:
R = TH’ + T’HF

Circuit Diagram: