UNIVERSITI KUALA LUMPUR
MALAYSIAN INSTITUTE OF INFORMATION TECHNOLOGY
JANUARY 2020 SEMESTER
IBB30104 DIGITAL PRINCIPLES
LAB 1
PREPARED BY:
NO.
1
NAME
MUHAMMAD NABIL BIN BAHAROM
STUDENT ID NO.
52211119421
PREPARED FOR:
SIR SAYED AZIZ BIN SAYED HUSSIN
SUBMISSION DATE:
8th MAY 2020
1
HP NO.
0192880848
INDEX
CONTENT
PAGE
3
TITLE
ABSTRACT
3
INTRODUCTION
3
MATERIALS AND METHODS
3
RESULTS
3-11
DISCUSSION
12
CONCLUSION
12
LITERATURE CITED
12
2
TITLE
Lab Report on Boolean Algebra
ABSTRACT
This lab report observed how the basic logic operator works. There are three basic logic
gates and the rest can be constructed by using these three basic logic gates. During the lab,
I had created the circuit of each of the logic gate and then assigning Boolean values to the
voltage that was provided to system. Then write down the truth table of each of the logic
gates. Then compared the result of truth table and the original function of the gate. After the
experiment, it is concluded that NOT Gate which also works as inventor give output opposite
to its input. Similarly, for AND gate to perform its function it required two inputs. The OR
Gate works opposite of AND gate. It required only one input to perform its function.
INTRODUCTION
The aim of this experiment is to introduce the implementation of logic elements within
multisim, such as AND OR and NOT along with the use of a logic converter as a design tool
was also presented as a method of obtaining the truth table for a circuit and to find a
simplified expression for a circuit. The execution and implementation of binary expressions is
also explored and implemented within the simulation software. The experiment introduced
many main concepts of logic circuits and the use of simulation software. It was expected that
logic expressions could be realised using methods presented in the labs.
MATERIALS AND METHODS
Perform lab using Circuit Maker 2000 Simulator.
RESULTS
3
Procedure:
1. Refer to the circuit in Fig.2-1
a) Write the expression for the output of gate A
A=A+B
b) Write the expression for the output of gate B
B=B+C
c) Write the expression for the output of gate C
C = 𝐂̅ + D
d) Write the expression for the output of gate D
D = (A+B) . (B+C)
e) Write the expression for the output of gate E
̅ . (𝐂̅+D)
E=𝐀
f) Write the expression for the output of gate F
̅ . (𝐂̅+D)
F = (A+B) . (B+C) + 𝐀
4
2. Referring to the output of Fig.2-1, is it possible to simplify any part of the equation and if
so which part?
Logic Gate D
D = (A+B) . (B+C)
D = AB + AC + BB + BC
D = AB + AC + B + BC
D = AC + B + AB + BC
D = AC + B (1 + A + C)
D = AC + B (1)
D = B + AC
3. State the full simplified equation for the circuit of Fig.2-1.
̅ . (𝑪
̅ + D)
F = (A+B) . (B+C) + 𝑨
̅𝑪
̅+𝑨
̅D
F = AB + AC + BB + BC + 𝑨
̅𝑪
̅+𝑨
̅D
F = AB + AC + B + BC + 𝑨
̅𝑪
̅+𝑨
̅D
F = AC + B + AB + BC + 𝑨
̅𝑪
̅+𝑨
̅D
F = AC + B (1 + A + C) + 𝑨
̅𝑪
̅+𝑨
̅D
F = AC + B (1) + 𝑨
̅𝑪
̅+𝑨
̅D
F = B + AC + 𝑨
̅𝑪
̅ + AC + 𝑨
̅D + B
F=𝑨
̅𝑪
̅ + CD + B
F=𝑨
4. Can the output of Fig.2-2 be used to implement the simplified logic equation of Fig.2-1?
Yes
5. Compare the circuits of Fig.2-1 and Fig.2-2. How many and what logic gates have been
eliminated from the circuit by simplification using Boolean algebra?
2 logic gates that have been eliminated (Gate A and B which is OR)
5
Truth Table:
A
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
FIGURE 2-1
INPUTS
OUTPUTS
B C D
X
0 0 0
1
0 0 1
1
0 1 0
0
0 1 1
1
1 0 0
1
1 0 1
1
1 1 0
1
1 1 1
1
0 0 0
0
0 0 1
0
0 1 0
1
0 1 1
1
1 0 0
1
1 0 1
1
1 1 0
1
1 1 1
1
A
0
0
0
0
0
0
0
0
1
1
1
1
1
1
1
1
FIGURE 2-2
INPUTS
OUTPUTS
B C D
X
0 0 0
1
0 0 1
1
0 1 0
0
0 1 1
1
1 0 0
1
1 0 1
1
1 1 0
1
1 1 1
1
0 0 0
0
0 0 1
0
0 1 0
1
0 1 1
1
1 0 0
1
1 0 1
1
1 1 0
1
1 1 1
1
Simulation for Figure 2-1:
FIGURE 2-1
INPUTS
OUTPUTS
A B C D
X
0 0 0 0
1
6
FIGURE 2-1
INPUTS
OUTPUTS
A B C D
X
0 0 0 1
1
FIGURE 2-1
INPUTS
OUTPUTS
A B C D
X
0 0 1 0
0
7
FIGURE 2-1
INPUTS
OUTPUTS
A B C D
X
1 0 1 0
1
FIGURE 2-1
INPUTS
OUTPUTS
A B C D
X
1 0 1 1
1
8
Simulation for Figure 2-2:
FIGURE 2-2
INPUTS
OUTPUTS
A B C D
X
0 0 0 0
1
FIGURE 2-2
INPUTS
OUTPUTS
A B C D
X
0 0 0 1
1
9
FIGURE 2-2
INPUTS
OUTPUTS
A B C D
X
0 0 1 0
0
FIGURE 2-2
INPUTS
OUTPUTS
A B C D
X
1 1 0 1
1
10
FIGURE 2-2
INPUTS
OUTPUTS
A B C D
X
1 1 1 0
1
11
DISCUSSION
To analysis the function of the logic gates we construct the truth table of each logic gates.
Every gate has different truth table, which shows that each basic gate works different from
each other. For example, an OR Gate which give output opposite to its input. That is why it is
one of the simplest gates to use from rest of the gates. NOT Gate is also called Inventor.
Next gate is AND Gate, which required two inputs for circuit to perform function. That is
proved by using truth table which shows that the circuit only works when both inputs are 1.
The next gate that was examined in this lab was OR Gate, which works opposite to AND
gate. For OR Gate to function, it just needs one of the inputs. It is proved from truth table
that is constructed from the experiment.
CONCLUSION
In conclusion, each basic gate works in unique way, which is proved during this experiment.
We used the truth table to examine the operation of the basic logic gate. It is proved from
experiment that logic gates work in basis of Boolean Algebra. AND Gate, OR Gate and NOT
Gate are the basic gates. All the combinational logic gates are made of these three basic
gates. Output from one logic gate can be used as input for another logic gate to form
combinational logic gate.
LITERATURE CITED
Thomas L. Floyd, Digital Fundamentals Eleventh Edition, Published by Pearson in 2014
12