Computer Architecture – Lab Experiments
Experiment-1: To study the OR, AND & NOT gates and verify their truth tables.
Circuit that takes the logical decision and the process are called logic gates. Each
gate has one or more input and only one output. OR, AND and NOT are basic gates.
NAND, NOR are known as universal gates.
AND GATE:
The AND gate performs a logical multiplication commonly known as AND function.
The output is high when both the inputs are high. The output is low level when any
one of the inputs is low. Output Y= A.B where A and B are the inputs.
OR GATE:
The OR gate performs a logical addition commonly known as OR function. The
output is high when any one of the inputs is high. The output is low level when both
the inputs are low. Output Y= A+B where A and B are the inputs.
NOT GATE:
The NOT gate is called an inverter. The output is high when the input is low. The
output is low when the input is high. Output Y= NOT(A) where A is the input.
Experiment-2: To study the NOR and NAND gates and verify their truth tables.
Circuit that takes the logical decision and the process are called logic gates. Each
gate has one or more input and only one output. OR, AND and NOT are basic gates.
NAND, NOR are known as universal gates.
NAND GATE:
The NAND gate is a combination of AND-NOT. The output is high when any one of
the input is low or both inputs are low .The output is low level only when both
inputs are high.
NOR GATE:
The NOR gate is a combination of OR-NOT. The output is high when both inputs are
low. The output is low when one or both inputs are high.
Experiment-3: To study the XOR gates and verify their truth table.
X-OR GATE:
The output is high when any one of the inputs is high. The output is low when
both the inputs are low and both the inputs are high.
Experiment-4 : To study the properties of NAND and NOR gates as universal
gates.
Experiment-5: To construct half adder circuit and verify the truth table using
logic gates.
HALF ADDER:
A half adder has two inputs for the two bits to be added and two outputs one
from the sum S and other from the carry C. The Sum is obtained from the X-OR
Gate and the Carry out from the AND gate.
From above truth table, the expressions for carry and sum can be derived using
the sum product terms.
Experiment-6: To construct full adder circuit and verify the truth table using logic
gates.
FULL ADDER:
A full adder is a combinational circuit that forms the arithmetic sum of three inputs
and generates two outputs. A full adder is useful to add three bits at a time but a
half adder cannot do so.
Experiment-7: To construct half subtractor circuit and verify the truth table using
logic gates.
HALF SUBTRACTOR:
The half subtractor is constructed using X-OR, NOT and AND gate. The half
subtractor has two input and two outputs. The outputs are difference and borrow.
The difference can be applied using X-OR Gate, borrow output can be implemented
using an AND Gate and an inverter.
Experiment-8: To construct full subtractor circuit and verify the truth table using
logic gates.
FULL SUBTRACTOR:
The full subtractor is a combination of X-OR, AND, OR, NOT Gates. In a full
subtractor the logic circuit should have three inputs and two outputs. A full
subtractor has three inputs while half subtractor has only two. This additional carry
input facility makes them to subtract any two numbers. Two half subtractors can
be connected together to give a full subtractor.
Experiment-9: To study the verification of De-morgan’s theorem.
De-Morgan's Laws Boolean algebra has postulates and identities. We can often use these laws
to reduce expressions or put expressions in to a more desirable form. One of these laws is the
De- Morgan's law. De-Morgan's law has two conditions, or conversely, there are two laws called
De-Morgan's Laws. First
Condition or First law: The compliment of the product of two variables is equal to the sum of the
compliment of each variable. Thus according to De-Morgan's laws or De-Morgan's theorem if A
and B are the two variables or Boolean numbers. Then accordingly
Second Condition or Second law:
The compliment of the sum of two variables is equal to the product of the compliment of each variable.
Thus according to De Morgan’s theorem if A and B are the two variables then.
Experiment-9: To Verify the Boolean's expressions.
Boolean expressions are
1. Complementation Law: -
The term complement simply means to change 0s to 1s and 1s to 0s.
This is given by
Double complement of A = A" = A
2. Commutative Law: -
Commutative Laws allow change in position of AND or OR
variables
Law l:- A+B = B+A
Law 2:- A.B = B.A
[Link] Law: -
The associative Law allows grouping of variable
Law l:- ( A + B ) + C = A + ( B + C )
Law 2:- ( A . B ) . C = A . ( B . C )
4. Distributive Law: -
The distributive Law allow the factoring and multiplying out of expressions
Law l : A. ( B + C ) = A B + A C
Law 2 : A + B C = ( A + B ) ( A + C )