Professional Documents
Culture Documents
Akekaduro24 - 1881222 3
Akekaduro24 - 1881222 3
U1A
S1A
Key = A 7400N
U2A
U3A
7404N
7400N LED1
R1 R2
1kΩ
1kΩ
The system will have two interactive digital sensors, one for each approach to the
intersection.
The inverted signals from both sensors will be fed into separate AND gates. The
outputs of the two AND gates will then be combined using an OR gate.
The output of the OR gate will control the indicator, determining whether the traffic light
should be red (stop) or green (go) for the respective approach.
Operation:
• If vehicles are detected at both approaches, both sensor signals will be 1, resulting in a
1 output from both AND gates and a 1 output from the OR gate. This will trigger the
indicator to display a red light for both approaches, signaling both to stop.
• If vehicles are detected at only one approach, the corresponding sensor signal will be 1,
resulting in a 0 output from the other AND gate. The OR gate will then output a 1,
triggering the indicator to display a green light for the approach with vehicle presence,
allowing it to proceed while the other approach remains red.
• If no vehicles are detected at either approach, both sensor signals will be 0, resulting in
0 outputs from both AND gates and a 0 output from the OR gate. This will trigger the
indicator to display a red light for both approaches, maintaining the stop condition until
vehicles are detected.
RED U4A
0
Key = Space
74LS04D
U2A
X2
YELLOW
0
74LS08D
U5A
Key = Space U3
74LS136N
OR2
GREEN
0 U6A
Key = Space U1A
74LS08D
74LS04D
2.5V
ASSIGNMENT 4
a. Let Switch
B =Switch 2
C = Switch 3
A B C X
0 0 0 0
0 0 1 1
0 1 0 1
0 1 1 0
1 0 0 1
1 0 1 0
1 1 0 0
1 1 1 1
LET A Ꚛ B = X
= CX̅ + C̅X
=CꚚX
=AꚚ B Ꚛ C
A B C
U2
XOR2
Y
XOR2
b.
A B C F
0 0 0 1
1 1 1 0
0 1 1 0
1 0 1 1
0 1 0 0
0 0 1 1
1 0 0 0
1 1 0 0
i. SUM OF MINTERMS
= A̅B̅ + AB̅C
= B̅ (A̅ + AC)
= B̅ (A̅ + C)
= A̅B̅ + B̅C
ASSINGMENT 5
A B C D X
0 0 0 0 1
0 0 0 1 1
0 0 1 0 1
0 0 1 1
0 1 0 0
0 1 0 1 1
0 1 1 0
0 1 1 1 X
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1 X
1 1 0 0
1 1 0 1
1 1 1 0 1
1 1 1 1 1
K-MAP
A B C D X
0 0 0 0 1
0 0 0 1
0 0 1 0
0 0 1 1 1
0 1 0 0 1
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 0 1
1 0 0 1
1 0 1 0
1 0 1 1 1
1 1 0 0 1
1 1 0 1 1
1 1 1 0
1 1 1 1
K-MAP
A B C D X
0 0 0 0 1
0 0 0 1
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 1 1 1
1 0 0 0 1
1 0 0 1 1
1 0 1 0 X
1 0 1 1 X
1 1 0 0 1
1 1 0 1 1
1 1 1 0 X
1 1 1 1 X
K-MAP
X = A + B Ꚛ C + C̅D̅
ASSIGNMENT 6
a. TRUTH TABLE
DEC A B C D X
0 0 0 0 0 1
1 0 0 0 1 1
2 0 0 1 0
3 0 0 1 1 1
4 0 1 0 0
5 0 1 0 1 1
6 0 1 1 0 1
7 0 1 1 1
8 1 0 0 0 1
9 1 0 0 1 1
10 1 0 1 0
11 1 0 1 1 1
12 1 1 0 0 1
13 1 1 0 1 1
14 1 1 1 0
15 1 1 1 1
BOOLEAN SIMPLIFICATION
C D
4:1 X
MUX
A B
b. TRUTH TABLE
DEC A B C D X
0 0 0 0 0 1
1 0 0 0 1
2 0 0 1 0
3 0 0 1 1
4 0 1 0 0
5 0 1 0 1
6 0 1 1 0
7 0 1 1 1 1
8 1 0 0 0 1
9 1 0 0 1 1
10 1 0 1 0 1
11 1 0 1 1 1
12 1 1 0 0
13 1 1 0 1
14 1 1 1 0
15 1 1 1 1 1
BOOLEAN SIMPLIFICATION
= D̅(A̅+A) + AD = A(D̅ + D)
= D̅ +AD =A
= A + D̅
For I2, BC is 10 For I3, BC is 11
So from the truth table; So from the truth table;
I2 =0 I3 = A̅D +AD
Since there is no minterm that = D(A̅ +A)
corresponds to BC = 10 =D
DEC A B C D X
0 0 0 0 0
1 0 0 0 1 1
2 0 0 1 0
3 0 0 1 1
4 0 1 0 0
5 0 1 0 1
6 0 1 1 0
7 0 1 1 1
8 1 0 0 0 1
9 1 0 0 1 1
10 1 0 1 0
11 1 0 1 1
12 1 1 0 0 1
13 1 1 0 1 1
14 1 1 1 0 1
15 1 1 1 1 1
= C̅ + BC = C̅ + BC
= B + C̅ = B + C̅
B C
4:1
MUX X
A D