Scribd
Upload
53 views

Experiment 1 Introduction To Lab Equipment Unitrain and Implementation of Basic Functions

The document is a lab report that investigates basic digital logic gates using a unitrain interface. It includes: 1) Exercises to understand the functionality of the NOT, AND and OR gates by constructing circuits with the interface and observing the output based on different input combinations. 2) Descriptions of the logical operations performed by each gate and the truth tables associated with them. 3) Questions about the switch analogy used to demonstrate gate operations and the effect of double negation.

Uploaded by

syed waheed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
53 views

Experiment 1 Introduction To Lab Equipment Unitrain and Implementation of Basic Functions

The document is a lab report that investigates basic digital logic gates using a unitrain interface. It includes: 1) Exercises to understand the functionality of the NOT, AND and OR gates by constructing circuits with the interface and observing the output based on different input combinations. 2) Descriptions of the logical operations performed by each gate and the truth tables associated with them. 3) Questions about the switch analogy used to demonstrate gate operations and the effect of double negation.

Uploaded by

syed waheed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 8

Name SYED WAHEED AHAMED

Reg. # 2020-EE-411
Marks
Experiment 1

Introduction to Lab Equipment Unitrain and Implementation of Basic


Functions

Objective:

• Installation of unitrain interface


• Investigation of the fundamental gates used in digital technology

Theory:

Binary logic deals with variables that take on two discrete values. The two values the variables may be called by
different names (true and false, yes and no, etc.), but for our purpose, it is convenient to think in terms of bits
and assign the values 1 and 0. The binary logic introduced in this section is equivalent to an algebra called
Boolean algebra.
Binary logic consists of binary variables and a set of logical operation. The variables are designated by letters of
the alphabet, such as A, B, C, x, y or i etc., with each variable having two distinct possible values: 1 and 0. There
are three basic logical operation: AND, OR and NOT.

NOT (Negation)

The two symbols shown are used to represent the NOT function. According to
DIN, the second variation Q=¬A is preferred. The first variation is also
Q= Á
permissible. It continues to be used for reasons of clarity.

Exercise 1:

Fig.1: Experiment set-up - Negation


Notes on the VI:
The UniTr@in’s outputs are designated Q0..15 and its inputs I0..15. UniTr@in’s outputs go to the inputs of the experiment card and the
outputs of the experiment card go to UniTr@in’s inputs. Change the value of Q 0 as suggested and note the response at the output I 0 of
the circuit.
[Help available under the menu option: Help → Help topics → Virtual instruments → Standard → Digital → Inputs/outputs]

A Q=A

0 1

1 0

Exercise 2

Fig.2: Experiment set-up - Double negation

A Z=A’ Q=(A’)’
0 1 0
1 0 1

Complete the equations:


Z= Á , Q= Ź= Á= A

AND

The Boolean AND operation can be written in the forms Q=A^B or Q=A.B. It
should be noted that although the Boolean AND function bears certain
similarities to algebraic multiplication, there are also distinct differences.

Exercise 3:
Fig.3: Experiment set-up - AND

B A Q
0 0 0
0 1 0
1 0 0
1 1 1

AND operation demonstrated by switches and a lamp

Exercise 4:

Construct the following experiments and note down the results. Describe in a few words the rules that you
discover.

a) ANDing with "0"

Result: A·0= 0

How do you interpret this result?

The truth table shows AND Gate output that any input LOW (0) Resultant output of AND Gate will be LOW
(0) & Output HIGH (1) only when All inputs High (1). When A=1 Then 1 . 0 = 0, When A=0 Then 0 . 0 = 0
b) ANDing with "1"

Result: A·1= A

How do you interpret this result?


The truth table shows AND Gate output that any input LOW (0) Resultant output of AND Gate will be LOW
(0) & Output HIGH (1) only when All inputs High (1). When A=1 Then 1 . 1 = 1, When A=0 Then 1 . 0 = 0
c) ANDing A·A (Tautology)

Result: A·A= A

How do you interpret the result?


The truth table shows AND Gate output that any input LOW (0) Resultant output of AND Gate will be LOW
(0) & Output HIGH (1) only when All inputs High (1). When A=1 Then 1 . 1 = 1, When A=0 Then 0 . 0 = 0
d) ANDing A·¬A (Negation law)

Result: A · ¬A = 0
How do you interpret the result?
The truth table shows AND Gate output that any input LOW (0) Resultant output of AND Gate will be LOW
(0) & Output HIGH (1) only when All inputs High (1). When A=1 & ¬A= 0, Then 1. 0 = 0, When A=0 & ¬A=
1, Then 0. 1 = 0
OR
The Boolean OR operation is usually written in the forms Q=A+B or Q=A∨B. It
should be noted that although the Boolean OR function bears certain similarities to
algebraic addition, there are also distinct differences.

Exercise 5:

Fig.5 : Experiment set-up - OR

B A Q
0 0 0
0 1 1
1 0 1
1 1 1

OR operation demonstrated by switches and a lamp

Exercise 6:

Construct the following experiments and note down the results. Describe in a few words the rules that you
discover.
a) ORing with "0"

Result: A∨0= A

How do you interpret the results?


The truth table shows OR Gate output that any input HIGH (1) Resultant output of OR Gate will be HIGH (1) &
Output LOW (0) only when All inputs LOW (0). When A=1 Then 1 ∨ 0 = 1, When A=0 Then 0 ∨ 0 = 0

b) ORing with "1"

Result: 1∨A= 1

How do you interpret the result?


The truth table shows OR Gate output that any input HIGH (1) Resultant output of OR Gate will be HIGH (1) &
Output LOW (0) only when All inputs LOW (0). When A=1 Then 1 ∨ 1 = 1, When A=0 Then 1 ∨ 0 = 1
c) ORing A∨A (Tautology)

Result: A∨A= A
How do you interpret the result?
The truth table shows OR Gate output that any input HIGH (1) Resultant output of OR Gate will be HIGH (1) &
Output LOW (0) only when All inputs LOW (0). When A=1 Then 1 ∨ 1 = 1, When A=0 Then 0 ∨ 0 = 0
d) ORing A∨¬A (Negation law)

Result: A ∨ ¬A = 1

How do you interpret the result?


The truth table shows OR Gate output that any input HIGH (1) Resultant output of OR Gate will be HIGH (1) &
Output LOW (0) only when All inputs LOW (0). When A=1, ¬A = 0 Then 1 ∨ 0 = 1, When A=0, ¬A = 1 Then
0∨1=1
Lab Review:

1. What is the function of a NOT gate?


It has only one input and one output. The function of NOT Gate is opposite logical level of its input.
It is also called the invertor Gate that means if its input is High (1) then its output will be Low (0)
and vice versa. Its used with logical gates for change its logical level. It is constructed with BJT
and NMOS Transistors.
2. Describe the functionality of the OR gate:
OR Gate is digital logical electronics circuit which has two or more inputs and only one
output. The logical function of OR Gate is Addition of its inputs. When any input High (1)
the resultant output will be High (1) the and output will be Low (0) when of its all inputs
Low (0).The Boolean Expression of OR Gate is A+B = C (inputs A & B, Output C).
3. Describe the functionality of the AND gate:
AND Gate is digital logical electronics circuit which has two or more inputs and only one
output. The logical function of AND Gate is multiply of its inputs. When any input Low (0)
the resultant output will be Low (0) the and output will be High (1) when of its all inputs
High (1).The Boolean Expression of AND Gate is A.B = C (inputs A & B, Output C).

4. Compare the switch analogy to the actual AND gate:


The switch analogy shows the two series switch of A and B for AND Gate representation.
Switch Close Logic =1 & Switch Open Logic = 0
In case switch i) A=0, B = 0, ii) A=0, B=1, iii) A=1, B=0 then lamp will not show its output.
The only case A=1, B= 1 lamp will show its output that Switch analogy show the AND gate
logical function. The AND Gate is also construct of electronics switches like Transistors and
MOSFET.

5. Compare the switch analogy to the actual OR gate:


The switch analogy shows the two parallel switch of A and B for OR Gate representation.
Switch Close Logic =1 & Switch Open Logic = 0
In case switch i) A=1, B = 0, ii) A=0, B=1, iii) A=1, B=1 then lamp will show its output.
The only case A=0, B= 0 lamp will not show its output that Switch analogy show the OR gate
logical function. The OR Gate is also construct of electronics switches like Transistors and
MOSFET.

6. What happens when two negations are performed:


The NOT Gate basic function is invert of its input. If A is the Input and output will be ¬A.
When Two NOT gate combined in such a way the output of first NOT Gate is the input of second NOT
Gate. The result should be the same as its input.
In first negations If Input A=1 then ¬A = 0
In Second negations If Input ¬A = 0 then ¬ ¬A= 1
The result is same as its input.

You might also like