Indian Institute of Information Technology Vadodara,

International Campus Diu

Practical Workbook

Name: Sanskar Koserwal

Roll Number: 202211077

Branch: Computer Science and Engineering

Batch: 2022

Subject: EC261

Session: 2023-24

1
 Certificate

This is to certify that Mr. Sanskar Koserwal of B. Tech of semester

III
Enrolment Number 202211077 Branch Computer Science and
Engineering (CSE) has been found satisfactory in the continuous
internal evaluation of laboratory, practical and term work in the
subject EC261 for the academic year 2023-2024.

Date: Sign of Faculty

2
 List of Experiments

S. No. Name of experiment Date of experiment Date of submission Faculty’s sign

1. Perform the following. Oct. 13, 2023 Oct. 18, 2023
• 2-bit adder and subtractor
using basic gate or
universal gate
• Binary to gray code
converter
• Binary to BCD converter

3
 Date: Oct. 18, 2023
Aim:
Perform the following:

• 2-bit adder and subtractor using basic gate or universal gate

• Binary to gray code converter

• (c) Binary to BCD converter.

Components Required:
Breadboard, IC, LED, wires, voltage source(+5V), Logisim software

Theory:

1) Full Adder
The Full Adder is an adding circuit capable of processing three inputs, namely A, B,
and an input carry denoted as C-IN, producing two outputs: C-OUT (output carry) and S
(SUM). It's engineered to handle eight inputs simultaneously, enabling the creation of a
bytewide adder. Additionally, it can cascade the carry bit from one adder to the next.

Truth Table

4
Characteristic Equations of Full Adder: -
The characteristic equations of the full adder, i.e equations of sum (S) and carry
output (Cout) are obtained according to the
Sum, S=A B C=A′B′+A′BC′+AB′C′+ABC
Sum, S=A B C=A′B′C+A′BC′+AB′C′+ABC Carry, Cout =AB+AC+BC

2.) Full Subtractor

A full subtractor is a combinational circuit designed for three-bit subtraction. It
processes three inputs: A (minuend), B (subtrahend), and Bin (borrow-in), generating two
outputs: D (difference) and Bout (borrow out).

Truth Table

5
Characteristic Equations of Full
Subtractor:-
The characteristic equations of the full subtractor, i.e., equations of the difference (d) and borrow
output (b) are obtained by following the rules of binary subtraction.

Difference, d = A⊕B⊕bin d =
A′B′bin+AB′b′in+A′Bb′in+Abbin
Borrow, b = A′B+(A⊕B) ′bin

Binary to Grey Code Convertor Formula:-

𝐺𝑛−1 = 𝐵𝑛⊕𝐵𝑛−1

Grey Code to Binary Convertor Formula: -

𝐵𝑛−1 = 𝐵𝑛⊕𝐺𝑛−1

Note: - In both the cases Most significant bit (MSB) will remain same.

3) 2 Bit Adder Circuit: -

A two-bit adder is a circuit the adds together two, 2-bit numbers. The first number,
A, can be representing using bits a1 and a0. The second number, B, is similarly
represented. The output consists of the sum of A and B, represented as two bits
(s1 and s0) and one. carry bit (c).

6
Truth Table

7
Observation: -

8
Conclusion:
We have verified the accuracy of the truth tables for a full adder and subtractor, ensuring
their correctness. Additionally, we validated the truth tables for a BCD to grey code
converter and its reverse operation. Moreover, we have designed and tested a functional
two-bit adder circuit.