Download Anna University B-Tech CSE 3rd Sem CS8382 Digital Systems DS Lab Manual Question Paper

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL
FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________

--- Content provided by FirstRanker.com ---

Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on

--- Content provided by FirstRanker.com ---

heart and soul



DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to

--- Content provided by FirstRanker.com ---

professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and

--- Content provided by FirstRanker.com ---

training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.

--- Content provided by FirstRanker.com ---

? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence

--- Content provided by FirstRanker.com ---

To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which

--- Content provided by FirstRanker.com ---

enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a

--- Content provided by FirstRanker.com ---

team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with

--- Content provided by FirstRanker.com ---

commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice



1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and

--- Content provided by FirstRanker.com ---

enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s

--- Content provided by FirstRanker.com ---

needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the

--- Content provided by FirstRanker.com ---

industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism

--- Content provided by FirstRanker.com ---

To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics

--- Content provided by FirstRanker.com ---

To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.

--- Content provided by FirstRanker.com ---

f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also

--- Content provided by FirstRanker.com ---

will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY
FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________

--- Content provided by FirstRanker.com ---

Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on

--- Content provided by FirstRanker.com ---

heart and soul



DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to

--- Content provided by FirstRanker.com ---

professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals

--- Content provided by FirstRanker.com ---

To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new

--- Content provided by FirstRanker.com ---

technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall

--- Content provided by FirstRanker.com ---

development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good

--- Content provided by FirstRanker.com ---

professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.

--- Content provided by FirstRanker.com ---

c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.

--- Content provided by FirstRanker.com ---

g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.

--- Content provided by FirstRanker.com ---

k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:

--- Content provided by FirstRanker.com ---

The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits

--- Content provided by FirstRanker.com ---

? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.

--- Content provided by FirstRanker.com ---

3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers

--- Content provided by FirstRanker.com ---

4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.

--- Content provided by FirstRanker.com ---

? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY
FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different

--- Content provided by FirstRanker.com ---

levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative

--- Content provided by FirstRanker.com ---

Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental

--- Content provided by FirstRanker.com ---

concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.

--- Content provided by FirstRanker.com ---

e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.

--- Content provided by FirstRanker.com ---

i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:
? Understand the various logic gates.

--- Content provided by FirstRanker.com ---

? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:

--- Content provided by FirstRanker.com ---

1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor

--- Content provided by FirstRanker.com ---

b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers

--- Content provided by FirstRanker.com ---

b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:

--- Content provided by FirstRanker.com ---

? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates

--- Content provided by FirstRanker.com ---

2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.

--- Content provided by FirstRanker.com ---

Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and

--- Content provided by FirstRanker.com ---

MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.

--- Content provided by FirstRanker.com ---

9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.

--- Content provided by FirstRanker.com ---

Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________

--- Content provided by FirstRanker.com ---

Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics

--- Content provided by FirstRanker.com ---

Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.

--- Content provided by FirstRanker.com ---

? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of

--- Content provided by FirstRanker.com ---

engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.

--- Content provided by FirstRanker.com ---

d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.

--- Content provided by FirstRanker.com ---

h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:

--- Content provided by FirstRanker.com ---

? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL

--- Content provided by FirstRanker.com ---

List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:

--- Content provided by FirstRanker.com ---

a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:

--- Content provided by FirstRanker.com ---

a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.

--- Content provided by FirstRanker.com ---

? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.

--- Content provided by FirstRanker.com ---

Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.

--- Content provided by FirstRanker.com ---

Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI

--- Content provided by FirstRanker.com ---

Devices

7.
Design and Implementation of Magnitude Comparator.
8.

--- Content provided by FirstRanker.com ---

Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.

--- Content provided by FirstRanker.com ---

11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.

--- Content provided by FirstRanker.com ---

Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate

--- Content provided by FirstRanker.com ---

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.
OR gate
The OR gate performs a logical addition commonly known as OR function. The output is

--- Content provided by FirstRanker.com ---

high when any one of the inputs is high. The output is low level when both the inputs are low.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate

--- Content provided by FirstRanker.com ---

The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.

--- Content provided by FirstRanker.com ---

EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.
FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and

--- Content provided by FirstRanker.com ---

training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.

--- Content provided by FirstRanker.com ---

? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence

--- Content provided by FirstRanker.com ---

To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which

--- Content provided by FirstRanker.com ---

enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a

--- Content provided by FirstRanker.com ---

team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with

--- Content provided by FirstRanker.com ---

commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.

--- Content provided by FirstRanker.com ---

b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to

--- Content provided by FirstRanker.com ---

analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.

--- Content provided by FirstRanker.com ---

j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.

--- Content provided by FirstRanker.com ---

? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary

--- Content provided by FirstRanker.com ---

functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator

--- Content provided by FirstRanker.com ---

d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.

--- Content provided by FirstRanker.com ---

6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.

--- Content provided by FirstRanker.com ---

? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary

--- Content provided by FirstRanker.com ---

Functions, Code Converters

3.
Implementation of half adder and full adder
4.

--- Content provided by FirstRanker.com ---

Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.

--- Content provided by FirstRanker.com ---

Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.

--- Content provided by FirstRanker.com ---

10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

8. Connecting wires As required

Theory:
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 and X-OR are known as

--- Content provided by FirstRanker.com ---

universal gates. Basic gates form these 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.

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. The NOT gate is

--- Content provided by FirstRanker.com ---

called an inverter. The output is high when the input is low. The output is low when the input is high.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate

--- Content provided by FirstRanker.com ---

The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive

--- Content provided by FirstRanker.com ---

OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.



8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________

--- Content provided by FirstRanker.com ---

Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics

--- Content provided by FirstRanker.com ---

Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.

--- Content provided by FirstRanker.com ---

? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of

--- Content provided by FirstRanker.com ---

engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.

--- Content provided by FirstRanker.com ---

d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.

--- Content provided by FirstRanker.com ---

h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:

--- Content provided by FirstRanker.com ---

? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL

--- Content provided by FirstRanker.com ---

List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:

--- Content provided by FirstRanker.com ---

a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:

--- Content provided by FirstRanker.com ---

a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.

--- Content provided by FirstRanker.com ---

? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.

--- Content provided by FirstRanker.com ---

Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.

--- Content provided by FirstRanker.com ---

Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI

--- Content provided by FirstRanker.com ---

Devices

7.
Design and Implementation of Magnitude Comparator.
8.

--- Content provided by FirstRanker.com ---

Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.

--- Content provided by FirstRanker.com ---

11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.

--- Content provided by FirstRanker.com ---

Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate

--- Content provided by FirstRanker.com ---

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.
OR gate
The OR gate performs a logical addition commonly known as OR function. The output is

--- Content provided by FirstRanker.com ---

high when any one of the inputs is high. The output is low level when both the inputs are low.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate

--- Content provided by FirstRanker.com ---

The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.

--- Content provided by FirstRanker.com ---

EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________

--- Content provided by FirstRanker.com ---

Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics

--- Content provided by FirstRanker.com ---

Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.

--- Content provided by FirstRanker.com ---

? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of

--- Content provided by FirstRanker.com ---

engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.

--- Content provided by FirstRanker.com ---

d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.

--- Content provided by FirstRanker.com ---

h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:

--- Content provided by FirstRanker.com ---

? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL

--- Content provided by FirstRanker.com ---

List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:

--- Content provided by FirstRanker.com ---

a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:

--- Content provided by FirstRanker.com ---

a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.

--- Content provided by FirstRanker.com ---

? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.

--- Content provided by FirstRanker.com ---

Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.

--- Content provided by FirstRanker.com ---

Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI

--- Content provided by FirstRanker.com ---

Devices

7.
Design and Implementation of Magnitude Comparator.
8.

--- Content provided by FirstRanker.com ---

Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.

--- Content provided by FirstRanker.com ---

11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.

--- Content provided by FirstRanker.com ---

Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate

--- Content provided by FirstRanker.com ---

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.
OR gate
The OR gate performs a logical addition commonly known as OR function. The output is

--- Content provided by FirstRanker.com ---

high when any one of the inputs is high. The output is low level when both the inputs are low.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate

--- Content provided by FirstRanker.com ---

The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.

--- Content provided by FirstRanker.com ---

EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and

--- Content provided by FirstRanker.com ---

training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.

--- Content provided by FirstRanker.com ---

? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence

--- Content provided by FirstRanker.com ---

To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which

--- Content provided by FirstRanker.com ---

enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a

--- Content provided by FirstRanker.com ---

team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with

--- Content provided by FirstRanker.com ---

commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.

--- Content provided by FirstRanker.com ---

b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to

--- Content provided by FirstRanker.com ---

analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.

--- Content provided by FirstRanker.com ---

j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.

--- Content provided by FirstRanker.com ---

? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary

--- Content provided by FirstRanker.com ---

functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator

--- Content provided by FirstRanker.com ---

d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.

--- Content provided by FirstRanker.com ---

6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.

--- Content provided by FirstRanker.com ---

? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary

--- Content provided by FirstRanker.com ---

Functions, Code Converters

3.
Implementation of half adder and full adder
4.

--- Content provided by FirstRanker.com ---

Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.

--- Content provided by FirstRanker.com ---

Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.

--- Content provided by FirstRanker.com ---

10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

8. Connecting wires As required

Theory:
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 and X-OR are known as

--- Content provided by FirstRanker.com ---

universal gates. Basic gates form these 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.

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. The NOT gate is

--- Content provided by FirstRanker.com ---

called an inverter. The output is high when the input is low. The output is low when the input is high.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate

--- Content provided by FirstRanker.com ---

The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive

--- Content provided by FirstRanker.com ---

OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.



8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.

--- Content provided by FirstRanker.com ---

2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.

--- Content provided by FirstRanker.com ---

7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.

--- Content provided by FirstRanker.com ---

12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.

--- Content provided by FirstRanker.com ---

Viva ? Voce

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________

--- Content provided by FirstRanker.com ---

Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics

--- Content provided by FirstRanker.com ---

Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.

--- Content provided by FirstRanker.com ---

? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of

--- Content provided by FirstRanker.com ---

engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.

--- Content provided by FirstRanker.com ---

d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.

--- Content provided by FirstRanker.com ---

h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:

--- Content provided by FirstRanker.com ---

? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL

--- Content provided by FirstRanker.com ---

List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:

--- Content provided by FirstRanker.com ---

a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:

--- Content provided by FirstRanker.com ---

a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.

--- Content provided by FirstRanker.com ---

? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.

--- Content provided by FirstRanker.com ---

Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.

--- Content provided by FirstRanker.com ---

Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI

--- Content provided by FirstRanker.com ---

Devices

7.
Design and Implementation of Magnitude Comparator.
8.

--- Content provided by FirstRanker.com ---

Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.

--- Content provided by FirstRanker.com ---

11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.

--- Content provided by FirstRanker.com ---

Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate

--- Content provided by FirstRanker.com ---

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.
OR gate
The OR gate performs a logical addition commonly known as OR function. The output is

--- Content provided by FirstRanker.com ---

high when any one of the inputs is high. The output is low level when both the inputs are low.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate

--- Content provided by FirstRanker.com ---

The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.

--- Content provided by FirstRanker.com ---

EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?

--- Content provided by FirstRanker.com ---

4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.

--- Content provided by FirstRanker.com ---

9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?

--- Content provided by FirstRanker.com ---

14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C

--- Content provided by FirstRanker.com ---

2. A.(B.C) = (A.B).C

3. Distributive Law

The binary operator OR, AND is said to be distributive if,

--- Content provided by FirstRanker.com ---

1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________

--- Content provided by FirstRanker.com ---

Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on

--- Content provided by FirstRanker.com ---

heart and soul



DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to

--- Content provided by FirstRanker.com ---

professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals

--- Content provided by FirstRanker.com ---

To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new

--- Content provided by FirstRanker.com ---

technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall

--- Content provided by FirstRanker.com ---

development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good

--- Content provided by FirstRanker.com ---

professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.

--- Content provided by FirstRanker.com ---

c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.

--- Content provided by FirstRanker.com ---

g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.

--- Content provided by FirstRanker.com ---

k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:

--- Content provided by FirstRanker.com ---

The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits

--- Content provided by FirstRanker.com ---

? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.

--- Content provided by FirstRanker.com ---

3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers

--- Content provided by FirstRanker.com ---

4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.

--- Content provided by FirstRanker.com ---

? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor

--- Content provided by FirstRanker.com ---

5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.

--- Content provided by FirstRanker.com ---

Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.
Design and Implementation of Magnitude Comparator.

--- Content provided by FirstRanker.com ---

8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.

--- Content provided by FirstRanker.com ---

Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.

--- Content provided by FirstRanker.com ---

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.
OR gate

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.

--- Content provided by FirstRanker.com ---

NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The

--- Content provided by FirstRanker.com ---

output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.

--- Content provided by FirstRanker.com ---

3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.

--- Content provided by FirstRanker.com ---

8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?

--- Content provided by FirstRanker.com ---

13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A

--- Content provided by FirstRanker.com ---

2. A.B=B.A

2. Associative Law

The binary operator OR, AND is said to be associative if,

--- Content provided by FirstRanker.com ---

1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.

--- Content provided by FirstRanker.com ---

A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________

--- Content provided by FirstRanker.com ---

Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics

--- Content provided by FirstRanker.com ---

Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.

--- Content provided by FirstRanker.com ---

? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of

--- Content provided by FirstRanker.com ---

engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.

--- Content provided by FirstRanker.com ---

d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.

--- Content provided by FirstRanker.com ---

h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:

--- Content provided by FirstRanker.com ---

? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL

--- Content provided by FirstRanker.com ---

List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:

--- Content provided by FirstRanker.com ---

a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:

--- Content provided by FirstRanker.com ---

a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.

--- Content provided by FirstRanker.com ---

? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.

--- Content provided by FirstRanker.com ---

Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.

--- Content provided by FirstRanker.com ---

Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI

--- Content provided by FirstRanker.com ---

Devices

7.
Design and Implementation of Magnitude Comparator.
8.

--- Content provided by FirstRanker.com ---

Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.

--- Content provided by FirstRanker.com ---

11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.

--- Content provided by FirstRanker.com ---

Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate

--- Content provided by FirstRanker.com ---

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.
OR gate
The OR gate performs a logical addition commonly known as OR function. The output is

--- Content provided by FirstRanker.com ---

high when any one of the inputs is high. The output is low level when both the inputs are low.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate

--- Content provided by FirstRanker.com ---

The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.

--- Content provided by FirstRanker.com ---

EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?

--- Content provided by FirstRanker.com ---

4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.

--- Content provided by FirstRanker.com ---

9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?

--- Content provided by FirstRanker.com ---

14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C

--- Content provided by FirstRanker.com ---

2. A.(B.C) = (A.B).C

3. Distributive Law

The binary operator OR, AND is said to be distributive if,

--- Content provided by FirstRanker.com ---

1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B

--- Content provided by FirstRanker.com ---

2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B


Design

--- Content provided by FirstRanker.com ---

1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc

--- Content provided by FirstRanker.com ---

.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.



1. What is Demorgan?s law?

--- Content provided by FirstRanker.com ---

2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________

--- Content provided by FirstRanker.com ---

Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics

--- Content provided by FirstRanker.com ---

Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.

--- Content provided by FirstRanker.com ---

? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of

--- Content provided by FirstRanker.com ---

engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.

--- Content provided by FirstRanker.com ---

d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.

--- Content provided by FirstRanker.com ---

h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:

--- Content provided by FirstRanker.com ---

? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL

--- Content provided by FirstRanker.com ---

List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:

--- Content provided by FirstRanker.com ---

a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:

--- Content provided by FirstRanker.com ---

a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.

--- Content provided by FirstRanker.com ---

? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.

--- Content provided by FirstRanker.com ---

Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.

--- Content provided by FirstRanker.com ---

Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI

--- Content provided by FirstRanker.com ---

Devices

7.
Design and Implementation of Magnitude Comparator.
8.

--- Content provided by FirstRanker.com ---

Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.

--- Content provided by FirstRanker.com ---

11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.

--- Content provided by FirstRanker.com ---

Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate

--- Content provided by FirstRanker.com ---

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.
OR gate
The OR gate performs a logical addition commonly known as OR function. The output is

--- Content provided by FirstRanker.com ---

high when any one of the inputs is high. The output is low level when both the inputs are low.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate

--- Content provided by FirstRanker.com ---

The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.

--- Content provided by FirstRanker.com ---

EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?

--- Content provided by FirstRanker.com ---

4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.

--- Content provided by FirstRanker.com ---

9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?

--- Content provided by FirstRanker.com ---

14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C

--- Content provided by FirstRanker.com ---

2. A.(B.C) = (A.B).C

3. Distributive Law

The binary operator OR, AND is said to be distributive if,

--- Content provided by FirstRanker.com ---

1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B

--- Content provided by FirstRanker.com ---

2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B


Design

--- Content provided by FirstRanker.com ---

1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc

--- Content provided by FirstRanker.com ---

.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.



1. What is Demorgan?s law?

--- Content provided by FirstRanker.com ---

2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is

--- Content provided by FirstRanker.com ---

performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice



1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and

--- Content provided by FirstRanker.com ---

enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s

--- Content provided by FirstRanker.com ---

needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the

--- Content provided by FirstRanker.com ---

industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism

--- Content provided by FirstRanker.com ---

To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics

--- Content provided by FirstRanker.com ---

To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.

--- Content provided by FirstRanker.com ---

f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also

--- Content provided by FirstRanker.com ---

will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.

--- Content provided by FirstRanker.com ---

? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.

--- Content provided by FirstRanker.com ---

2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker

--- Content provided by FirstRanker.com ---

c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters

--- Content provided by FirstRanker.com ---

5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.

--- Content provided by FirstRanker.com ---

? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.

--- Content provided by FirstRanker.com ---

Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.
Implementation of half adder and full adder

--- Content provided by FirstRanker.com ---

4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.

--- Content provided by FirstRanker.com ---

Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog

--- Content provided by FirstRanker.com ---

HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:
Circuit that takes the logical decision and the process are called logic gates. Each gate has one or

--- Content provided by FirstRanker.com ---

more input and only one output. OR, AND and NOT are basic gates. NAND, NOR and X-OR are known as
universal gates. Basic gates form these 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

--- Content provided by FirstRanker.com ---

low.
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.
NOT gate

--- Content provided by FirstRanker.com ---

A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.

--- Content provided by FirstRanker.com ---

NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is

--- Content provided by FirstRanker.com ---

similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

1. Connections are given as per the circuit diagram.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

At the completion of an experiment student will able to verify the truth

--- Content provided by FirstRanker.com ---

table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?

--- Content provided by FirstRanker.com ---

6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.

--- Content provided by FirstRanker.com ---

11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?

--- Content provided by FirstRanker.com ---

16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:

--- Content provided by FirstRanker.com ---

1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.

--- Content provided by FirstRanker.com ---

4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?

--- Content provided by FirstRanker.com ---

4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.

--- Content provided by FirstRanker.com ---

Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,

--- Content provided by FirstRanker.com ---

S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 1
8. 1 1 1 1 1


Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice



1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and

--- Content provided by FirstRanker.com ---

enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s

--- Content provided by FirstRanker.com ---

needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the

--- Content provided by FirstRanker.com ---

industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism

--- Content provided by FirstRanker.com ---

To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics

--- Content provided by FirstRanker.com ---

To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.

--- Content provided by FirstRanker.com ---

f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also

--- Content provided by FirstRanker.com ---

will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.

--- Content provided by FirstRanker.com ---

? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.

--- Content provided by FirstRanker.com ---

2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker

--- Content provided by FirstRanker.com ---

c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters

--- Content provided by FirstRanker.com ---

5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.

--- Content provided by FirstRanker.com ---

? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.

--- Content provided by FirstRanker.com ---

Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.
Implementation of half adder and full adder

--- Content provided by FirstRanker.com ---

4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.

--- Content provided by FirstRanker.com ---

Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog

--- Content provided by FirstRanker.com ---

HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:
Circuit that takes the logical decision and the process are called logic gates. Each gate has one or

--- Content provided by FirstRanker.com ---

more input and only one output. OR, AND and NOT are basic gates. NAND, NOR and X-OR are known as
universal gates. Basic gates form these 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

--- Content provided by FirstRanker.com ---

low.
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.
NOT gate

--- Content provided by FirstRanker.com ---

A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.

--- Content provided by FirstRanker.com ---

NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is

--- Content provided by FirstRanker.com ---

similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

1. Connections are given as per the circuit diagram.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

At the completion of an experiment student will able to verify the truth

--- Content provided by FirstRanker.com ---

table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?

--- Content provided by FirstRanker.com ---

6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.

--- Content provided by FirstRanker.com ---

11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?

--- Content provided by FirstRanker.com ---

16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:

--- Content provided by FirstRanker.com ---

1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.

--- Content provided by FirstRanker.com ---

4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?

--- Content provided by FirstRanker.com ---

4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.

--- Content provided by FirstRanker.com ---

Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,

--- Content provided by FirstRanker.com ---

S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 1
8. 1 1 1 1 1


Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:
FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________

--- Content provided by FirstRanker.com ---

Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on

--- Content provided by FirstRanker.com ---

heart and soul



DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to

--- Content provided by FirstRanker.com ---

professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals

--- Content provided by FirstRanker.com ---

To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new

--- Content provided by FirstRanker.com ---

technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall

--- Content provided by FirstRanker.com ---

development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good

--- Content provided by FirstRanker.com ---

professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.

--- Content provided by FirstRanker.com ---

c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.

--- Content provided by FirstRanker.com ---

g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.

--- Content provided by FirstRanker.com ---

k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:

--- Content provided by FirstRanker.com ---

The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits

--- Content provided by FirstRanker.com ---

? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.

--- Content provided by FirstRanker.com ---

3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers

--- Content provided by FirstRanker.com ---

4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.

--- Content provided by FirstRanker.com ---

? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor

--- Content provided by FirstRanker.com ---

5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.

--- Content provided by FirstRanker.com ---

Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.
Design and Implementation of Magnitude Comparator.

--- Content provided by FirstRanker.com ---

8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.

--- Content provided by FirstRanker.com ---

Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.

--- Content provided by FirstRanker.com ---

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.
OR gate

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.

--- Content provided by FirstRanker.com ---

NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The

--- Content provided by FirstRanker.com ---

output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.

--- Content provided by FirstRanker.com ---

3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.

--- Content provided by FirstRanker.com ---

8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?

--- Content provided by FirstRanker.com ---

13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A

--- Content provided by FirstRanker.com ---

2. A.B=B.A

2. Associative Law

The binary operator OR, AND is said to be associative if,

--- Content provided by FirstRanker.com ---

1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.

--- Content provided by FirstRanker.com ---

A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law

--- Content provided by FirstRanker.com ---

A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V

--- Content provided by FirstRanker.com ---

cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

S. No. Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required


Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four

--- Content provided by FirstRanker.com ---

possible elementary operations, namely,

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables

--- Content provided by FirstRanker.com ---

designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented

--- Content provided by FirstRanker.com ---

with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC



16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:



18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 V supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice



1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and

--- Content provided by FirstRanker.com ---

enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s

--- Content provided by FirstRanker.com ---

needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the

--- Content provided by FirstRanker.com ---

industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism

--- Content provided by FirstRanker.com ---

To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics

--- Content provided by FirstRanker.com ---

To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.

--- Content provided by FirstRanker.com ---

f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also

--- Content provided by FirstRanker.com ---

will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.

--- Content provided by FirstRanker.com ---

? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.

--- Content provided by FirstRanker.com ---

2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker

--- Content provided by FirstRanker.com ---

c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters

--- Content provided by FirstRanker.com ---

5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.

--- Content provided by FirstRanker.com ---

? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.

--- Content provided by FirstRanker.com ---

Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.
Implementation of half adder and full adder

--- Content provided by FirstRanker.com ---

4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.

--- Content provided by FirstRanker.com ---

Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog

--- Content provided by FirstRanker.com ---

HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:
Circuit that takes the logical decision and the process are called logic gates. Each gate has one or

--- Content provided by FirstRanker.com ---

more input and only one output. OR, AND and NOT are basic gates. NAND, NOR and X-OR are known as
universal gates. Basic gates form these 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

--- Content provided by FirstRanker.com ---

low.
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.
NOT gate

--- Content provided by FirstRanker.com ---

A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.

--- Content provided by FirstRanker.com ---

NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is

--- Content provided by FirstRanker.com ---

similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

1. Connections are given as per the circuit diagram.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

At the completion of an experiment student will able to verify the truth

--- Content provided by FirstRanker.com ---

table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?

--- Content provided by FirstRanker.com ---

6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.

--- Content provided by FirstRanker.com ---

11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?

--- Content provided by FirstRanker.com ---

16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:

--- Content provided by FirstRanker.com ---

1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.

--- Content provided by FirstRanker.com ---

4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?

--- Content provided by FirstRanker.com ---

4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.

--- Content provided by FirstRanker.com ---

Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,

--- Content provided by FirstRanker.com ---

S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 1
8. 1 1 1 1 1


Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the

--- Content provided by FirstRanker.com ---

full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.

--- Content provided by FirstRanker.com ---

Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different

--- Content provided by FirstRanker.com ---

levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative

--- Content provided by FirstRanker.com ---

Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental

--- Content provided by FirstRanker.com ---

concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.

--- Content provided by FirstRanker.com ---

e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.

--- Content provided by FirstRanker.com ---

i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:
? Understand the various logic gates.

--- Content provided by FirstRanker.com ---

? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:

--- Content provided by FirstRanker.com ---

1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor

--- Content provided by FirstRanker.com ---

b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers

--- Content provided by FirstRanker.com ---

b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:

--- Content provided by FirstRanker.com ---

? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates

--- Content provided by FirstRanker.com ---

2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.

--- Content provided by FirstRanker.com ---

Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and

--- Content provided by FirstRanker.com ---

MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.

--- Content provided by FirstRanker.com ---

9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.

--- Content provided by FirstRanker.com ---

Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

Aim:

--- Content provided by FirstRanker.com ---

To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate
The AND gate performs a logical multiplication commonly known as AND function. The

--- Content provided by FirstRanker.com ---

output is high when both the inputs are high. The output is low level when any one of the inputs is
low.
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.

--- Content provided by FirstRanker.com ---

NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low

--- Content provided by FirstRanker.com ---

and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate

--- Content provided by FirstRanker.com ---

An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?

--- Content provided by FirstRanker.com ---

5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.

--- Content provided by FirstRanker.com ---

10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?

--- Content provided by FirstRanker.com ---

15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

1. A+AB = A

--- Content provided by FirstRanker.com ---

2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.

--- Content provided by FirstRanker.com ---

A.B = A+B


Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.

--- Content provided by FirstRanker.com ---

3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?

--- Content provided by FirstRanker.com ---

3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower

--- Content provided by FirstRanker.com ---

significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output
A B C S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 1 1



17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the

--- Content provided by FirstRanker.com ---

subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the

--- Content provided by FirstRanker.com ---

difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

Difference, DIFF = A B

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1


FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________

--- Content provided by FirstRanker.com ---

Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on

--- Content provided by FirstRanker.com ---

heart and soul



DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to

--- Content provided by FirstRanker.com ---

professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals

--- Content provided by FirstRanker.com ---

To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new

--- Content provided by FirstRanker.com ---

technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall

--- Content provided by FirstRanker.com ---

development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good

--- Content provided by FirstRanker.com ---

professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.

--- Content provided by FirstRanker.com ---

c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.

--- Content provided by FirstRanker.com ---

g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.

--- Content provided by FirstRanker.com ---

k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:

--- Content provided by FirstRanker.com ---

The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits

--- Content provided by FirstRanker.com ---

? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.

--- Content provided by FirstRanker.com ---

3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers

--- Content provided by FirstRanker.com ---

4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.

--- Content provided by FirstRanker.com ---

? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor

--- Content provided by FirstRanker.com ---

5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.

--- Content provided by FirstRanker.com ---

Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.
Design and Implementation of Magnitude Comparator.

--- Content provided by FirstRanker.com ---

8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.

--- Content provided by FirstRanker.com ---

Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.

--- Content provided by FirstRanker.com ---

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.
OR gate

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.

--- Content provided by FirstRanker.com ---

NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The

--- Content provided by FirstRanker.com ---

output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.

--- Content provided by FirstRanker.com ---

3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.

--- Content provided by FirstRanker.com ---

8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?

--- Content provided by FirstRanker.com ---

13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A

--- Content provided by FirstRanker.com ---

2. A.B=B.A

2. Associative Law

The binary operator OR, AND is said to be associative if,

--- Content provided by FirstRanker.com ---

1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.

--- Content provided by FirstRanker.com ---

A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law

--- Content provided by FirstRanker.com ---

A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V

--- Content provided by FirstRanker.com ---

cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

S. No. Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required


Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four

--- Content provided by FirstRanker.com ---

possible elementary operations, namely,

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables

--- Content provided by FirstRanker.com ---

designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented

--- Content provided by FirstRanker.com ---

with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC



16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:



18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 V supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The

--- Content provided by FirstRanker.com ---

three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________

--- Content provided by FirstRanker.com ---

Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics

--- Content provided by FirstRanker.com ---

Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.

--- Content provided by FirstRanker.com ---

? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of

--- Content provided by FirstRanker.com ---

engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.

--- Content provided by FirstRanker.com ---

d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.

--- Content provided by FirstRanker.com ---

h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:

--- Content provided by FirstRanker.com ---

? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL

--- Content provided by FirstRanker.com ---

List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:

--- Content provided by FirstRanker.com ---

a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:

--- Content provided by FirstRanker.com ---

a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.

--- Content provided by FirstRanker.com ---

? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.

--- Content provided by FirstRanker.com ---

Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.

--- Content provided by FirstRanker.com ---

Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI

--- Content provided by FirstRanker.com ---

Devices

7.
Design and Implementation of Magnitude Comparator.
8.

--- Content provided by FirstRanker.com ---

Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.

--- Content provided by FirstRanker.com ---

11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.

--- Content provided by FirstRanker.com ---

Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate

--- Content provided by FirstRanker.com ---

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.
OR gate
The OR gate performs a logical addition commonly known as OR function. The output is

--- Content provided by FirstRanker.com ---

high when any one of the inputs is high. The output is low level when both the inputs are low.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate

--- Content provided by FirstRanker.com ---

The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.

--- Content provided by FirstRanker.com ---

EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?

--- Content provided by FirstRanker.com ---

4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.

--- Content provided by FirstRanker.com ---

9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?

--- Content provided by FirstRanker.com ---

14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C

--- Content provided by FirstRanker.com ---

2. A.(B.C) = (A.B).C

3. Distributive Law

The binary operator OR, AND is said to be distributive if,

--- Content provided by FirstRanker.com ---

1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B

--- Content provided by FirstRanker.com ---

2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B


Design

--- Content provided by FirstRanker.com ---

1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc

--- Content provided by FirstRanker.com ---

.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.



1. What is Demorgan?s law?

--- Content provided by FirstRanker.com ---

2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is

--- Content provided by FirstRanker.com ---

performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1

--- Content provided by FirstRanker.com ---

5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit

--- Content provided by FirstRanker.com ---

is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input

--- Content provided by FirstRanker.com ---

variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be

--- Content provided by FirstRanker.com ---

implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:

--- Content provided by FirstRanker.com ---

To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C

--- Content provided by FirstRanker.com ---

0
and it ripples through
the full adder to the output carry C
4
.

--- Content provided by FirstRanker.com ---

4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0

--- Content provided by FirstRanker.com ---

must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary

--- Content provided by FirstRanker.com ---

adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.
FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________

--- Content provided by FirstRanker.com ---

Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics

--- Content provided by FirstRanker.com ---

Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.

--- Content provided by FirstRanker.com ---

? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of

--- Content provided by FirstRanker.com ---

engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.

--- Content provided by FirstRanker.com ---

d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.

--- Content provided by FirstRanker.com ---

h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:

--- Content provided by FirstRanker.com ---

? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL

--- Content provided by FirstRanker.com ---

List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:

--- Content provided by FirstRanker.com ---

a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:

--- Content provided by FirstRanker.com ---

a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.

--- Content provided by FirstRanker.com ---

? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.

--- Content provided by FirstRanker.com ---

Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.

--- Content provided by FirstRanker.com ---

Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI

--- Content provided by FirstRanker.com ---

Devices

7.
Design and Implementation of Magnitude Comparator.
8.

--- Content provided by FirstRanker.com ---

Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.

--- Content provided by FirstRanker.com ---

11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.

--- Content provided by FirstRanker.com ---

Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate

--- Content provided by FirstRanker.com ---

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.
OR gate
The OR gate performs a logical addition commonly known as OR function. The output is

--- Content provided by FirstRanker.com ---

high when any one of the inputs is high. The output is low level when both the inputs are low.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate

--- Content provided by FirstRanker.com ---

The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.

--- Content provided by FirstRanker.com ---

EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?

--- Content provided by FirstRanker.com ---

4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.

--- Content provided by FirstRanker.com ---

9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?

--- Content provided by FirstRanker.com ---

14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C

--- Content provided by FirstRanker.com ---

2. A.(B.C) = (A.B).C

3. Distributive Law

The binary operator OR, AND is said to be distributive if,

--- Content provided by FirstRanker.com ---

1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B

--- Content provided by FirstRanker.com ---

2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B


Design

--- Content provided by FirstRanker.com ---

1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc

--- Content provided by FirstRanker.com ---

.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.



1. What is Demorgan?s law?

--- Content provided by FirstRanker.com ---

2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is

--- Content provided by FirstRanker.com ---

performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1

--- Content provided by FirstRanker.com ---

5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit

--- Content provided by FirstRanker.com ---

is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input

--- Content provided by FirstRanker.com ---

variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be

--- Content provided by FirstRanker.com ---

implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:

--- Content provided by FirstRanker.com ---

To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C

--- Content provided by FirstRanker.com ---

0
and it ripples through
the full adder to the output carry C
4
.

--- Content provided by FirstRanker.com ---

4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0

--- Content provided by FirstRanker.com ---

must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary

--- Content provided by FirstRanker.com ---

adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:
FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and

--- Content provided by FirstRanker.com ---

training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.

--- Content provided by FirstRanker.com ---

? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence

--- Content provided by FirstRanker.com ---

To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which

--- Content provided by FirstRanker.com ---

enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a

--- Content provided by FirstRanker.com ---

team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with

--- Content provided by FirstRanker.com ---

commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.

--- Content provided by FirstRanker.com ---

b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to

--- Content provided by FirstRanker.com ---

analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.

--- Content provided by FirstRanker.com ---

j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.

--- Content provided by FirstRanker.com ---

? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary

--- Content provided by FirstRanker.com ---

functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator

--- Content provided by FirstRanker.com ---

d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.

--- Content provided by FirstRanker.com ---

6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.

--- Content provided by FirstRanker.com ---

? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary

--- Content provided by FirstRanker.com ---

Functions, Code Converters

3.
Implementation of half adder and full adder
4.

--- Content provided by FirstRanker.com ---

Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.

--- Content provided by FirstRanker.com ---

Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.

--- Content provided by FirstRanker.com ---

10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

8. Connecting wires As required

Theory:
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 and X-OR are known as

--- Content provided by FirstRanker.com ---

universal gates. Basic gates form these 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.

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. The NOT gate is

--- Content provided by FirstRanker.com ---

called an inverter. The output is high when the input is low. The output is low when the input is high.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate

--- Content provided by FirstRanker.com ---

The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive

--- Content provided by FirstRanker.com ---

OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.



8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.

--- Content provided by FirstRanker.com ---

2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.

--- Content provided by FirstRanker.com ---

7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.

--- Content provided by FirstRanker.com ---

12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC

--- Content provided by FirstRanker.com ---

GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

The binary operator OR, AND is said to be commutative if,

--- Content provided by FirstRanker.com ---

1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

6. Complementary Law

1. A+A' = 1

--- Content provided by FirstRanker.com ---

2. A.A' = 0

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual

--- Content provided by FirstRanker.com ---

complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.

--- Content provided by FirstRanker.com ---

2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics

--- Content provided by FirstRanker.com ---

5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. EX-OR gate IC 7486 1
6. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The

--- Content provided by FirstRanker.com ---

three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1


Sl.No. Input Output
A B S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained

--- Content provided by FirstRanker.com ---

as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor

--- Content provided by FirstRanker.com ---

Truth table:


Sl.No.
Input Output

--- Content provided by FirstRanker.com ---

A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1

--- Content provided by FirstRanker.com ---

5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are

--- Content provided by FirstRanker.com ---

designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through
the full adder to the output carry C

--- Content provided by FirstRanker.com ---

4
.
4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input

--- Content provided by FirstRanker.com ---

?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

--- Content provided by FirstRanker.com ---

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

--- Content provided by FirstRanker.com ---

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:



24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was

--- Content provided by FirstRanker.com ---

verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction

--- Content provided by FirstRanker.com ---

A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1
FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________

--- Content provided by FirstRanker.com ---

Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on

--- Content provided by FirstRanker.com ---

heart and soul



DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to

--- Content provided by FirstRanker.com ---

professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals

--- Content provided by FirstRanker.com ---

To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new

--- Content provided by FirstRanker.com ---

technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall

--- Content provided by FirstRanker.com ---

development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good

--- Content provided by FirstRanker.com ---

professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.

--- Content provided by FirstRanker.com ---

c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.

--- Content provided by FirstRanker.com ---

g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.

--- Content provided by FirstRanker.com ---

k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:

--- Content provided by FirstRanker.com ---

The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits

--- Content provided by FirstRanker.com ---

? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.

--- Content provided by FirstRanker.com ---

3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers

--- Content provided by FirstRanker.com ---

4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.

--- Content provided by FirstRanker.com ---

? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor

--- Content provided by FirstRanker.com ---

5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.

--- Content provided by FirstRanker.com ---

Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.
Design and Implementation of Magnitude Comparator.

--- Content provided by FirstRanker.com ---

8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.

--- Content provided by FirstRanker.com ---

Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.

--- Content provided by FirstRanker.com ---

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.
OR gate

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.

--- Content provided by FirstRanker.com ---

NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The

--- Content provided by FirstRanker.com ---

output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.

--- Content provided by FirstRanker.com ---

3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.

--- Content provided by FirstRanker.com ---

8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?

--- Content provided by FirstRanker.com ---

13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A

--- Content provided by FirstRanker.com ---

2. A.B=B.A

2. Associative Law

The binary operator OR, AND is said to be associative if,

--- Content provided by FirstRanker.com ---

1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.

--- Content provided by FirstRanker.com ---

A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law

--- Content provided by FirstRanker.com ---

A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V

--- Content provided by FirstRanker.com ---

cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

S. No. Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required


Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four

--- Content provided by FirstRanker.com ---

possible elementary operations, namely,

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables

--- Content provided by FirstRanker.com ---

designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented

--- Content provided by FirstRanker.com ---

with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC



16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:



18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 V supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The

--- Content provided by FirstRanker.com ---

three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The

--- Content provided by FirstRanker.com ---

carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through
the full adder to the output carry C
4

--- Content provided by FirstRanker.com ---

.
4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C

--- Content provided by FirstRanker.com ---

0
must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

--- Content provided by FirstRanker.com ---

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

--- Content provided by FirstRanker.com ---

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1

--- Content provided by FirstRanker.com ---

1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1

--- Content provided by FirstRanker.com ---

1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.

--- Content provided by FirstRanker.com ---

4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.

--- Content provided by FirstRanker.com ---

9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?

--- Content provided by FirstRanker.com ---

14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice



1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and

--- Content provided by FirstRanker.com ---

enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s

--- Content provided by FirstRanker.com ---

needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the

--- Content provided by FirstRanker.com ---

industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism

--- Content provided by FirstRanker.com ---

To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics

--- Content provided by FirstRanker.com ---

To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.

--- Content provided by FirstRanker.com ---

f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also

--- Content provided by FirstRanker.com ---

will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.

--- Content provided by FirstRanker.com ---

? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.

--- Content provided by FirstRanker.com ---

2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker

--- Content provided by FirstRanker.com ---

c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters

--- Content provided by FirstRanker.com ---

5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.

--- Content provided by FirstRanker.com ---

? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.

--- Content provided by FirstRanker.com ---

Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.
Implementation of half adder and full adder

--- Content provided by FirstRanker.com ---

4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.

--- Content provided by FirstRanker.com ---

Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog

--- Content provided by FirstRanker.com ---

HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:
Circuit that takes the logical decision and the process are called logic gates. Each gate has one or

--- Content provided by FirstRanker.com ---

more input and only one output. OR, AND and NOT are basic gates. NAND, NOR and X-OR are known as
universal gates. Basic gates form these 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

--- Content provided by FirstRanker.com ---

low.
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.
NOT gate

--- Content provided by FirstRanker.com ---

A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.

--- Content provided by FirstRanker.com ---

NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is

--- Content provided by FirstRanker.com ---

similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

1. Connections are given as per the circuit diagram.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

At the completion of an experiment student will able to verify the truth

--- Content provided by FirstRanker.com ---

table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?

--- Content provided by FirstRanker.com ---

6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.

--- Content provided by FirstRanker.com ---

11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?

--- Content provided by FirstRanker.com ---

16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:

--- Content provided by FirstRanker.com ---

1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.

--- Content provided by FirstRanker.com ---

4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?

--- Content provided by FirstRanker.com ---

4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.

--- Content provided by FirstRanker.com ---

Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,

--- Content provided by FirstRanker.com ---

S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 1
8. 1 1 1 1 1


Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the

--- Content provided by FirstRanker.com ---

full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.

--- Content provided by FirstRanker.com ---

Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:


Sl.No.

--- Content provided by FirstRanker.com ---

Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to

--- Content provided by FirstRanker.com ---

the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through

--- Content provided by FirstRanker.com ---

the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.

--- Content provided by FirstRanker.com ---

4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:

--- Content provided by FirstRanker.com ---

The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?

--- Content provided by FirstRanker.com ---

2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.

--- Content provided by FirstRanker.com ---

7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?

--- Content provided by FirstRanker.com ---

12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two

--- Content provided by FirstRanker.com ---

numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice



1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and

--- Content provided by FirstRanker.com ---

enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s

--- Content provided by FirstRanker.com ---

needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the

--- Content provided by FirstRanker.com ---

industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism

--- Content provided by FirstRanker.com ---

To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics

--- Content provided by FirstRanker.com ---

To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.

--- Content provided by FirstRanker.com ---

f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also

--- Content provided by FirstRanker.com ---

will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.

--- Content provided by FirstRanker.com ---

? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.

--- Content provided by FirstRanker.com ---

2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker

--- Content provided by FirstRanker.com ---

c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters

--- Content provided by FirstRanker.com ---

5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.

--- Content provided by FirstRanker.com ---

? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.

--- Content provided by FirstRanker.com ---

Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.
Implementation of half adder and full adder

--- Content provided by FirstRanker.com ---

4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.

--- Content provided by FirstRanker.com ---

Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog

--- Content provided by FirstRanker.com ---

HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:
Circuit that takes the logical decision and the process are called logic gates. Each gate has one or

--- Content provided by FirstRanker.com ---

more input and only one output. OR, AND and NOT are basic gates. NAND, NOR and X-OR are known as
universal gates. Basic gates form these 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

--- Content provided by FirstRanker.com ---

low.
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.
NOT gate

--- Content provided by FirstRanker.com ---

A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.

--- Content provided by FirstRanker.com ---

NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is

--- Content provided by FirstRanker.com ---

similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

1. Connections are given as per the circuit diagram.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

At the completion of an experiment student will able to verify the truth

--- Content provided by FirstRanker.com ---

table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?

--- Content provided by FirstRanker.com ---

6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.

--- Content provided by FirstRanker.com ---

11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?

--- Content provided by FirstRanker.com ---

16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:

--- Content provided by FirstRanker.com ---

1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.

--- Content provided by FirstRanker.com ---

4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?

--- Content provided by FirstRanker.com ---

4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.

--- Content provided by FirstRanker.com ---

Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,

--- Content provided by FirstRanker.com ---

S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 1
8. 1 1 1 1 1


Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the

--- Content provided by FirstRanker.com ---

full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.

--- Content provided by FirstRanker.com ---

Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:


Sl.No.

--- Content provided by FirstRanker.com ---

Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to

--- Content provided by FirstRanker.com ---

the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through

--- Content provided by FirstRanker.com ---

the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.

--- Content provided by FirstRanker.com ---

4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:

--- Content provided by FirstRanker.com ---

The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?

--- Content provided by FirstRanker.com ---

2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.

--- Content provided by FirstRanker.com ---

7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?

--- Content provided by FirstRanker.com ---

12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two

--- Content provided by FirstRanker.com ---

numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different

--- Content provided by FirstRanker.com ---

levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative

--- Content provided by FirstRanker.com ---

Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental

--- Content provided by FirstRanker.com ---

concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.

--- Content provided by FirstRanker.com ---

e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.

--- Content provided by FirstRanker.com ---

i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:
? Understand the various logic gates.

--- Content provided by FirstRanker.com ---

? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:

--- Content provided by FirstRanker.com ---

1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor

--- Content provided by FirstRanker.com ---

b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers

--- Content provided by FirstRanker.com ---

b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:

--- Content provided by FirstRanker.com ---

? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates

--- Content provided by FirstRanker.com ---

2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.

--- Content provided by FirstRanker.com ---

Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and

--- Content provided by FirstRanker.com ---

MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.

--- Content provided by FirstRanker.com ---

9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.

--- Content provided by FirstRanker.com ---

Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

Aim:

--- Content provided by FirstRanker.com ---

To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate
The AND gate performs a logical multiplication commonly known as AND function. The

--- Content provided by FirstRanker.com ---

output is high when both the inputs are high. The output is low level when any one of the inputs is
low.
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.

--- Content provided by FirstRanker.com ---

NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low

--- Content provided by FirstRanker.com ---

and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate

--- Content provided by FirstRanker.com ---

An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?

--- Content provided by FirstRanker.com ---

5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.

--- Content provided by FirstRanker.com ---

10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?

--- Content provided by FirstRanker.com ---

15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

1. A+AB = A

--- Content provided by FirstRanker.com ---

2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.

--- Content provided by FirstRanker.com ---

A.B = A+B


Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.

--- Content provided by FirstRanker.com ---

3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?

--- Content provided by FirstRanker.com ---

3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower

--- Content provided by FirstRanker.com ---

significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output
A B C S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 1 1



17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the

--- Content provided by FirstRanker.com ---

subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the

--- Content provided by FirstRanker.com ---

difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

Difference, DIFF = A B

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be

--- Content provided by FirstRanker.com ---

constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0

--- Content provided by FirstRanker.com ---

and it ripples through
the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing

--- Content provided by FirstRanker.com ---

subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it

--- Content provided by FirstRanker.com ---

becomes subtractor.



23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.

--- Content provided by FirstRanker.com ---

Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.

--- Content provided by FirstRanker.com ---

6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?

--- Content provided by FirstRanker.com ---

11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less

--- Content provided by FirstRanker.com ---

than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice



1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and

--- Content provided by FirstRanker.com ---

enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s

--- Content provided by FirstRanker.com ---

needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the

--- Content provided by FirstRanker.com ---

industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism

--- Content provided by FirstRanker.com ---

To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics

--- Content provided by FirstRanker.com ---

To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.

--- Content provided by FirstRanker.com ---

f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also

--- Content provided by FirstRanker.com ---

will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.

--- Content provided by FirstRanker.com ---

? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.

--- Content provided by FirstRanker.com ---

2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker

--- Content provided by FirstRanker.com ---

c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters

--- Content provided by FirstRanker.com ---

5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.

--- Content provided by FirstRanker.com ---

? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.

--- Content provided by FirstRanker.com ---

Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.
Implementation of half adder and full adder

--- Content provided by FirstRanker.com ---

4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.

--- Content provided by FirstRanker.com ---

Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog

--- Content provided by FirstRanker.com ---

HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:
Circuit that takes the logical decision and the process are called logic gates. Each gate has one or

--- Content provided by FirstRanker.com ---

more input and only one output. OR, AND and NOT are basic gates. NAND, NOR and X-OR are known as
universal gates. Basic gates form these 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

--- Content provided by FirstRanker.com ---

low.
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.
NOT gate

--- Content provided by FirstRanker.com ---

A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.

--- Content provided by FirstRanker.com ---

NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is

--- Content provided by FirstRanker.com ---

similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

1. Connections are given as per the circuit diagram.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

At the completion of an experiment student will able to verify the truth

--- Content provided by FirstRanker.com ---

table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?

--- Content provided by FirstRanker.com ---

6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.

--- Content provided by FirstRanker.com ---

11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?

--- Content provided by FirstRanker.com ---

16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:

--- Content provided by FirstRanker.com ---

1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.

--- Content provided by FirstRanker.com ---

4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?

--- Content provided by FirstRanker.com ---

4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.

--- Content provided by FirstRanker.com ---

Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,

--- Content provided by FirstRanker.com ---

S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 1
8. 1 1 1 1 1


Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the

--- Content provided by FirstRanker.com ---

full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.

--- Content provided by FirstRanker.com ---

Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:


Sl.No.

--- Content provided by FirstRanker.com ---

Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to

--- Content provided by FirstRanker.com ---

the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through

--- Content provided by FirstRanker.com ---

the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.

--- Content provided by FirstRanker.com ---

4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:

--- Content provided by FirstRanker.com ---

The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?

--- Content provided by FirstRanker.com ---

2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.

--- Content provided by FirstRanker.com ---

7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?

--- Content provided by FirstRanker.com ---

12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two

--- Content provided by FirstRanker.com ---

numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 1 0
0 0 0 1
0 0 0 1
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

1 0 0
0 0 0 0
0 0 0 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 1
Viva ? Voce

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________

--- Content provided by FirstRanker.com ---

Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on

--- Content provided by FirstRanker.com ---

heart and soul



DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to

--- Content provided by FirstRanker.com ---

professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals

--- Content provided by FirstRanker.com ---

To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new

--- Content provided by FirstRanker.com ---

technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall

--- Content provided by FirstRanker.com ---

development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good

--- Content provided by FirstRanker.com ---

professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.

--- Content provided by FirstRanker.com ---

c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.

--- Content provided by FirstRanker.com ---

g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.

--- Content provided by FirstRanker.com ---

k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:

--- Content provided by FirstRanker.com ---

The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits

--- Content provided by FirstRanker.com ---

? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.

--- Content provided by FirstRanker.com ---

3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers

--- Content provided by FirstRanker.com ---

4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.

--- Content provided by FirstRanker.com ---

? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor

--- Content provided by FirstRanker.com ---

5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.

--- Content provided by FirstRanker.com ---

Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.
Design and Implementation of Magnitude Comparator.

--- Content provided by FirstRanker.com ---

8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.

--- Content provided by FirstRanker.com ---

Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.

--- Content provided by FirstRanker.com ---

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.
OR gate

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.

--- Content provided by FirstRanker.com ---

NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The

--- Content provided by FirstRanker.com ---

output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.

--- Content provided by FirstRanker.com ---

3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.

--- Content provided by FirstRanker.com ---

8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?

--- Content provided by FirstRanker.com ---

13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A

--- Content provided by FirstRanker.com ---

2. A.B=B.A

2. Associative Law

The binary operator OR, AND is said to be associative if,

--- Content provided by FirstRanker.com ---

1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.

--- Content provided by FirstRanker.com ---

A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law

--- Content provided by FirstRanker.com ---

A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V

--- Content provided by FirstRanker.com ---

cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

S. No. Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required


Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four

--- Content provided by FirstRanker.com ---

possible elementary operations, namely,

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables

--- Content provided by FirstRanker.com ---

designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented

--- Content provided by FirstRanker.com ---

with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC



16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:



18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 V supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The

--- Content provided by FirstRanker.com ---

three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The

--- Content provided by FirstRanker.com ---

carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through
the full adder to the output carry C
4

--- Content provided by FirstRanker.com ---

.
4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C

--- Content provided by FirstRanker.com ---

0
must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

--- Content provided by FirstRanker.com ---

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

--- Content provided by FirstRanker.com ---

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1

--- Content provided by FirstRanker.com ---

1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1

--- Content provided by FirstRanker.com ---

1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.

--- Content provided by FirstRanker.com ---

4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.

--- Content provided by FirstRanker.com ---

9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?

--- Content provided by FirstRanker.com ---

14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.6: MAGNITUDE COMPARATOR

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude

--- Content provided by FirstRanker.com ---

comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 0 0 0
0 1 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 0
0 0 0 0
1 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 1
0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.

--- Content provided by FirstRanker.com ---

6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.

--- Content provided by FirstRanker.com ---

12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION
FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and

--- Content provided by FirstRanker.com ---

training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.

--- Content provided by FirstRanker.com ---

? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence

--- Content provided by FirstRanker.com ---

To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which

--- Content provided by FirstRanker.com ---

enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a

--- Content provided by FirstRanker.com ---

team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with

--- Content provided by FirstRanker.com ---

commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.

--- Content provided by FirstRanker.com ---

b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to

--- Content provided by FirstRanker.com ---

analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.

--- Content provided by FirstRanker.com ---

j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.

--- Content provided by FirstRanker.com ---

? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary

--- Content provided by FirstRanker.com ---

functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator

--- Content provided by FirstRanker.com ---

d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.

--- Content provided by FirstRanker.com ---

6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.

--- Content provided by FirstRanker.com ---

? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary

--- Content provided by FirstRanker.com ---

Functions, Code Converters

3.
Implementation of half adder and full adder
4.

--- Content provided by FirstRanker.com ---

Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.

--- Content provided by FirstRanker.com ---

Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.

--- Content provided by FirstRanker.com ---

10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

8. Connecting wires As required

Theory:
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 and X-OR are known as

--- Content provided by FirstRanker.com ---

universal gates. Basic gates form these 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.

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. The NOT gate is

--- Content provided by FirstRanker.com ---

called an inverter. The output is high when the input is low. The output is low when the input is high.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate

--- Content provided by FirstRanker.com ---

The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive

--- Content provided by FirstRanker.com ---

OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.



8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.

--- Content provided by FirstRanker.com ---

2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.

--- Content provided by FirstRanker.com ---

7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.

--- Content provided by FirstRanker.com ---

12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC

--- Content provided by FirstRanker.com ---

GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

The binary operator OR, AND is said to be commutative if,

--- Content provided by FirstRanker.com ---

1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

6. Complementary Law

1. A+A' = 1

--- Content provided by FirstRanker.com ---

2. A.A' = 0

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual

--- Content provided by FirstRanker.com ---

complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.

--- Content provided by FirstRanker.com ---

2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics

--- Content provided by FirstRanker.com ---

5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. EX-OR gate IC 7486 1
6. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The

--- Content provided by FirstRanker.com ---

three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1


Sl.No. Input Output
A B S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained

--- Content provided by FirstRanker.com ---

as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor

--- Content provided by FirstRanker.com ---

Truth table:


Sl.No.
Input Output

--- Content provided by FirstRanker.com ---

A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1

--- Content provided by FirstRanker.com ---

5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are

--- Content provided by FirstRanker.com ---

designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through
the full adder to the output carry C

--- Content provided by FirstRanker.com ---

4
.
4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input

--- Content provided by FirstRanker.com ---

?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

--- Content provided by FirstRanker.com ---

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

--- Content provided by FirstRanker.com ---

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:



24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was

--- Content provided by FirstRanker.com ---

verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction

--- Content provided by FirstRanker.com ---

A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.

--- Content provided by FirstRanker.com ---

3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?

--- Content provided by FirstRanker.com ---

8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?

--- Content provided by FirstRanker.com ---

13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.6: MAGNITUDE COMPARATOR

Aim:
To design, construct and study the performance of 2 bit magnitude comparator

--- Content provided by FirstRanker.com ---

Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by

--- Content provided by FirstRanker.com ---

three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:



Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0
0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 1
0 0 0 0
0 0 0 0
1 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 0 0 1
0 0 0 1
0 0 1

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.

--- Content provided by FirstRanker.com ---

5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.

--- Content provided by FirstRanker.com ---

10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to

--- Content provided by FirstRanker.com ---

binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert

--- Content provided by FirstRanker.com ---

from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is

--- Content provided by FirstRanker.com ---

C+D has been used to implement partially each of three outputs.



Logic diagram:

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice



1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and

--- Content provided by FirstRanker.com ---

enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s

--- Content provided by FirstRanker.com ---

needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the

--- Content provided by FirstRanker.com ---

industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism

--- Content provided by FirstRanker.com ---

To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics

--- Content provided by FirstRanker.com ---

To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.

--- Content provided by FirstRanker.com ---

f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also

--- Content provided by FirstRanker.com ---

will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.

--- Content provided by FirstRanker.com ---

? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.

--- Content provided by FirstRanker.com ---

2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker

--- Content provided by FirstRanker.com ---

c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters

--- Content provided by FirstRanker.com ---

5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.

--- Content provided by FirstRanker.com ---

? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.

--- Content provided by FirstRanker.com ---

Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.
Implementation of half adder and full adder

--- Content provided by FirstRanker.com ---

4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.

--- Content provided by FirstRanker.com ---

Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog

--- Content provided by FirstRanker.com ---

HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:
Circuit that takes the logical decision and the process are called logic gates. Each gate has one or

--- Content provided by FirstRanker.com ---

more input and only one output. OR, AND and NOT are basic gates. NAND, NOR and X-OR are known as
universal gates. Basic gates form these 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

--- Content provided by FirstRanker.com ---

low.
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.
NOT gate

--- Content provided by FirstRanker.com ---

A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.

--- Content provided by FirstRanker.com ---

NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is

--- Content provided by FirstRanker.com ---

similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

1. Connections are given as per the circuit diagram.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

At the completion of an experiment student will able to verify the truth

--- Content provided by FirstRanker.com ---

table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?

--- Content provided by FirstRanker.com ---

6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.

--- Content provided by FirstRanker.com ---

11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?

--- Content provided by FirstRanker.com ---

16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:

--- Content provided by FirstRanker.com ---

1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.

--- Content provided by FirstRanker.com ---

4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?

--- Content provided by FirstRanker.com ---

4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.

--- Content provided by FirstRanker.com ---

Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,

--- Content provided by FirstRanker.com ---

S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 1
8. 1 1 1 1 1


Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the

--- Content provided by FirstRanker.com ---

full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.

--- Content provided by FirstRanker.com ---

Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:


Sl.No.

--- Content provided by FirstRanker.com ---

Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to

--- Content provided by FirstRanker.com ---

the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through

--- Content provided by FirstRanker.com ---

the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.

--- Content provided by FirstRanker.com ---

4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:

--- Content provided by FirstRanker.com ---

The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?

--- Content provided by FirstRanker.com ---

2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.

--- Content provided by FirstRanker.com ---

7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?

--- Content provided by FirstRanker.com ---

12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two

--- Content provided by FirstRanker.com ---

numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 1 0
0 0 0 1
0 0 0 1
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

1 0 0
0 0 0 0
0 0 0 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.

--- Content provided by FirstRanker.com ---

4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.

--- Content provided by FirstRanker.com ---

9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION



31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the

--- Content provided by FirstRanker.com ---

two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a

--- Content provided by FirstRanker.com ---

circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are

--- Content provided by FirstRanker.com ---

various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:



32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:
FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different

--- Content provided by FirstRanker.com ---

levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative

--- Content provided by FirstRanker.com ---

Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental

--- Content provided by FirstRanker.com ---

concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.

--- Content provided by FirstRanker.com ---

e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.

--- Content provided by FirstRanker.com ---

i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:
? Understand the various logic gates.

--- Content provided by FirstRanker.com ---

? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:

--- Content provided by FirstRanker.com ---

1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor

--- Content provided by FirstRanker.com ---

b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers

--- Content provided by FirstRanker.com ---

b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:

--- Content provided by FirstRanker.com ---

? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates

--- Content provided by FirstRanker.com ---

2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.

--- Content provided by FirstRanker.com ---

Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and

--- Content provided by FirstRanker.com ---

MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.

--- Content provided by FirstRanker.com ---

9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.

--- Content provided by FirstRanker.com ---

Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

Aim:

--- Content provided by FirstRanker.com ---

To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate
The AND gate performs a logical multiplication commonly known as AND function. The

--- Content provided by FirstRanker.com ---

output is high when both the inputs are high. The output is low level when any one of the inputs is
low.
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.

--- Content provided by FirstRanker.com ---

NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low

--- Content provided by FirstRanker.com ---

and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate

--- Content provided by FirstRanker.com ---

An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?

--- Content provided by FirstRanker.com ---

5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.

--- Content provided by FirstRanker.com ---

10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?

--- Content provided by FirstRanker.com ---

15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

1. A+AB = A

--- Content provided by FirstRanker.com ---

2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.

--- Content provided by FirstRanker.com ---

A.B = A+B


Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.

--- Content provided by FirstRanker.com ---

3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?

--- Content provided by FirstRanker.com ---

3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower

--- Content provided by FirstRanker.com ---

significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output
A B C S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 1 1



17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the

--- Content provided by FirstRanker.com ---

subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the

--- Content provided by FirstRanker.com ---

difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

Difference, DIFF = A B

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be

--- Content provided by FirstRanker.com ---

constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0

--- Content provided by FirstRanker.com ---

and it ripples through
the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing

--- Content provided by FirstRanker.com ---

subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it

--- Content provided by FirstRanker.com ---

becomes subtractor.



23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.

--- Content provided by FirstRanker.com ---

Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.

--- Content provided by FirstRanker.com ---

6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?

--- Content provided by FirstRanker.com ---

11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less

--- Content provided by FirstRanker.com ---

than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 1 0
0 0 0 1
0 0 0 1
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
1 0 0
0 0 0 0
0 0 0 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?

--- Content provided by FirstRanker.com ---

3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?

--- Content provided by FirstRanker.com ---

8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:
To design, construct and study the performance of 4-bit different code converters

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two

--- Content provided by FirstRanker.com ---

systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is

--- Content provided by FirstRanker.com ---

designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-

--- Content provided by FirstRanker.com ---

level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice



1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and

--- Content provided by FirstRanker.com ---

enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s

--- Content provided by FirstRanker.com ---

needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the

--- Content provided by FirstRanker.com ---

industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism

--- Content provided by FirstRanker.com ---

To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics

--- Content provided by FirstRanker.com ---

To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.

--- Content provided by FirstRanker.com ---

f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also

--- Content provided by FirstRanker.com ---

will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.

--- Content provided by FirstRanker.com ---

? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.

--- Content provided by FirstRanker.com ---

2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker

--- Content provided by FirstRanker.com ---

c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters

--- Content provided by FirstRanker.com ---

5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.

--- Content provided by FirstRanker.com ---

? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.

--- Content provided by FirstRanker.com ---

Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.
Implementation of half adder and full adder

--- Content provided by FirstRanker.com ---

4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.

--- Content provided by FirstRanker.com ---

Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog

--- Content provided by FirstRanker.com ---

HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:
Circuit that takes the logical decision and the process are called logic gates. Each gate has one or

--- Content provided by FirstRanker.com ---

more input and only one output. OR, AND and NOT are basic gates. NAND, NOR and X-OR are known as
universal gates. Basic gates form these 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

--- Content provided by FirstRanker.com ---

low.
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.
NOT gate

--- Content provided by FirstRanker.com ---

A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.

--- Content provided by FirstRanker.com ---

NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is

--- Content provided by FirstRanker.com ---

similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

1. Connections are given as per the circuit diagram.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

At the completion of an experiment student will able to verify the truth

--- Content provided by FirstRanker.com ---

table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?

--- Content provided by FirstRanker.com ---

6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.

--- Content provided by FirstRanker.com ---

11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?

--- Content provided by FirstRanker.com ---

16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:

--- Content provided by FirstRanker.com ---

1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.

--- Content provided by FirstRanker.com ---

4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?

--- Content provided by FirstRanker.com ---

4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.

--- Content provided by FirstRanker.com ---

Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,

--- Content provided by FirstRanker.com ---

S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 1
8. 1 1 1 1 1


Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the

--- Content provided by FirstRanker.com ---

full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.

--- Content provided by FirstRanker.com ---

Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:


Sl.No.

--- Content provided by FirstRanker.com ---

Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to

--- Content provided by FirstRanker.com ---

the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through

--- Content provided by FirstRanker.com ---

the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.

--- Content provided by FirstRanker.com ---

4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:

--- Content provided by FirstRanker.com ---

The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?

--- Content provided by FirstRanker.com ---

2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.

--- Content provided by FirstRanker.com ---

7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?

--- Content provided by FirstRanker.com ---

12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two

--- Content provided by FirstRanker.com ---

numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 1 0
0 0 0 1
0 0 0 1
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

1 0 0
0 0 0 0
0 0 0 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.

--- Content provided by FirstRanker.com ---

4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.

--- Content provided by FirstRanker.com ---

9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION



31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the

--- Content provided by FirstRanker.com ---

two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a

--- Content provided by FirstRanker.com ---

circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are

--- Content provided by FirstRanker.com ---

various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:



32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:



33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G0:



Truth table:

--- Content provided by FirstRanker.com ---

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:



K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and

--- Content provided by FirstRanker.com ---

training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.

--- Content provided by FirstRanker.com ---

? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence

--- Content provided by FirstRanker.com ---

To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which

--- Content provided by FirstRanker.com ---

enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a

--- Content provided by FirstRanker.com ---

team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with

--- Content provided by FirstRanker.com ---

commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.

--- Content provided by FirstRanker.com ---

b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to

--- Content provided by FirstRanker.com ---

analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.

--- Content provided by FirstRanker.com ---

j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.

--- Content provided by FirstRanker.com ---

? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary

--- Content provided by FirstRanker.com ---

functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator

--- Content provided by FirstRanker.com ---

d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.

--- Content provided by FirstRanker.com ---

6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.

--- Content provided by FirstRanker.com ---

? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary

--- Content provided by FirstRanker.com ---

Functions, Code Converters

3.
Implementation of half adder and full adder
4.

--- Content provided by FirstRanker.com ---

Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.

--- Content provided by FirstRanker.com ---

Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.

--- Content provided by FirstRanker.com ---

10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

8. Connecting wires As required

Theory:
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 and X-OR are known as

--- Content provided by FirstRanker.com ---

universal gates. Basic gates form these 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.

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. The NOT gate is

--- Content provided by FirstRanker.com ---

called an inverter. The output is high when the input is low. The output is low when the input is high.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate

--- Content provided by FirstRanker.com ---

The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive

--- Content provided by FirstRanker.com ---

OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.



8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.

--- Content provided by FirstRanker.com ---

2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.

--- Content provided by FirstRanker.com ---

7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.

--- Content provided by FirstRanker.com ---

12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC

--- Content provided by FirstRanker.com ---

GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

The binary operator OR, AND is said to be commutative if,

--- Content provided by FirstRanker.com ---

1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

6. Complementary Law

1. A+A' = 1

--- Content provided by FirstRanker.com ---

2. A.A' = 0

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual

--- Content provided by FirstRanker.com ---

complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.

--- Content provided by FirstRanker.com ---

2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics

--- Content provided by FirstRanker.com ---

5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. EX-OR gate IC 7486 1
6. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The

--- Content provided by FirstRanker.com ---

three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1


Sl.No. Input Output
A B S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained

--- Content provided by FirstRanker.com ---

as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor

--- Content provided by FirstRanker.com ---

Truth table:


Sl.No.
Input Output

--- Content provided by FirstRanker.com ---

A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1

--- Content provided by FirstRanker.com ---

5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are

--- Content provided by FirstRanker.com ---

designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through
the full adder to the output carry C

--- Content provided by FirstRanker.com ---

4
.
4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input

--- Content provided by FirstRanker.com ---

?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

--- Content provided by FirstRanker.com ---

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

--- Content provided by FirstRanker.com ---

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:



24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was

--- Content provided by FirstRanker.com ---

verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction

--- Content provided by FirstRanker.com ---

A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.

--- Content provided by FirstRanker.com ---

3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?

--- Content provided by FirstRanker.com ---

8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?

--- Content provided by FirstRanker.com ---

13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.6: MAGNITUDE COMPARATOR

Aim:
To design, construct and study the performance of 2 bit magnitude comparator

--- Content provided by FirstRanker.com ---

Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by

--- Content provided by FirstRanker.com ---

three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:



Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0
0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 1
0 0 0 0
0 0 0 0
1 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 0 0 1
0 0 0 1
0 0 1

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.

--- Content provided by FirstRanker.com ---

5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.

--- Content provided by FirstRanker.com ---

10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to

--- Content provided by FirstRanker.com ---

binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert

--- Content provided by FirstRanker.com ---

from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is

--- Content provided by FirstRanker.com ---

C+D has been used to implement partially each of three outputs.



Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:


G3 = B3

--- Content provided by FirstRanker.com ---

K map for G2:

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and

--- Content provided by FirstRanker.com ---

training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.

--- Content provided by FirstRanker.com ---

? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence

--- Content provided by FirstRanker.com ---

To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which

--- Content provided by FirstRanker.com ---

enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a

--- Content provided by FirstRanker.com ---

team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with

--- Content provided by FirstRanker.com ---

commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.

--- Content provided by FirstRanker.com ---

b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to

--- Content provided by FirstRanker.com ---

analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.

--- Content provided by FirstRanker.com ---

j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.

--- Content provided by FirstRanker.com ---

? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary

--- Content provided by FirstRanker.com ---

functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator

--- Content provided by FirstRanker.com ---

d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.

--- Content provided by FirstRanker.com ---

6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.

--- Content provided by FirstRanker.com ---

? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary

--- Content provided by FirstRanker.com ---

Functions, Code Converters

3.
Implementation of half adder and full adder
4.

--- Content provided by FirstRanker.com ---

Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.

--- Content provided by FirstRanker.com ---

Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.

--- Content provided by FirstRanker.com ---

10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

8. Connecting wires As required

Theory:
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 and X-OR are known as

--- Content provided by FirstRanker.com ---

universal gates. Basic gates form these 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.

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. The NOT gate is

--- Content provided by FirstRanker.com ---

called an inverter. The output is high when the input is low. The output is low when the input is high.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate

--- Content provided by FirstRanker.com ---

The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive

--- Content provided by FirstRanker.com ---

OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.



8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.

--- Content provided by FirstRanker.com ---

2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.

--- Content provided by FirstRanker.com ---

7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.

--- Content provided by FirstRanker.com ---

12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC

--- Content provided by FirstRanker.com ---

GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

The binary operator OR, AND is said to be commutative if,

--- Content provided by FirstRanker.com ---

1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

6. Complementary Law

1. A+A' = 1

--- Content provided by FirstRanker.com ---

2. A.A' = 0

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual

--- Content provided by FirstRanker.com ---

complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.

--- Content provided by FirstRanker.com ---

2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics

--- Content provided by FirstRanker.com ---

5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. EX-OR gate IC 7486 1
6. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The

--- Content provided by FirstRanker.com ---

three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1


Sl.No. Input Output
A B S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained

--- Content provided by FirstRanker.com ---

as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor

--- Content provided by FirstRanker.com ---

Truth table:


Sl.No.
Input Output

--- Content provided by FirstRanker.com ---

A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1

--- Content provided by FirstRanker.com ---

5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are

--- Content provided by FirstRanker.com ---

designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through
the full adder to the output carry C

--- Content provided by FirstRanker.com ---

4
.
4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input

--- Content provided by FirstRanker.com ---

?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

--- Content provided by FirstRanker.com ---

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

--- Content provided by FirstRanker.com ---

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:



24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was

--- Content provided by FirstRanker.com ---

verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction

--- Content provided by FirstRanker.com ---

A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.

--- Content provided by FirstRanker.com ---

3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?

--- Content provided by FirstRanker.com ---

8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?

--- Content provided by FirstRanker.com ---

13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.6: MAGNITUDE COMPARATOR

Aim:
To design, construct and study the performance of 2 bit magnitude comparator

--- Content provided by FirstRanker.com ---

Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by

--- Content provided by FirstRanker.com ---

three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:



Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0
0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 1
0 0 0 0
0 0 0 0
1 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 0 0 1
0 0 0 1
0 0 1

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.

--- Content provided by FirstRanker.com ---

5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.

--- Content provided by FirstRanker.com ---

10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to

--- Content provided by FirstRanker.com ---

binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert

--- Content provided by FirstRanker.com ---

from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is

--- Content provided by FirstRanker.com ---

C+D has been used to implement partially each of three outputs.



Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:


G3 = B3

--- Content provided by FirstRanker.com ---

K map for G2:

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________

--- Content provided by FirstRanker.com ---

Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on

--- Content provided by FirstRanker.com ---

heart and soul



DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to

--- Content provided by FirstRanker.com ---

professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals

--- Content provided by FirstRanker.com ---

To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new

--- Content provided by FirstRanker.com ---

technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall

--- Content provided by FirstRanker.com ---

development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good

--- Content provided by FirstRanker.com ---

professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.

--- Content provided by FirstRanker.com ---

c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.

--- Content provided by FirstRanker.com ---

g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.

--- Content provided by FirstRanker.com ---

k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:

--- Content provided by FirstRanker.com ---

The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits

--- Content provided by FirstRanker.com ---

? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.

--- Content provided by FirstRanker.com ---

3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers

--- Content provided by FirstRanker.com ---

4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.

--- Content provided by FirstRanker.com ---

? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor

--- Content provided by FirstRanker.com ---

5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.

--- Content provided by FirstRanker.com ---

Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.
Design and Implementation of Magnitude Comparator.

--- Content provided by FirstRanker.com ---

8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.

--- Content provided by FirstRanker.com ---

Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.

--- Content provided by FirstRanker.com ---

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.
OR gate

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.

--- Content provided by FirstRanker.com ---

NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The

--- Content provided by FirstRanker.com ---

output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.

--- Content provided by FirstRanker.com ---

3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.

--- Content provided by FirstRanker.com ---

8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?

--- Content provided by FirstRanker.com ---

13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A

--- Content provided by FirstRanker.com ---

2. A.B=B.A

2. Associative Law

The binary operator OR, AND is said to be associative if,

--- Content provided by FirstRanker.com ---

1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.

--- Content provided by FirstRanker.com ---

A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law

--- Content provided by FirstRanker.com ---

A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V

--- Content provided by FirstRanker.com ---

cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

S. No. Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required


Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four

--- Content provided by FirstRanker.com ---

possible elementary operations, namely,

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables

--- Content provided by FirstRanker.com ---

designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented

--- Content provided by FirstRanker.com ---

with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC



16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:



18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 V supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The

--- Content provided by FirstRanker.com ---

three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The

--- Content provided by FirstRanker.com ---

carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through
the full adder to the output carry C
4

--- Content provided by FirstRanker.com ---

.
4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C

--- Content provided by FirstRanker.com ---

0
must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

--- Content provided by FirstRanker.com ---

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

--- Content provided by FirstRanker.com ---

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1

--- Content provided by FirstRanker.com ---

1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1

--- Content provided by FirstRanker.com ---

1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.

--- Content provided by FirstRanker.com ---

4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.

--- Content provided by FirstRanker.com ---

9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?

--- Content provided by FirstRanker.com ---

14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.6: MAGNITUDE COMPARATOR

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude

--- Content provided by FirstRanker.com ---

comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 0 0 0
0 1 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 0
0 0 0 0
1 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 1
0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.

--- Content provided by FirstRanker.com ---

6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.

--- Content provided by FirstRanker.com ---

12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to BCD code converter

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2

--- Content provided by FirstRanker.com ---

6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs

--- Content provided by FirstRanker.com ---

and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as

--- Content provided by FirstRanker.com ---

specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:


G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

K map for B1:



K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x
FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different

--- Content provided by FirstRanker.com ---

levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative

--- Content provided by FirstRanker.com ---

Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental

--- Content provided by FirstRanker.com ---

concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.

--- Content provided by FirstRanker.com ---

e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.

--- Content provided by FirstRanker.com ---

i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:
? Understand the various logic gates.

--- Content provided by FirstRanker.com ---

? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:

--- Content provided by FirstRanker.com ---

1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor

--- Content provided by FirstRanker.com ---

b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers

--- Content provided by FirstRanker.com ---

b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:

--- Content provided by FirstRanker.com ---

? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates

--- Content provided by FirstRanker.com ---

2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.

--- Content provided by FirstRanker.com ---

Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and

--- Content provided by FirstRanker.com ---

MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.

--- Content provided by FirstRanker.com ---

9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.

--- Content provided by FirstRanker.com ---

Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

Aim:

--- Content provided by FirstRanker.com ---

To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate
The AND gate performs a logical multiplication commonly known as AND function. The

--- Content provided by FirstRanker.com ---

output is high when both the inputs are high. The output is low level when any one of the inputs is
low.
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.

--- Content provided by FirstRanker.com ---

NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low

--- Content provided by FirstRanker.com ---

and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate

--- Content provided by FirstRanker.com ---

An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?

--- Content provided by FirstRanker.com ---

5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.

--- Content provided by FirstRanker.com ---

10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?

--- Content provided by FirstRanker.com ---

15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

1. A+AB = A

--- Content provided by FirstRanker.com ---

2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.

--- Content provided by FirstRanker.com ---

A.B = A+B


Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.

--- Content provided by FirstRanker.com ---

3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?

--- Content provided by FirstRanker.com ---

3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower

--- Content provided by FirstRanker.com ---

significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output
A B C S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 1 1



17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the

--- Content provided by FirstRanker.com ---

subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the

--- Content provided by FirstRanker.com ---

difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

Difference, DIFF = A B

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be

--- Content provided by FirstRanker.com ---

constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0

--- Content provided by FirstRanker.com ---

and it ripples through
the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing

--- Content provided by FirstRanker.com ---

subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it

--- Content provided by FirstRanker.com ---

becomes subtractor.



23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.

--- Content provided by FirstRanker.com ---

Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.

--- Content provided by FirstRanker.com ---

6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?

--- Content provided by FirstRanker.com ---

11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less

--- Content provided by FirstRanker.com ---

than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 1 0
0 0 0 1
0 0 0 1
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
1 0 0
0 0 0 0
0 0 0 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?

--- Content provided by FirstRanker.com ---

3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?

--- Content provided by FirstRanker.com ---

8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:
To design, construct and study the performance of 4-bit different code converters

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two

--- Content provided by FirstRanker.com ---

systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is

--- Content provided by FirstRanker.com ---

designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-

--- Content provided by FirstRanker.com ---

level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:



B3=G3

--- Content provided by FirstRanker.com ---

K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

G3 G2 G1 G0 B3 B2 B1 B0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:


E3 = B3 + B2 (B0 + B1)

--- Content provided by FirstRanker.com ---

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice



1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and

--- Content provided by FirstRanker.com ---

enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s

--- Content provided by FirstRanker.com ---

needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the

--- Content provided by FirstRanker.com ---

industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism

--- Content provided by FirstRanker.com ---

To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics

--- Content provided by FirstRanker.com ---

To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.

--- Content provided by FirstRanker.com ---

f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also

--- Content provided by FirstRanker.com ---

will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.

--- Content provided by FirstRanker.com ---

? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.

--- Content provided by FirstRanker.com ---

2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker

--- Content provided by FirstRanker.com ---

c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters

--- Content provided by FirstRanker.com ---

5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.

--- Content provided by FirstRanker.com ---

? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.

--- Content provided by FirstRanker.com ---

Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.
Implementation of half adder and full adder

--- Content provided by FirstRanker.com ---

4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.

--- Content provided by FirstRanker.com ---

Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog

--- Content provided by FirstRanker.com ---

HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:
Circuit that takes the logical decision and the process are called logic gates. Each gate has one or

--- Content provided by FirstRanker.com ---

more input and only one output. OR, AND and NOT are basic gates. NAND, NOR and X-OR are known as
universal gates. Basic gates form these 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

--- Content provided by FirstRanker.com ---

low.
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.
NOT gate

--- Content provided by FirstRanker.com ---

A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.

--- Content provided by FirstRanker.com ---

NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is

--- Content provided by FirstRanker.com ---

similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

1. Connections are given as per the circuit diagram.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

At the completion of an experiment student will able to verify the truth

--- Content provided by FirstRanker.com ---

table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?

--- Content provided by FirstRanker.com ---

6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.

--- Content provided by FirstRanker.com ---

11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?

--- Content provided by FirstRanker.com ---

16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:

--- Content provided by FirstRanker.com ---

1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.

--- Content provided by FirstRanker.com ---

4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?

--- Content provided by FirstRanker.com ---

4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.

--- Content provided by FirstRanker.com ---

Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,

--- Content provided by FirstRanker.com ---

S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 1
8. 1 1 1 1 1


Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the

--- Content provided by FirstRanker.com ---

full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.

--- Content provided by FirstRanker.com ---

Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:


Sl.No.

--- Content provided by FirstRanker.com ---

Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to

--- Content provided by FirstRanker.com ---

the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through

--- Content provided by FirstRanker.com ---

the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.

--- Content provided by FirstRanker.com ---

4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:

--- Content provided by FirstRanker.com ---

The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?

--- Content provided by FirstRanker.com ---

2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.

--- Content provided by FirstRanker.com ---

7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?

--- Content provided by FirstRanker.com ---

12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two

--- Content provided by FirstRanker.com ---

numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 1 0
0 0 0 1
0 0 0 1
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

1 0 0
0 0 0 0
0 0 0 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.

--- Content provided by FirstRanker.com ---

4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.

--- Content provided by FirstRanker.com ---

9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION



31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the

--- Content provided by FirstRanker.com ---

two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a

--- Content provided by FirstRanker.com ---

circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are

--- Content provided by FirstRanker.com ---

various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:



32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:



33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G0:



Truth table:

--- Content provided by FirstRanker.com ---

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:



K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:


E3 = B3 + B2 (B0 + B1)

--- Content provided by FirstRanker.com ---

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x

1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1

1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1


FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and

--- Content provided by FirstRanker.com ---

training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.

--- Content provided by FirstRanker.com ---

? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence

--- Content provided by FirstRanker.com ---

To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which

--- Content provided by FirstRanker.com ---

enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a

--- Content provided by FirstRanker.com ---

team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with

--- Content provided by FirstRanker.com ---

commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.

--- Content provided by FirstRanker.com ---

b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to

--- Content provided by FirstRanker.com ---

analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.

--- Content provided by FirstRanker.com ---

j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.

--- Content provided by FirstRanker.com ---

? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary

--- Content provided by FirstRanker.com ---

functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator

--- Content provided by FirstRanker.com ---

d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.

--- Content provided by FirstRanker.com ---

6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.

--- Content provided by FirstRanker.com ---

? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary

--- Content provided by FirstRanker.com ---

Functions, Code Converters

3.
Implementation of half adder and full adder
4.

--- Content provided by FirstRanker.com ---

Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.

--- Content provided by FirstRanker.com ---

Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.

--- Content provided by FirstRanker.com ---

10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

8. Connecting wires As required

Theory:
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 and X-OR are known as

--- Content provided by FirstRanker.com ---

universal gates. Basic gates form these 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.

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. The NOT gate is

--- Content provided by FirstRanker.com ---

called an inverter. The output is high when the input is low. The output is low when the input is high.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate

--- Content provided by FirstRanker.com ---

The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive

--- Content provided by FirstRanker.com ---

OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.



8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.

--- Content provided by FirstRanker.com ---

2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.

--- Content provided by FirstRanker.com ---

7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.

--- Content provided by FirstRanker.com ---

12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC

--- Content provided by FirstRanker.com ---

GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

The binary operator OR, AND is said to be commutative if,

--- Content provided by FirstRanker.com ---

1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

6. Complementary Law

1. A+A' = 1

--- Content provided by FirstRanker.com ---

2. A.A' = 0

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual

--- Content provided by FirstRanker.com ---

complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.

--- Content provided by FirstRanker.com ---

2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics

--- Content provided by FirstRanker.com ---

5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. EX-OR gate IC 7486 1
6. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The

--- Content provided by FirstRanker.com ---

three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1


Sl.No. Input Output
A B S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained

--- Content provided by FirstRanker.com ---

as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor

--- Content provided by FirstRanker.com ---

Truth table:


Sl.No.
Input Output

--- Content provided by FirstRanker.com ---

A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1

--- Content provided by FirstRanker.com ---

5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are

--- Content provided by FirstRanker.com ---

designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through
the full adder to the output carry C

--- Content provided by FirstRanker.com ---

4
.
4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input

--- Content provided by FirstRanker.com ---

?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

--- Content provided by FirstRanker.com ---

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

--- Content provided by FirstRanker.com ---

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:



24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was

--- Content provided by FirstRanker.com ---

verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction

--- Content provided by FirstRanker.com ---

A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.

--- Content provided by FirstRanker.com ---

3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?

--- Content provided by FirstRanker.com ---

8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?

--- Content provided by FirstRanker.com ---

13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.6: MAGNITUDE COMPARATOR

Aim:
To design, construct and study the performance of 2 bit magnitude comparator

--- Content provided by FirstRanker.com ---

Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by

--- Content provided by FirstRanker.com ---

three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:



Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0
0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 1
0 0 0 0
0 0 0 0
1 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 0 0 1
0 0 0 1
0 0 1

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.

--- Content provided by FirstRanker.com ---

5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.

--- Content provided by FirstRanker.com ---

10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to

--- Content provided by FirstRanker.com ---

binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert

--- Content provided by FirstRanker.com ---

from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is

--- Content provided by FirstRanker.com ---

C+D has been used to implement partially each of three outputs.



Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:


G3 = B3

--- Content provided by FirstRanker.com ---

K map for G2:

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x

0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0

1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

--- Content provided by FirstRanker.com ---

Result:
Thus the code converters were designed and verified using the corresponding truth table.

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.

--- Content provided by FirstRanker.com ---

1. What is binary code?
2. What is gray code?
3. What are the advantages of gray code?

--- Content provided by FirstRanker.com ---

4. What is unit distance code?
5. What is sequential code?
6. How to convert binary to gray code?
7. How to convert gray to binary code?
8. What is reflective code?

--- Content provided by FirstRanker.com ---

9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.
12. What is K ? Map?
13. Draw the truth table of EX- OR gate.

--- Content provided by FirstRanker.com ---

14. What is SOP?
15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different

--- Content provided by FirstRanker.com ---

levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative

--- Content provided by FirstRanker.com ---

Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental

--- Content provided by FirstRanker.com ---

concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.

--- Content provided by FirstRanker.com ---

e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.

--- Content provided by FirstRanker.com ---

i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:
? Understand the various logic gates.

--- Content provided by FirstRanker.com ---

? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:

--- Content provided by FirstRanker.com ---

1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor

--- Content provided by FirstRanker.com ---

b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers

--- Content provided by FirstRanker.com ---

b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:

--- Content provided by FirstRanker.com ---

? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates

--- Content provided by FirstRanker.com ---

2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.

--- Content provided by FirstRanker.com ---

Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and

--- Content provided by FirstRanker.com ---

MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.

--- Content provided by FirstRanker.com ---

9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.

--- Content provided by FirstRanker.com ---

Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

Aim:

--- Content provided by FirstRanker.com ---

To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate
The AND gate performs a logical multiplication commonly known as AND function. The

--- Content provided by FirstRanker.com ---

output is high when both the inputs are high. The output is low level when any one of the inputs is
low.
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.

--- Content provided by FirstRanker.com ---

NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low

--- Content provided by FirstRanker.com ---

and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate

--- Content provided by FirstRanker.com ---

An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?

--- Content provided by FirstRanker.com ---

5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.

--- Content provided by FirstRanker.com ---

10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?

--- Content provided by FirstRanker.com ---

15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

1. A+AB = A

--- Content provided by FirstRanker.com ---

2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.

--- Content provided by FirstRanker.com ---

A.B = A+B


Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.

--- Content provided by FirstRanker.com ---

3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?

--- Content provided by FirstRanker.com ---

3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower

--- Content provided by FirstRanker.com ---

significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output
A B C S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 1 1



17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the

--- Content provided by FirstRanker.com ---

subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the

--- Content provided by FirstRanker.com ---

difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

Difference, DIFF = A B

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be

--- Content provided by FirstRanker.com ---

constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0

--- Content provided by FirstRanker.com ---

and it ripples through
the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing

--- Content provided by FirstRanker.com ---

subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it

--- Content provided by FirstRanker.com ---

becomes subtractor.



23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.

--- Content provided by FirstRanker.com ---

Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.

--- Content provided by FirstRanker.com ---

6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?

--- Content provided by FirstRanker.com ---

11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less

--- Content provided by FirstRanker.com ---

than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 1 0
0 0 0 1
0 0 0 1
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
1 0 0
0 0 0 0
0 0 0 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?

--- Content provided by FirstRanker.com ---

3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?

--- Content provided by FirstRanker.com ---

8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:
To design, construct and study the performance of 4-bit different code converters

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two

--- Content provided by FirstRanker.com ---

systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is

--- Content provided by FirstRanker.com ---

designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-

--- Content provided by FirstRanker.com ---

level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:



B3=G3

--- Content provided by FirstRanker.com ---

K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

G3 G2 G1 G0 B3 B2 B1 B0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:


E3 = B3 + B2 (B0 + B1)

--- Content provided by FirstRanker.com ---

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1

1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table

--- Content provided by FirstRanker.com ---

3. Observe the logical output and verify with the truth tables.

Result:
Thus the code converters were designed and verified using the corresponding truth table.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.


1. What is binary code?

--- Content provided by FirstRanker.com ---

2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?
6. How to convert binary to gray code?

--- Content provided by FirstRanker.com ---

7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.

--- Content provided by FirstRanker.com ---

12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

--- Content provided by FirstRanker.com ---

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1
3 NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4 Connecting wires - Required


Theory:
Parity checking is used for error detection in data transmission.

--- Content provided by FirstRanker.com ---

Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

--- Content provided by FirstRanker.com ---

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

--- Content provided by FirstRanker.com ---

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.

--- Content provided by FirstRanker.com ---

Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________

--- Content provided by FirstRanker.com ---

Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics

--- Content provided by FirstRanker.com ---

Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.

--- Content provided by FirstRanker.com ---

? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of

--- Content provided by FirstRanker.com ---

engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.

--- Content provided by FirstRanker.com ---

d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.

--- Content provided by FirstRanker.com ---

h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:

--- Content provided by FirstRanker.com ---

? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL

--- Content provided by FirstRanker.com ---

List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:

--- Content provided by FirstRanker.com ---

a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:

--- Content provided by FirstRanker.com ---

a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.

--- Content provided by FirstRanker.com ---

? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.

--- Content provided by FirstRanker.com ---

Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.

--- Content provided by FirstRanker.com ---

Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI

--- Content provided by FirstRanker.com ---

Devices

7.
Design and Implementation of Magnitude Comparator.
8.

--- Content provided by FirstRanker.com ---

Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.

--- Content provided by FirstRanker.com ---

11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.

--- Content provided by FirstRanker.com ---

Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate

--- Content provided by FirstRanker.com ---

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.
OR gate
The OR gate performs a logical addition commonly known as OR function. The output is

--- Content provided by FirstRanker.com ---

high when any one of the inputs is high. The output is low level when both the inputs are low.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate

--- Content provided by FirstRanker.com ---

The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.

--- Content provided by FirstRanker.com ---

EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?

--- Content provided by FirstRanker.com ---

4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.

--- Content provided by FirstRanker.com ---

9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?

--- Content provided by FirstRanker.com ---

14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C

--- Content provided by FirstRanker.com ---

2. A.(B.C) = (A.B).C

3. Distributive Law

The binary operator OR, AND is said to be distributive if,

--- Content provided by FirstRanker.com ---

1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B

--- Content provided by FirstRanker.com ---

2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B


Design

--- Content provided by FirstRanker.com ---

1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc

--- Content provided by FirstRanker.com ---

.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.



1. What is Demorgan?s law?

--- Content provided by FirstRanker.com ---

2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is

--- Content provided by FirstRanker.com ---

performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1

--- Content provided by FirstRanker.com ---

5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit

--- Content provided by FirstRanker.com ---

is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input

--- Content provided by FirstRanker.com ---

variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be

--- Content provided by FirstRanker.com ---

implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:

--- Content provided by FirstRanker.com ---

To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C

--- Content provided by FirstRanker.com ---

0
and it ripples through
the full adder to the output carry C
4
.

--- Content provided by FirstRanker.com ---

4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0

--- Content provided by FirstRanker.com ---

must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary

--- Content provided by FirstRanker.com ---

adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.

--- Content provided by FirstRanker.com ---

.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0

--- Content provided by FirstRanker.com ---

1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1

--- Content provided by FirstRanker.com ---

1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1



25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.

--- Content provided by FirstRanker.com ---

5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.

--- Content provided by FirstRanker.com ---

10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2

--- Content provided by FirstRanker.com ---

6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:



29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Observe the output and verify the truth table.

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 1 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
1 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?

--- Content provided by FirstRanker.com ---

2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?

--- Content provided by FirstRanker.com ---

7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?

--- Content provided by FirstRanker.com ---

13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The availability of large variety of codes for the same discrete elements of information results in

--- Content provided by FirstRanker.com ---

the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0

--- Content provided by FirstRanker.com ---

and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the

--- Content provided by FirstRanker.com ---

four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter



34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

G3 G2 G1 G0 B3 B2 B1 B0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x

1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

BCD code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for A:


A = X1 X2 + X3 X4 X1

--- Content provided by FirstRanker.com ---

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1

1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

Result:
Thus the code converters were designed and verified using the corresponding truth table.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.

--- Content provided by FirstRanker.com ---

1. What is binary code?
2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?

--- Content provided by FirstRanker.com ---

6. How to convert binary to gray code?
7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?

--- Content provided by FirstRanker.com ---

11. Explain the operation of EX ? OR.
12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?

--- Content provided by FirstRanker.com ---

16. What is minterm?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

--- Content provided by FirstRanker.com ---

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1

--- Content provided by FirstRanker.com ---

3 NOT gate IC 7404 1
4 Connecting wires - Required


Theory:

--- Content provided by FirstRanker.com ---

Parity checking is used for error detection in data transmission.
Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

--- Content provided by FirstRanker.com ---

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

--- Content provided by FirstRanker.com ---

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits

--- Content provided by FirstRanker.com ---

which is an odd parity number.
Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5

--- Content provided by FirstRanker.com ---

bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

--- Content provided by FirstRanker.com ---

Input Checker output Generator output
A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110

--- Content provided by FirstRanker.com ---

0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001

--- Content provided by FirstRanker.com ---

1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011

--- Content provided by FirstRanker.com ---

1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

--- Content provided by FirstRanker.com ---

3. The corresponding outputs are noted.

4. The theoretical and practical values were verified.

Result:

--- Content provided by FirstRanker.com ---

The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker

--- Content provided by FirstRanker.com ---

using logic gates.

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________

--- Content provided by FirstRanker.com ---

Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on

--- Content provided by FirstRanker.com ---

heart and soul



DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to

--- Content provided by FirstRanker.com ---

professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals

--- Content provided by FirstRanker.com ---

To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new

--- Content provided by FirstRanker.com ---

technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall

--- Content provided by FirstRanker.com ---

development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good

--- Content provided by FirstRanker.com ---

professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.

--- Content provided by FirstRanker.com ---

c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.

--- Content provided by FirstRanker.com ---

g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.

--- Content provided by FirstRanker.com ---

k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:

--- Content provided by FirstRanker.com ---

The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits

--- Content provided by FirstRanker.com ---

? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.

--- Content provided by FirstRanker.com ---

3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers

--- Content provided by FirstRanker.com ---

4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.

--- Content provided by FirstRanker.com ---

? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor

--- Content provided by FirstRanker.com ---

5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.

--- Content provided by FirstRanker.com ---

Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.
Design and Implementation of Magnitude Comparator.

--- Content provided by FirstRanker.com ---

8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.

--- Content provided by FirstRanker.com ---

Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.

--- Content provided by FirstRanker.com ---

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.
OR gate

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.

--- Content provided by FirstRanker.com ---

NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The

--- Content provided by FirstRanker.com ---

output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.

--- Content provided by FirstRanker.com ---

3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.

--- Content provided by FirstRanker.com ---

8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?

--- Content provided by FirstRanker.com ---

13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A

--- Content provided by FirstRanker.com ---

2. A.B=B.A

2. Associative Law

The binary operator OR, AND is said to be associative if,

--- Content provided by FirstRanker.com ---

1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.

--- Content provided by FirstRanker.com ---

A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law

--- Content provided by FirstRanker.com ---

A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V

--- Content provided by FirstRanker.com ---

cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

S. No. Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required


Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four

--- Content provided by FirstRanker.com ---

possible elementary operations, namely,

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables

--- Content provided by FirstRanker.com ---

designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented

--- Content provided by FirstRanker.com ---

with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC



16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:



18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 V supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The

--- Content provided by FirstRanker.com ---

three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The

--- Content provided by FirstRanker.com ---

carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through
the full adder to the output carry C
4

--- Content provided by FirstRanker.com ---

.
4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C

--- Content provided by FirstRanker.com ---

0
must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

--- Content provided by FirstRanker.com ---

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

--- Content provided by FirstRanker.com ---

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1

--- Content provided by FirstRanker.com ---

1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1

--- Content provided by FirstRanker.com ---

1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.

--- Content provided by FirstRanker.com ---

4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.

--- Content provided by FirstRanker.com ---

9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?

--- Content provided by FirstRanker.com ---

14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.6: MAGNITUDE COMPARATOR

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude

--- Content provided by FirstRanker.com ---

comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 0 0 0
0 1 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 0
0 0 0 0
1 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 1
0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.

--- Content provided by FirstRanker.com ---

6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.

--- Content provided by FirstRanker.com ---

12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to BCD code converter

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2

--- Content provided by FirstRanker.com ---

6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs

--- Content provided by FirstRanker.com ---

and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as

--- Content provided by FirstRanker.com ---

specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:


G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

K map for B1:



K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x



38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

BCD code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for A:


A = X1 X2 + X3 X4 X1

--- Content provided by FirstRanker.com ---

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Procedure:

--- Content provided by FirstRanker.com ---

1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

Result:

--- Content provided by FirstRanker.com ---

Thus the code converters were designed and verified using the corresponding truth table.

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.

--- Content provided by FirstRanker.com ---

1. What is binary code?
2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?

--- Content provided by FirstRanker.com ---

5. What is sequential code?
6. How to convert binary to gray code?
7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?

--- Content provided by FirstRanker.com ---

10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.
12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?

--- Content provided by FirstRanker.com ---

15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.8: PARITY GENERATORS AND CHECKERS

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Component Type Quantity
1 Trainer Kit - 1

--- Content provided by FirstRanker.com ---

2 EX-OR IC7486 1
3 NOT gate IC 7404 1
4 Connecting wires - Required

--- Content provided by FirstRanker.com ---

Theory:
Parity checking is used for error detection in data transmission.
Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is

--- Content provided by FirstRanker.com ---

odd.

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is

--- Content provided by FirstRanker.com ---

even.

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also

--- Content provided by FirstRanker.com ---

the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.
Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and

--- Content provided by FirstRanker.com ---

also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

--- Content provided by FirstRanker.com ---

Input Checker output Generator output
A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101

--- Content provided by FirstRanker.com ---

0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111

--- Content provided by FirstRanker.com ---

1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000

--- Content provided by FirstRanker.com ---

1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

--- Content provided by FirstRanker.com ---

3. The corresponding outputs are noted.

4. The theoretical and practical values were verified.

--- Content provided by FirstRanker.com ---

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

2. Why parity bit is added to message?

--- Content provided by FirstRanker.com ---

3. What is parity checker?

4. What is odd parity?
5. What is even parity?

--- Content provided by FirstRanker.com ---

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?

--- Content provided by FirstRanker.com ---

11. What is ASCII code?
12. What is hamming code?
13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation

--- Content provided by FirstRanker.com ---

16. List the procedures to convert binary code into gray
17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice



1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and

--- Content provided by FirstRanker.com ---

enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s

--- Content provided by FirstRanker.com ---

needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the

--- Content provided by FirstRanker.com ---

industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism

--- Content provided by FirstRanker.com ---

To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics

--- Content provided by FirstRanker.com ---

To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.

--- Content provided by FirstRanker.com ---

f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also

--- Content provided by FirstRanker.com ---

will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.

--- Content provided by FirstRanker.com ---

? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.

--- Content provided by FirstRanker.com ---

2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker

--- Content provided by FirstRanker.com ---

c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters

--- Content provided by FirstRanker.com ---

5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.

--- Content provided by FirstRanker.com ---

? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.

--- Content provided by FirstRanker.com ---

Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.
Implementation of half adder and full adder

--- Content provided by FirstRanker.com ---

4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.

--- Content provided by FirstRanker.com ---

Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog

--- Content provided by FirstRanker.com ---

HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:
Circuit that takes the logical decision and the process are called logic gates. Each gate has one or

--- Content provided by FirstRanker.com ---

more input and only one output. OR, AND and NOT are basic gates. NAND, NOR and X-OR are known as
universal gates. Basic gates form these 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

--- Content provided by FirstRanker.com ---

low.
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.
NOT gate

--- Content provided by FirstRanker.com ---

A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.

--- Content provided by FirstRanker.com ---

NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is

--- Content provided by FirstRanker.com ---

similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

1. Connections are given as per the circuit diagram.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

At the completion of an experiment student will able to verify the truth

--- Content provided by FirstRanker.com ---

table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?

--- Content provided by FirstRanker.com ---

6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.

--- Content provided by FirstRanker.com ---

11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?

--- Content provided by FirstRanker.com ---

16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:

--- Content provided by FirstRanker.com ---

1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.

--- Content provided by FirstRanker.com ---

4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?

--- Content provided by FirstRanker.com ---

4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.

--- Content provided by FirstRanker.com ---

Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,

--- Content provided by FirstRanker.com ---

S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 1
8. 1 1 1 1 1


Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the

--- Content provided by FirstRanker.com ---

full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.

--- Content provided by FirstRanker.com ---

Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:


Sl.No.

--- Content provided by FirstRanker.com ---

Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to

--- Content provided by FirstRanker.com ---

the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through

--- Content provided by FirstRanker.com ---

the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.

--- Content provided by FirstRanker.com ---

4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:

--- Content provided by FirstRanker.com ---

The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?

--- Content provided by FirstRanker.com ---

2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.

--- Content provided by FirstRanker.com ---

7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?

--- Content provided by FirstRanker.com ---

12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two

--- Content provided by FirstRanker.com ---

numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 1 0
0 0 0 1
0 0 0 1
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

1 0 0
0 0 0 0
0 0 0 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.

--- Content provided by FirstRanker.com ---

4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.

--- Content provided by FirstRanker.com ---

9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION



31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the

--- Content provided by FirstRanker.com ---

two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a

--- Content provided by FirstRanker.com ---

circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are

--- Content provided by FirstRanker.com ---

various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:



32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:



33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G0:



Truth table:

--- Content provided by FirstRanker.com ---

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:



K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:


E3 = B3 + B2 (B0 + B1)

--- Content provided by FirstRanker.com ---

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x

1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1

1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

--- Content provided by FirstRanker.com ---

Result:
Thus the code converters were designed and verified using the corresponding truth table.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the binary to gray converter.


1. What is binary code?
2. What is gray code?

--- Content provided by FirstRanker.com ---

3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?
6. How to convert binary to gray code?
7. How to convert gray to binary code?

--- Content provided by FirstRanker.com ---

8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.
12. What is K ? Map?

--- Content provided by FirstRanker.com ---

13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

Aim:

--- Content provided by FirstRanker.com ---

To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1
3 NOT gate IC 7404 1
4 Connecting wires - Required

--- Content provided by FirstRanker.com ---

Theory:
Parity checking is used for error detection in data transmission.
Odd parity checkers:

--- Content provided by FirstRanker.com ---

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

Even parity checker:

--- Content provided by FirstRanker.com ---

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

Odd parity generators:

--- Content provided by FirstRanker.com ---

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.
Even parity generator:

--- Content provided by FirstRanker.com ---

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

Input Checker output Generator output
A B C D D odd even odd even

--- Content provided by FirstRanker.com ---

0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010

--- Content provided by FirstRanker.com ---

0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100

--- Content provided by FirstRanker.com ---

1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

--- Content provided by FirstRanker.com ---

2. The inputs are given as per the truth table.

3. The corresponding outputs are noted.

--- Content provided by FirstRanker.com ---

4. The theoretical and practical values were verified.

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

--- Content provided by FirstRanker.com ---

2. Why parity bit is added to message?

3. What is parity checker?

4. What is odd parity?

--- Content provided by FirstRanker.com ---

5. What is even parity?

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?

--- Content provided by FirstRanker.com ---

9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?
12. What is hamming code?
13. List the binary weighted code.

--- Content provided by FirstRanker.com ---

14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray
17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2

--- Content provided by FirstRanker.com ---

n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be

--- Content provided by FirstRanker.com ---

selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of

--- Content provided by FirstRanker.com ---

2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-

--- Content provided by FirstRanker.com ---

active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________

--- Content provided by FirstRanker.com ---

Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on

--- Content provided by FirstRanker.com ---

heart and soul



DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to

--- Content provided by FirstRanker.com ---

professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals

--- Content provided by FirstRanker.com ---

To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new

--- Content provided by FirstRanker.com ---

technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall

--- Content provided by FirstRanker.com ---

development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good

--- Content provided by FirstRanker.com ---

professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.

--- Content provided by FirstRanker.com ---

c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.

--- Content provided by FirstRanker.com ---

g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.

--- Content provided by FirstRanker.com ---

k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:

--- Content provided by FirstRanker.com ---

The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits

--- Content provided by FirstRanker.com ---

? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.

--- Content provided by FirstRanker.com ---

3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers

--- Content provided by FirstRanker.com ---

4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.

--- Content provided by FirstRanker.com ---

? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor

--- Content provided by FirstRanker.com ---

5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.

--- Content provided by FirstRanker.com ---

Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.
Design and Implementation of Magnitude Comparator.

--- Content provided by FirstRanker.com ---

8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.

--- Content provided by FirstRanker.com ---

Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.

--- Content provided by FirstRanker.com ---

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.
OR gate

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.

--- Content provided by FirstRanker.com ---

NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The

--- Content provided by FirstRanker.com ---

output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.

--- Content provided by FirstRanker.com ---

3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.

--- Content provided by FirstRanker.com ---

8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?

--- Content provided by FirstRanker.com ---

13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A

--- Content provided by FirstRanker.com ---

2. A.B=B.A

2. Associative Law

The binary operator OR, AND is said to be associative if,

--- Content provided by FirstRanker.com ---

1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.

--- Content provided by FirstRanker.com ---

A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law

--- Content provided by FirstRanker.com ---

A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V

--- Content provided by FirstRanker.com ---

cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

S. No. Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required


Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four

--- Content provided by FirstRanker.com ---

possible elementary operations, namely,

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables

--- Content provided by FirstRanker.com ---

designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented

--- Content provided by FirstRanker.com ---

with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC



16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:



18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 V supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The

--- Content provided by FirstRanker.com ---

three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The

--- Content provided by FirstRanker.com ---

carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through
the full adder to the output carry C
4

--- Content provided by FirstRanker.com ---

.
4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C

--- Content provided by FirstRanker.com ---

0
must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

--- Content provided by FirstRanker.com ---

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

--- Content provided by FirstRanker.com ---

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1

--- Content provided by FirstRanker.com ---

1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1

--- Content provided by FirstRanker.com ---

1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.

--- Content provided by FirstRanker.com ---

4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.

--- Content provided by FirstRanker.com ---

9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?

--- Content provided by FirstRanker.com ---

14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.6: MAGNITUDE COMPARATOR

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude

--- Content provided by FirstRanker.com ---

comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 0 0 0
0 1 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 0
0 0 0 0
1 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 1
0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.

--- Content provided by FirstRanker.com ---

6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.

--- Content provided by FirstRanker.com ---

12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to BCD code converter

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2

--- Content provided by FirstRanker.com ---

6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs

--- Content provided by FirstRanker.com ---

and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as

--- Content provided by FirstRanker.com ---

specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:


G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

K map for B1:



K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x



38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

BCD code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for A:


A = X1 X2 + X3 X4 X1

--- Content provided by FirstRanker.com ---

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Procedure:

--- Content provided by FirstRanker.com ---

1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

Result:

--- Content provided by FirstRanker.com ---

Thus the code converters were designed and verified using the corresponding truth table.

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.

--- Content provided by FirstRanker.com ---

1. What is binary code?
2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?

--- Content provided by FirstRanker.com ---

5. What is sequential code?
6. How to convert binary to gray code?
7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?

--- Content provided by FirstRanker.com ---

10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.
12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?

--- Content provided by FirstRanker.com ---

15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.8: PARITY GENERATORS AND CHECKERS

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Component Type Quantity
1 Trainer Kit - 1

--- Content provided by FirstRanker.com ---

2 EX-OR IC7486 1
3 NOT gate IC 7404 1
4 Connecting wires - Required

--- Content provided by FirstRanker.com ---

Theory:
Parity checking is used for error detection in data transmission.
Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is

--- Content provided by FirstRanker.com ---

odd.

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is

--- Content provided by FirstRanker.com ---

even.

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also

--- Content provided by FirstRanker.com ---

the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.
Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and

--- Content provided by FirstRanker.com ---

also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

--- Content provided by FirstRanker.com ---

Input Checker output Generator output
A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101

--- Content provided by FirstRanker.com ---

0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111

--- Content provided by FirstRanker.com ---

1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000

--- Content provided by FirstRanker.com ---

1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

--- Content provided by FirstRanker.com ---

3. The corresponding outputs are noted.

4. The theoretical and practical values were verified.

--- Content provided by FirstRanker.com ---

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

2. Why parity bit is added to message?

--- Content provided by FirstRanker.com ---

3. What is parity checker?

4. What is odd parity?
5. What is even parity?

--- Content provided by FirstRanker.com ---

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?

--- Content provided by FirstRanker.com ---

11. What is ASCII code?
12. What is hamming code?
13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation

--- Content provided by FirstRanker.com ---

16. List the procedures to convert binary code into gray
17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or

--- Content provided by FirstRanker.com ---

lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines

--- Content provided by FirstRanker.com ---

which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is

--- Content provided by FirstRanker.com ---

used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n

--- Content provided by FirstRanker.com ---

possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4 X 1 MULTIPLEXER

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________

--- Content provided by FirstRanker.com ---

Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics

--- Content provided by FirstRanker.com ---

Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.

--- Content provided by FirstRanker.com ---

? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of

--- Content provided by FirstRanker.com ---

engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.

--- Content provided by FirstRanker.com ---

d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.

--- Content provided by FirstRanker.com ---

h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:

--- Content provided by FirstRanker.com ---

? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL

--- Content provided by FirstRanker.com ---

List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:

--- Content provided by FirstRanker.com ---

a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:

--- Content provided by FirstRanker.com ---

a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.

--- Content provided by FirstRanker.com ---

? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.

--- Content provided by FirstRanker.com ---

Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.

--- Content provided by FirstRanker.com ---

Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI

--- Content provided by FirstRanker.com ---

Devices

7.
Design and Implementation of Magnitude Comparator.
8.

--- Content provided by FirstRanker.com ---

Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.

--- Content provided by FirstRanker.com ---

11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.

--- Content provided by FirstRanker.com ---

Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate

--- Content provided by FirstRanker.com ---

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.
OR gate
The OR gate performs a logical addition commonly known as OR function. The output is

--- Content provided by FirstRanker.com ---

high when any one of the inputs is high. The output is low level when both the inputs are low.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate

--- Content provided by FirstRanker.com ---

The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.

--- Content provided by FirstRanker.com ---

EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?

--- Content provided by FirstRanker.com ---

4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.

--- Content provided by FirstRanker.com ---

9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?

--- Content provided by FirstRanker.com ---

14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C

--- Content provided by FirstRanker.com ---

2. A.(B.C) = (A.B).C

3. Distributive Law

The binary operator OR, AND is said to be distributive if,

--- Content provided by FirstRanker.com ---

1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B

--- Content provided by FirstRanker.com ---

2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B


Design

--- Content provided by FirstRanker.com ---

1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc

--- Content provided by FirstRanker.com ---

.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.



1. What is Demorgan?s law?

--- Content provided by FirstRanker.com ---

2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is

--- Content provided by FirstRanker.com ---

performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1

--- Content provided by FirstRanker.com ---

5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit

--- Content provided by FirstRanker.com ---

is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input

--- Content provided by FirstRanker.com ---

variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be

--- Content provided by FirstRanker.com ---

implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:

--- Content provided by FirstRanker.com ---

To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C

--- Content provided by FirstRanker.com ---

0
and it ripples through
the full adder to the output carry C
4
.

--- Content provided by FirstRanker.com ---

4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0

--- Content provided by FirstRanker.com ---

must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary

--- Content provided by FirstRanker.com ---

adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.

--- Content provided by FirstRanker.com ---

.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0

--- Content provided by FirstRanker.com ---

1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1

--- Content provided by FirstRanker.com ---

1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1



25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.

--- Content provided by FirstRanker.com ---

5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.

--- Content provided by FirstRanker.com ---

10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2

--- Content provided by FirstRanker.com ---

6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:



29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Observe the output and verify the truth table.

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 1 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
1 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?

--- Content provided by FirstRanker.com ---

2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?

--- Content provided by FirstRanker.com ---

7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?

--- Content provided by FirstRanker.com ---

13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The availability of large variety of codes for the same discrete elements of information results in

--- Content provided by FirstRanker.com ---

the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0

--- Content provided by FirstRanker.com ---

and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the

--- Content provided by FirstRanker.com ---

four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter



34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

G3 G2 G1 G0 B3 B2 B1 B0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x

1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

BCD code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for A:


A = X1 X2 + X3 X4 X1

--- Content provided by FirstRanker.com ---

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1

1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

Result:
Thus the code converters were designed and verified using the corresponding truth table.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.

--- Content provided by FirstRanker.com ---

1. What is binary code?
2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?

--- Content provided by FirstRanker.com ---

6. How to convert binary to gray code?
7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?

--- Content provided by FirstRanker.com ---

11. Explain the operation of EX ? OR.
12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?

--- Content provided by FirstRanker.com ---

16. What is minterm?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

--- Content provided by FirstRanker.com ---

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1

--- Content provided by FirstRanker.com ---

3 NOT gate IC 7404 1
4 Connecting wires - Required


Theory:

--- Content provided by FirstRanker.com ---

Parity checking is used for error detection in data transmission.
Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

--- Content provided by FirstRanker.com ---

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

--- Content provided by FirstRanker.com ---

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits

--- Content provided by FirstRanker.com ---

which is an odd parity number.
Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5

--- Content provided by FirstRanker.com ---

bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

--- Content provided by FirstRanker.com ---

Input Checker output Generator output
A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110

--- Content provided by FirstRanker.com ---

0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001

--- Content provided by FirstRanker.com ---

1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011

--- Content provided by FirstRanker.com ---

1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

--- Content provided by FirstRanker.com ---

3. The corresponding outputs are noted.

4. The theoretical and practical values were verified.

Result:

--- Content provided by FirstRanker.com ---

The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker

--- Content provided by FirstRanker.com ---

using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

2. Why parity bit is added to message?

3. What is parity checker?

--- Content provided by FirstRanker.com ---

4. What is odd parity?
5. What is even parity?

6. What are the gates involved for parity generator?

--- Content provided by FirstRanker.com ---

7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?

--- Content provided by FirstRanker.com ---

12. What is hamming code?
13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray

--- Content provided by FirstRanker.com ---

17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input

--- Content provided by FirstRanker.com ---

lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and

--- Content provided by FirstRanker.com ---

steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful

--- Content provided by FirstRanker.com ---

for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection

--- Content provided by FirstRanker.com ---

lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4 X 1 MULTIPLEXER

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different

--- Content provided by FirstRanker.com ---

levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative

--- Content provided by FirstRanker.com ---

Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental

--- Content provided by FirstRanker.com ---

concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.

--- Content provided by FirstRanker.com ---

e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.

--- Content provided by FirstRanker.com ---

i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:
? Understand the various logic gates.

--- Content provided by FirstRanker.com ---

? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:

--- Content provided by FirstRanker.com ---

1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor

--- Content provided by FirstRanker.com ---

b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers

--- Content provided by FirstRanker.com ---

b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:

--- Content provided by FirstRanker.com ---

? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates

--- Content provided by FirstRanker.com ---

2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.

--- Content provided by FirstRanker.com ---

Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and

--- Content provided by FirstRanker.com ---

MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.

--- Content provided by FirstRanker.com ---

9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.

--- Content provided by FirstRanker.com ---

Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

Aim:

--- Content provided by FirstRanker.com ---

To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate
The AND gate performs a logical multiplication commonly known as AND function. The

--- Content provided by FirstRanker.com ---

output is high when both the inputs are high. The output is low level when any one of the inputs is
low.
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.

--- Content provided by FirstRanker.com ---

NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low

--- Content provided by FirstRanker.com ---

and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate

--- Content provided by FirstRanker.com ---

An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?

--- Content provided by FirstRanker.com ---

5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.

--- Content provided by FirstRanker.com ---

10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?

--- Content provided by FirstRanker.com ---

15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

1. A+AB = A

--- Content provided by FirstRanker.com ---

2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.

--- Content provided by FirstRanker.com ---

A.B = A+B


Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.

--- Content provided by FirstRanker.com ---

3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?

--- Content provided by FirstRanker.com ---

3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower

--- Content provided by FirstRanker.com ---

significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output
A B C S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 1 1



17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the

--- Content provided by FirstRanker.com ---

subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the

--- Content provided by FirstRanker.com ---

difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

Difference, DIFF = A B

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be

--- Content provided by FirstRanker.com ---

constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0

--- Content provided by FirstRanker.com ---

and it ripples through
the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing

--- Content provided by FirstRanker.com ---

subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it

--- Content provided by FirstRanker.com ---

becomes subtractor.



23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.

--- Content provided by FirstRanker.com ---

Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.

--- Content provided by FirstRanker.com ---

6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?

--- Content provided by FirstRanker.com ---

11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less

--- Content provided by FirstRanker.com ---

than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 1 0
0 0 0 1
0 0 0 1
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
1 0 0
0 0 0 0
0 0 0 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?

--- Content provided by FirstRanker.com ---

3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?

--- Content provided by FirstRanker.com ---

8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:
To design, construct and study the performance of 4-bit different code converters

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two

--- Content provided by FirstRanker.com ---

systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is

--- Content provided by FirstRanker.com ---

designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-

--- Content provided by FirstRanker.com ---

level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:



B3=G3

--- Content provided by FirstRanker.com ---

K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

G3 G2 G1 G0 B3 B2 B1 B0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:


E3 = B3 + B2 (B0 + B1)

--- Content provided by FirstRanker.com ---

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1

1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table

--- Content provided by FirstRanker.com ---

3. Observe the logical output and verify with the truth tables.

Result:
Thus the code converters were designed and verified using the corresponding truth table.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.


1. What is binary code?

--- Content provided by FirstRanker.com ---

2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?
6. How to convert binary to gray code?

--- Content provided by FirstRanker.com ---

7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.

--- Content provided by FirstRanker.com ---

12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

--- Content provided by FirstRanker.com ---

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1
3 NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4 Connecting wires - Required


Theory:
Parity checking is used for error detection in data transmission.

--- Content provided by FirstRanker.com ---

Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

--- Content provided by FirstRanker.com ---

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

--- Content provided by FirstRanker.com ---

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.

--- Content provided by FirstRanker.com ---

Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

Input Checker output Generator output

--- Content provided by FirstRanker.com ---

A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001

--- Content provided by FirstRanker.com ---

0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010

--- Content provided by FirstRanker.com ---

1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101

--- Content provided by FirstRanker.com ---

1 1 1 1 0 1 11111 11110



Procedure:

--- Content provided by FirstRanker.com ---

1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

3. The corresponding outputs are noted.

--- Content provided by FirstRanker.com ---

4. The theoretical and practical values were verified.

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and

--- Content provided by FirstRanker.com ---

even parity numbers are generated using the corresponding generators.

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



1. What is parity bit?

--- Content provided by FirstRanker.com ---

2. Why parity bit is added to message?

3. What is parity checker?

--- Content provided by FirstRanker.com ---

4. What is odd parity?
5. What is even parity?

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.

--- Content provided by FirstRanker.com ---

8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?
12. What is hamming code?

--- Content provided by FirstRanker.com ---

13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray
17. What are the applications of gray code?

--- Content provided by FirstRanker.com ---

18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

Sl. No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of

--- Content provided by FirstRanker.com ---

selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all

--- Content provided by FirstRanker.com ---

output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A

--- Content provided by FirstRanker.com ---

Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an

--- Content provided by FirstRanker.com ---

enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

4 X 1 MULTIPLEXER

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?
2. What is demultiplexer?

--- Content provided by FirstRanker.com ---

3. What are the advantages of multiplexer?
4. What are the advantages of demultiplexer?
5. What is select signal?
6. How to choose select signal in multiplexer?
7. How to choose select signal in demultiplexer?

--- Content provided by FirstRanker.com ---

8. Write the formula used in select signal.
9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?
11. What is the application of demultiplexer?
12. Draw the truth table of multiplexer.

--- Content provided by FirstRanker.com ---

13. Draw the truth table of demultiplexer.
14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________

--- Content provided by FirstRanker.com ---

Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on

--- Content provided by FirstRanker.com ---

heart and soul



DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to

--- Content provided by FirstRanker.com ---

professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals

--- Content provided by FirstRanker.com ---

To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new

--- Content provided by FirstRanker.com ---

technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall

--- Content provided by FirstRanker.com ---

development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good

--- Content provided by FirstRanker.com ---

professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.

--- Content provided by FirstRanker.com ---

c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.

--- Content provided by FirstRanker.com ---

g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.

--- Content provided by FirstRanker.com ---

k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:

--- Content provided by FirstRanker.com ---

The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits

--- Content provided by FirstRanker.com ---

? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.

--- Content provided by FirstRanker.com ---

3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers

--- Content provided by FirstRanker.com ---

4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.

--- Content provided by FirstRanker.com ---

? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor

--- Content provided by FirstRanker.com ---

5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.

--- Content provided by FirstRanker.com ---

Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.
Design and Implementation of Magnitude Comparator.

--- Content provided by FirstRanker.com ---

8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.

--- Content provided by FirstRanker.com ---

Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.

--- Content provided by FirstRanker.com ---

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.
OR gate

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.

--- Content provided by FirstRanker.com ---

NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The

--- Content provided by FirstRanker.com ---

output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.

--- Content provided by FirstRanker.com ---

3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.

--- Content provided by FirstRanker.com ---

8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?

--- Content provided by FirstRanker.com ---

13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A

--- Content provided by FirstRanker.com ---

2. A.B=B.A

2. Associative Law

The binary operator OR, AND is said to be associative if,

--- Content provided by FirstRanker.com ---

1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.

--- Content provided by FirstRanker.com ---

A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law

--- Content provided by FirstRanker.com ---

A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V

--- Content provided by FirstRanker.com ---

cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

S. No. Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required


Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four

--- Content provided by FirstRanker.com ---

possible elementary operations, namely,

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables

--- Content provided by FirstRanker.com ---

designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented

--- Content provided by FirstRanker.com ---

with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC



16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:



18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 V supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The

--- Content provided by FirstRanker.com ---

three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The

--- Content provided by FirstRanker.com ---

carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through
the full adder to the output carry C
4

--- Content provided by FirstRanker.com ---

.
4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C

--- Content provided by FirstRanker.com ---

0
must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

--- Content provided by FirstRanker.com ---

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

--- Content provided by FirstRanker.com ---

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1

--- Content provided by FirstRanker.com ---

1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1

--- Content provided by FirstRanker.com ---

1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.

--- Content provided by FirstRanker.com ---

4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.

--- Content provided by FirstRanker.com ---

9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?

--- Content provided by FirstRanker.com ---

14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.6: MAGNITUDE COMPARATOR

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude

--- Content provided by FirstRanker.com ---

comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 0 0 0
0 1 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 0
0 0 0 0
1 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 1
0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.

--- Content provided by FirstRanker.com ---

6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.

--- Content provided by FirstRanker.com ---

12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to BCD code converter

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2

--- Content provided by FirstRanker.com ---

6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs

--- Content provided by FirstRanker.com ---

and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as

--- Content provided by FirstRanker.com ---

specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:


G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

K map for B1:



K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x



38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

BCD code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for A:


A = X1 X2 + X3 X4 X1

--- Content provided by FirstRanker.com ---

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Procedure:

--- Content provided by FirstRanker.com ---

1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

Result:

--- Content provided by FirstRanker.com ---

Thus the code converters were designed and verified using the corresponding truth table.

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.

--- Content provided by FirstRanker.com ---

1. What is binary code?
2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?

--- Content provided by FirstRanker.com ---

5. What is sequential code?
6. How to convert binary to gray code?
7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?

--- Content provided by FirstRanker.com ---

10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.
12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?

--- Content provided by FirstRanker.com ---

15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.8: PARITY GENERATORS AND CHECKERS

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Component Type Quantity
1 Trainer Kit - 1

--- Content provided by FirstRanker.com ---

2 EX-OR IC7486 1
3 NOT gate IC 7404 1
4 Connecting wires - Required

--- Content provided by FirstRanker.com ---

Theory:
Parity checking is used for error detection in data transmission.
Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is

--- Content provided by FirstRanker.com ---

odd.

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is

--- Content provided by FirstRanker.com ---

even.

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also

--- Content provided by FirstRanker.com ---

the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.
Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and

--- Content provided by FirstRanker.com ---

also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

--- Content provided by FirstRanker.com ---

Input Checker output Generator output
A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101

--- Content provided by FirstRanker.com ---

0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111

--- Content provided by FirstRanker.com ---

1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000

--- Content provided by FirstRanker.com ---

1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

--- Content provided by FirstRanker.com ---

3. The corresponding outputs are noted.

4. The theoretical and practical values were verified.

--- Content provided by FirstRanker.com ---

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

2. Why parity bit is added to message?

--- Content provided by FirstRanker.com ---

3. What is parity checker?

4. What is odd parity?
5. What is even parity?

--- Content provided by FirstRanker.com ---

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?

--- Content provided by FirstRanker.com ---

11. What is ASCII code?
12. What is hamming code?
13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation

--- Content provided by FirstRanker.com ---

16. List the procedures to convert binary code into gray
17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or

--- Content provided by FirstRanker.com ---

lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines

--- Content provided by FirstRanker.com ---

which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is

--- Content provided by FirstRanker.com ---

used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n

--- Content provided by FirstRanker.com ---

possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4 X 1 MULTIPLEXER

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables

--- Content provided by FirstRanker.com ---

were verified.

Outcome:
At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is multiplexer?
2. What is demultiplexer?
3. What are the advantages of multiplexer?
4. What are the advantages of demultiplexer?
5. What is select signal?

--- Content provided by FirstRanker.com ---

6. How to choose select signal in multiplexer?
7. How to choose select signal in demultiplexer?
8. Write the formula used in select signal.
9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?

--- Content provided by FirstRanker.com ---

11. What is the application of demultiplexer?
12. Draw the truth table of multiplexer.
13. Draw the truth table of demultiplexer.
14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

EXP NO: 11 SHIFT REGISTER

Aim:

To design and implement the various shift register

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2

--- Content provided by FirstRanker.com ---

2. OR gate IC 7432 1
3. IC Trainer kit 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

A register is capable of shifting its binary information in one or both directions is
known as shift register. The logical configuration of shift register consist of a D-Flip flop
cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible

--- Content provided by FirstRanker.com ---

shift register is one that uses only flip flop. The output of a given flip flop is connected to the
input of next flip flop of the register. Each clock pulse shifts the content of register one bit position
to right.
PIN Diagram:

--- Content provided by FirstRanker.com ---

Logic Diagram:
SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different

--- Content provided by FirstRanker.com ---

levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative

--- Content provided by FirstRanker.com ---

Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental

--- Content provided by FirstRanker.com ---

concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.

--- Content provided by FirstRanker.com ---

e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.

--- Content provided by FirstRanker.com ---

i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:
? Understand the various logic gates.

--- Content provided by FirstRanker.com ---

? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:

--- Content provided by FirstRanker.com ---

1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor

--- Content provided by FirstRanker.com ---

b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers

--- Content provided by FirstRanker.com ---

b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:

--- Content provided by FirstRanker.com ---

? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates

--- Content provided by FirstRanker.com ---

2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.

--- Content provided by FirstRanker.com ---

Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and

--- Content provided by FirstRanker.com ---

MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.

--- Content provided by FirstRanker.com ---

9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.

--- Content provided by FirstRanker.com ---

Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

Aim:

--- Content provided by FirstRanker.com ---

To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate
The AND gate performs a logical multiplication commonly known as AND function. The

--- Content provided by FirstRanker.com ---

output is high when both the inputs are high. The output is low level when any one of the inputs is
low.
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.

--- Content provided by FirstRanker.com ---

NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low

--- Content provided by FirstRanker.com ---

and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate

--- Content provided by FirstRanker.com ---

An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?

--- Content provided by FirstRanker.com ---

5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.

--- Content provided by FirstRanker.com ---

10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?

--- Content provided by FirstRanker.com ---

15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

1. A+AB = A

--- Content provided by FirstRanker.com ---

2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.

--- Content provided by FirstRanker.com ---

A.B = A+B


Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.

--- Content provided by FirstRanker.com ---

3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?

--- Content provided by FirstRanker.com ---

3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower

--- Content provided by FirstRanker.com ---

significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output
A B C S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 1 1



17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the

--- Content provided by FirstRanker.com ---

subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the

--- Content provided by FirstRanker.com ---

difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

Difference, DIFF = A B

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be

--- Content provided by FirstRanker.com ---

constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0

--- Content provided by FirstRanker.com ---

and it ripples through
the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing

--- Content provided by FirstRanker.com ---

subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it

--- Content provided by FirstRanker.com ---

becomes subtractor.



23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.

--- Content provided by FirstRanker.com ---

Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.

--- Content provided by FirstRanker.com ---

6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?

--- Content provided by FirstRanker.com ---

11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less

--- Content provided by FirstRanker.com ---

than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 1 0
0 0 0 1
0 0 0 1
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
1 0 0
0 0 0 0
0 0 0 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?

--- Content provided by FirstRanker.com ---

3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?

--- Content provided by FirstRanker.com ---

8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:
To design, construct and study the performance of 4-bit different code converters

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two

--- Content provided by FirstRanker.com ---

systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is

--- Content provided by FirstRanker.com ---

designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-

--- Content provided by FirstRanker.com ---

level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:



B3=G3

--- Content provided by FirstRanker.com ---

K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

G3 G2 G1 G0 B3 B2 B1 B0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:


E3 = B3 + B2 (B0 + B1)

--- Content provided by FirstRanker.com ---

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1

1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table

--- Content provided by FirstRanker.com ---

3. Observe the logical output and verify with the truth tables.

Result:
Thus the code converters were designed and verified using the corresponding truth table.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.


1. What is binary code?

--- Content provided by FirstRanker.com ---

2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?
6. How to convert binary to gray code?

--- Content provided by FirstRanker.com ---

7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.

--- Content provided by FirstRanker.com ---

12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

--- Content provided by FirstRanker.com ---

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1
3 NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4 Connecting wires - Required


Theory:
Parity checking is used for error detection in data transmission.

--- Content provided by FirstRanker.com ---

Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

--- Content provided by FirstRanker.com ---

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

--- Content provided by FirstRanker.com ---

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.

--- Content provided by FirstRanker.com ---

Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

Input Checker output Generator output

--- Content provided by FirstRanker.com ---

A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001

--- Content provided by FirstRanker.com ---

0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010

--- Content provided by FirstRanker.com ---

1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101

--- Content provided by FirstRanker.com ---

1 1 1 1 0 1 11111 11110



Procedure:

--- Content provided by FirstRanker.com ---

1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

3. The corresponding outputs are noted.

--- Content provided by FirstRanker.com ---

4. The theoretical and practical values were verified.

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and

--- Content provided by FirstRanker.com ---

even parity numbers are generated using the corresponding generators.

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



1. What is parity bit?

--- Content provided by FirstRanker.com ---

2. Why parity bit is added to message?

3. What is parity checker?

--- Content provided by FirstRanker.com ---

4. What is odd parity?
5. What is even parity?

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.

--- Content provided by FirstRanker.com ---

8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?
12. What is hamming code?

--- Content provided by FirstRanker.com ---

13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray
17. What are the applications of gray code?

--- Content provided by FirstRanker.com ---

18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

Sl. No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of

--- Content provided by FirstRanker.com ---

selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all

--- Content provided by FirstRanker.com ---

output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A

--- Content provided by FirstRanker.com ---

Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an

--- Content provided by FirstRanker.com ---

enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

4 X 1 MULTIPLEXER

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?
2. What is demultiplexer?

--- Content provided by FirstRanker.com ---

3. What are the advantages of multiplexer?
4. What are the advantages of demultiplexer?
5. What is select signal?
6. How to choose select signal in multiplexer?
7. How to choose select signal in demultiplexer?

--- Content provided by FirstRanker.com ---

8. Write the formula used in select signal.
9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?
11. What is the application of demultiplexer?
12. Draw the truth table of multiplexer.

--- Content provided by FirstRanker.com ---

13. Draw the truth table of demultiplexer.
14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

EXP NO: 11 SHIFT REGISTER

--- Content provided by FirstRanker.com ---

Aim:

To design and implement the various shift register

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2
2. OR gate IC 7432 1
3. IC Trainer kit 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:

A register is capable of shifting its binary information in one or both directions is

--- Content provided by FirstRanker.com ---

known as shift register. The logical configuration of shift register consist of a D-Flip flop
cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible
shift register is one that uses only flip flop. The output of a given flip flop is connected to the
input of next flip flop of the register. Each clock pulse shifts the content of register one bit position

--- Content provided by FirstRanker.com ---

to right.
PIN Diagram:

Logic Diagram:
SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth Table:

--- Content provided by FirstRanker.com ---

CLK Serial in Serial out
1 1 0
2 0 0
3 0 0

--- Content provided by FirstRanker.com ---

4 1 1
5 X 0
6 X 0
7 X 1

--- Content provided by FirstRanker.com ---

Logic Diagram:

Serial in parallel out:

--- Content provided by FirstRanker.com ---

Truth Table:

CLK DATA

--- Content provided by FirstRanker.com ---

OUTPUT
Q
A
Q
B

--- Content provided by FirstRanker.com ---

Q
C
Q
D

--- Content provided by FirstRanker.com ---

1 1 1 0 0 0
2 0 0 1 0 0
3 0 0 0 1 1
4 1 1 0 0 1

--- Content provided by FirstRanker.com ---

Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different

--- Content provided by FirstRanker.com ---

levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative

--- Content provided by FirstRanker.com ---

Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental

--- Content provided by FirstRanker.com ---

concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.

--- Content provided by FirstRanker.com ---

e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.

--- Content provided by FirstRanker.com ---

i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:
? Understand the various logic gates.

--- Content provided by FirstRanker.com ---

? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:

--- Content provided by FirstRanker.com ---

1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor

--- Content provided by FirstRanker.com ---

b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers

--- Content provided by FirstRanker.com ---

b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:

--- Content provided by FirstRanker.com ---

? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates

--- Content provided by FirstRanker.com ---

2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.

--- Content provided by FirstRanker.com ---

Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and

--- Content provided by FirstRanker.com ---

MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.

--- Content provided by FirstRanker.com ---

9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.

--- Content provided by FirstRanker.com ---

Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

Aim:

--- Content provided by FirstRanker.com ---

To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate
The AND gate performs a logical multiplication commonly known as AND function. The

--- Content provided by FirstRanker.com ---

output is high when both the inputs are high. The output is low level when any one of the inputs is
low.
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.

--- Content provided by FirstRanker.com ---

NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low

--- Content provided by FirstRanker.com ---

and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate

--- Content provided by FirstRanker.com ---

An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?

--- Content provided by FirstRanker.com ---

5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.

--- Content provided by FirstRanker.com ---

10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?

--- Content provided by FirstRanker.com ---

15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

1. A+AB = A

--- Content provided by FirstRanker.com ---

2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.

--- Content provided by FirstRanker.com ---

A.B = A+B


Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.

--- Content provided by FirstRanker.com ---

3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?

--- Content provided by FirstRanker.com ---

3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower

--- Content provided by FirstRanker.com ---

significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output
A B C S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 1 1



17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the

--- Content provided by FirstRanker.com ---

subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the

--- Content provided by FirstRanker.com ---

difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

Difference, DIFF = A B

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be

--- Content provided by FirstRanker.com ---

constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0

--- Content provided by FirstRanker.com ---

and it ripples through
the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing

--- Content provided by FirstRanker.com ---

subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it

--- Content provided by FirstRanker.com ---

becomes subtractor.



23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.

--- Content provided by FirstRanker.com ---

Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.

--- Content provided by FirstRanker.com ---

6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?

--- Content provided by FirstRanker.com ---

11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less

--- Content provided by FirstRanker.com ---

than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 1 0
0 0 0 1
0 0 0 1
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
1 0 0
0 0 0 0
0 0 0 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?

--- Content provided by FirstRanker.com ---

3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?

--- Content provided by FirstRanker.com ---

8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:
To design, construct and study the performance of 4-bit different code converters

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two

--- Content provided by FirstRanker.com ---

systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is

--- Content provided by FirstRanker.com ---

designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-

--- Content provided by FirstRanker.com ---

level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:



B3=G3

--- Content provided by FirstRanker.com ---

K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

G3 G2 G1 G0 B3 B2 B1 B0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:


E3 = B3 + B2 (B0 + B1)

--- Content provided by FirstRanker.com ---

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1

1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table

--- Content provided by FirstRanker.com ---

3. Observe the logical output and verify with the truth tables.

Result:
Thus the code converters were designed and verified using the corresponding truth table.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.


1. What is binary code?

--- Content provided by FirstRanker.com ---

2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?
6. How to convert binary to gray code?

--- Content provided by FirstRanker.com ---

7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.

--- Content provided by FirstRanker.com ---

12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

--- Content provided by FirstRanker.com ---

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1
3 NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4 Connecting wires - Required


Theory:
Parity checking is used for error detection in data transmission.

--- Content provided by FirstRanker.com ---

Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

--- Content provided by FirstRanker.com ---

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

--- Content provided by FirstRanker.com ---

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.

--- Content provided by FirstRanker.com ---

Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

Input Checker output Generator output

--- Content provided by FirstRanker.com ---

A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001

--- Content provided by FirstRanker.com ---

0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010

--- Content provided by FirstRanker.com ---

1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101

--- Content provided by FirstRanker.com ---

1 1 1 1 0 1 11111 11110



Procedure:

--- Content provided by FirstRanker.com ---

1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

3. The corresponding outputs are noted.

--- Content provided by FirstRanker.com ---

4. The theoretical and practical values were verified.

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and

--- Content provided by FirstRanker.com ---

even parity numbers are generated using the corresponding generators.

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



1. What is parity bit?

--- Content provided by FirstRanker.com ---

2. Why parity bit is added to message?

3. What is parity checker?

--- Content provided by FirstRanker.com ---

4. What is odd parity?
5. What is even parity?

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.

--- Content provided by FirstRanker.com ---

8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?
12. What is hamming code?

--- Content provided by FirstRanker.com ---

13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray
17. What are the applications of gray code?

--- Content provided by FirstRanker.com ---

18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

Sl. No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of

--- Content provided by FirstRanker.com ---

selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all

--- Content provided by FirstRanker.com ---

output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A

--- Content provided by FirstRanker.com ---

Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an

--- Content provided by FirstRanker.com ---

enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

4 X 1 MULTIPLEXER

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?
2. What is demultiplexer?

--- Content provided by FirstRanker.com ---

3. What are the advantages of multiplexer?
4. What are the advantages of demultiplexer?
5. What is select signal?
6. How to choose select signal in multiplexer?
7. How to choose select signal in demultiplexer?

--- Content provided by FirstRanker.com ---

8. Write the formula used in select signal.
9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?
11. What is the application of demultiplexer?
12. Draw the truth table of multiplexer.

--- Content provided by FirstRanker.com ---

13. Draw the truth table of demultiplexer.
14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

EXP NO: 11 SHIFT REGISTER

--- Content provided by FirstRanker.com ---

Aim:

To design and implement the various shift register

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2
2. OR gate IC 7432 1
3. IC Trainer kit 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:

A register is capable of shifting its binary information in one or both directions is

--- Content provided by FirstRanker.com ---

known as shift register. The logical configuration of shift register consist of a D-Flip flop
cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible
shift register is one that uses only flip flop. The output of a given flip flop is connected to the
input of next flip flop of the register. Each clock pulse shifts the content of register one bit position

--- Content provided by FirstRanker.com ---

to right.
PIN Diagram:

Logic Diagram:
SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth Table:

--- Content provided by FirstRanker.com ---

CLK Serial in Serial out
1 1 0
2 0 0
3 0 0

--- Content provided by FirstRanker.com ---

4 1 1
5 X 0
6 X 0
7 X 1

--- Content provided by FirstRanker.com ---

Logic Diagram:

Serial in parallel out:

--- Content provided by FirstRanker.com ---

Truth Table:

CLK DATA

--- Content provided by FirstRanker.com ---

OUTPUT
Q
A
Q
B

--- Content provided by FirstRanker.com ---

Q
C
Q
D

--- Content provided by FirstRanker.com ---

1 1 1 0 0 0
2 0 0 1 0 0
3 0 0 0 1 1
4 1 1 0 0 1

--- Content provided by FirstRanker.com ---

Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

CLK Q3 Q2 Q1 Q0 O/P
0 1 0 0 1 1
1 0 0 0 0 0
2 0 0 0 0 0

--- Content provided by FirstRanker.com ---

3 0 0 0 0 1

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the implementation of shift registers using flip flops was completed successfully.
Outcome:

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK
DATA INPUT OUTPUT
D

--- Content provided by FirstRanker.com ---

A D
B D
C D
D Q
A Q

--- Content provided by FirstRanker.com ---

B Q
C Q
D
1 1 0 0 1 1 0 0 1
2 1 0 1 0 1 0 1 0

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice



1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and

--- Content provided by FirstRanker.com ---

enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s

--- Content provided by FirstRanker.com ---

needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the

--- Content provided by FirstRanker.com ---

industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism

--- Content provided by FirstRanker.com ---

To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics

--- Content provided by FirstRanker.com ---

To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.

--- Content provided by FirstRanker.com ---

f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also

--- Content provided by FirstRanker.com ---

will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.

--- Content provided by FirstRanker.com ---

? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.

--- Content provided by FirstRanker.com ---

2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker

--- Content provided by FirstRanker.com ---

c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters

--- Content provided by FirstRanker.com ---

5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.

--- Content provided by FirstRanker.com ---

? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.

--- Content provided by FirstRanker.com ---

Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.
Implementation of half adder and full adder

--- Content provided by FirstRanker.com ---

4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.

--- Content provided by FirstRanker.com ---

Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog

--- Content provided by FirstRanker.com ---

HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:
Circuit that takes the logical decision and the process are called logic gates. Each gate has one or

--- Content provided by FirstRanker.com ---

more input and only one output. OR, AND and NOT are basic gates. NAND, NOR and X-OR are known as
universal gates. Basic gates form these 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

--- Content provided by FirstRanker.com ---

low.
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.
NOT gate

--- Content provided by FirstRanker.com ---

A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.

--- Content provided by FirstRanker.com ---

NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is

--- Content provided by FirstRanker.com ---

similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

1. Connections are given as per the circuit diagram.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

At the completion of an experiment student will able to verify the truth

--- Content provided by FirstRanker.com ---

table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?

--- Content provided by FirstRanker.com ---

6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.

--- Content provided by FirstRanker.com ---

11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?

--- Content provided by FirstRanker.com ---

16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:

--- Content provided by FirstRanker.com ---

1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.

--- Content provided by FirstRanker.com ---

4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?

--- Content provided by FirstRanker.com ---

4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.

--- Content provided by FirstRanker.com ---

Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,

--- Content provided by FirstRanker.com ---

S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 1
8. 1 1 1 1 1


Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the

--- Content provided by FirstRanker.com ---

full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.

--- Content provided by FirstRanker.com ---

Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:


Sl.No.

--- Content provided by FirstRanker.com ---

Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to

--- Content provided by FirstRanker.com ---

the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through

--- Content provided by FirstRanker.com ---

the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.

--- Content provided by FirstRanker.com ---

4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:

--- Content provided by FirstRanker.com ---

The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?

--- Content provided by FirstRanker.com ---

2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.

--- Content provided by FirstRanker.com ---

7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?

--- Content provided by FirstRanker.com ---

12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two

--- Content provided by FirstRanker.com ---

numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 1 0
0 0 0 1
0 0 0 1
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

1 0 0
0 0 0 0
0 0 0 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.

--- Content provided by FirstRanker.com ---

4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.

--- Content provided by FirstRanker.com ---

9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION



31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the

--- Content provided by FirstRanker.com ---

two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a

--- Content provided by FirstRanker.com ---

circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are

--- Content provided by FirstRanker.com ---

various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:



32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:



33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G0:



Truth table:

--- Content provided by FirstRanker.com ---

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:



K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:


E3 = B3 + B2 (B0 + B1)

--- Content provided by FirstRanker.com ---

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x

1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1

1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

--- Content provided by FirstRanker.com ---

Result:
Thus the code converters were designed and verified using the corresponding truth table.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the binary to gray converter.


1. What is binary code?
2. What is gray code?

--- Content provided by FirstRanker.com ---

3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?
6. How to convert binary to gray code?
7. How to convert gray to binary code?

--- Content provided by FirstRanker.com ---

8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.
12. What is K ? Map?

--- Content provided by FirstRanker.com ---

13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

Aim:

--- Content provided by FirstRanker.com ---

To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1
3 NOT gate IC 7404 1
4 Connecting wires - Required

--- Content provided by FirstRanker.com ---

Theory:
Parity checking is used for error detection in data transmission.
Odd parity checkers:

--- Content provided by FirstRanker.com ---

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

Even parity checker:

--- Content provided by FirstRanker.com ---

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

Odd parity generators:

--- Content provided by FirstRanker.com ---

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.
Even parity generator:

--- Content provided by FirstRanker.com ---

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

Input Checker output Generator output
A B C D D odd even odd even

--- Content provided by FirstRanker.com ---

0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010

--- Content provided by FirstRanker.com ---

0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100

--- Content provided by FirstRanker.com ---

1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

--- Content provided by FirstRanker.com ---

2. The inputs are given as per the truth table.

3. The corresponding outputs are noted.

--- Content provided by FirstRanker.com ---

4. The theoretical and practical values were verified.

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

--- Content provided by FirstRanker.com ---

2. Why parity bit is added to message?

3. What is parity checker?

4. What is odd parity?

--- Content provided by FirstRanker.com ---

5. What is even parity?

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?

--- Content provided by FirstRanker.com ---

9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?
12. What is hamming code?
13. List the binary weighted code.

--- Content provided by FirstRanker.com ---

14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray
17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2

--- Content provided by FirstRanker.com ---

n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be

--- Content provided by FirstRanker.com ---

selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of

--- Content provided by FirstRanker.com ---

2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-

--- Content provided by FirstRanker.com ---

active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

4 X 1 MULTIPLEXER

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?
2. What is demultiplexer?
3. What are the advantages of multiplexer?

--- Content provided by FirstRanker.com ---

4. What are the advantages of demultiplexer?
5. What is select signal?
6. How to choose select signal in multiplexer?
7. How to choose select signal in demultiplexer?
8. Write the formula used in select signal.

--- Content provided by FirstRanker.com ---

9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?
11. What is the application of demultiplexer?
12. Draw the truth table of multiplexer.
13. Draw the truth table of demultiplexer.

--- Content provided by FirstRanker.com ---

14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

EXP NO: 11 SHIFT REGISTER

Aim:

--- Content provided by FirstRanker.com ---

To design and implement the various shift register

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2
2. OR gate IC 7432 1
3. IC Trainer kit 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

A register is capable of shifting its binary information in one or both directions is
known as shift register. The logical configuration of shift register consist of a D-Flip flop

--- Content provided by FirstRanker.com ---

cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible
shift register is one that uses only flip flop. The output of a given flip flop is connected to the
input of next flip flop of the register. Each clock pulse shifts the content of register one bit position
to right.

--- Content provided by FirstRanker.com ---

PIN Diagram:

Logic Diagram:
SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth Table:

--- Content provided by FirstRanker.com ---

CLK Serial in Serial out
1 1 0
2 0 0
3 0 0
4 1 1

--- Content provided by FirstRanker.com ---

5 X 0
6 X 0
7 X 1

--- Content provided by FirstRanker.com ---

Logic Diagram:

Serial in parallel out:

--- Content provided by FirstRanker.com ---

Truth Table:

CLK DATA
OUTPUT

--- Content provided by FirstRanker.com ---

Q
A
Q
B
Q

--- Content provided by FirstRanker.com ---

C
Q
D

1 1 1 0 0 0

--- Content provided by FirstRanker.com ---

2 0 0 1 0 0
3 0 0 0 1 1
4 1 1 0 0 1

--- Content provided by FirstRanker.com ---

Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

CLK Q3 Q2 Q1 Q0 O/P
0 1 0 0 1 1
1 0 0 0 0 0
2 0 0 0 0 0
3 0 0 0 0 1

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per circuit diagram

--- Content provided by FirstRanker.com ---

2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the implementation of shift registers using flip flops was completed successfully.
Outcome:

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK
DATA INPUT OUTPUT
D
A D

--- Content provided by FirstRanker.com ---

B D
C D
D Q
A Q
B Q

--- Content provided by FirstRanker.com ---

C Q
D
1 1 0 0 1 1 0 0 1
2 1 0 1 0 1 0 1 0

--- Content provided by FirstRanker.com ---

51 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.12: SYNCHRONOUS UP/DOWN COUNTER

--- Content provided by FirstRanker.com ---

Aim:

To design and implement 3 bit synchronous up/down counter

--- Content provided by FirstRanker.com ---

Apparatus required:

S.No Name of the Apparatus Range Quantity
1. JK Flip Flop IC 7474 2
2. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5 XOR gate IC 7486 1
6 IC Trainer Kit 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

A counter is a register capable of counting number of clock pulse arriving at its clock input.

--- Content provided by FirstRanker.com ---

Counter represents the number of clock pulses arrived. An up/down counter is one that is capable of
progressing in increasing order or decreasing order through a certain sequence. An up/down counter
is also called bidirectional counter. Usually up/down operation of the counter is controlled by up/down
signal. When this signal is high counter goes through up sequence and when up/down signal is low counter
follows reverse sequence.

--- Content provided by FirstRanker.com ---

K map:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________

--- Content provided by FirstRanker.com ---

Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics

--- Content provided by FirstRanker.com ---

Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.

--- Content provided by FirstRanker.com ---

? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of

--- Content provided by FirstRanker.com ---

engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.

--- Content provided by FirstRanker.com ---

d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.

--- Content provided by FirstRanker.com ---

h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:

--- Content provided by FirstRanker.com ---

? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL

--- Content provided by FirstRanker.com ---

List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:

--- Content provided by FirstRanker.com ---

a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:

--- Content provided by FirstRanker.com ---

a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.

--- Content provided by FirstRanker.com ---

? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.

--- Content provided by FirstRanker.com ---

Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.

--- Content provided by FirstRanker.com ---

Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI

--- Content provided by FirstRanker.com ---

Devices

7.
Design and Implementation of Magnitude Comparator.
8.

--- Content provided by FirstRanker.com ---

Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.

--- Content provided by FirstRanker.com ---

11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.

--- Content provided by FirstRanker.com ---

Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate

--- Content provided by FirstRanker.com ---

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.
OR gate
The OR gate performs a logical addition commonly known as OR function. The output is

--- Content provided by FirstRanker.com ---

high when any one of the inputs is high. The output is low level when both the inputs are low.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate

--- Content provided by FirstRanker.com ---

The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.

--- Content provided by FirstRanker.com ---

EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?

--- Content provided by FirstRanker.com ---

4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.

--- Content provided by FirstRanker.com ---

9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?

--- Content provided by FirstRanker.com ---

14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C

--- Content provided by FirstRanker.com ---

2. A.(B.C) = (A.B).C

3. Distributive Law

The binary operator OR, AND is said to be distributive if,

--- Content provided by FirstRanker.com ---

1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B

--- Content provided by FirstRanker.com ---

2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B


Design

--- Content provided by FirstRanker.com ---

1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc

--- Content provided by FirstRanker.com ---

.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.



1. What is Demorgan?s law?

--- Content provided by FirstRanker.com ---

2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is

--- Content provided by FirstRanker.com ---

performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1

--- Content provided by FirstRanker.com ---

5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit

--- Content provided by FirstRanker.com ---

is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input

--- Content provided by FirstRanker.com ---

variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be

--- Content provided by FirstRanker.com ---

implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:

--- Content provided by FirstRanker.com ---

To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C

--- Content provided by FirstRanker.com ---

0
and it ripples through
the full adder to the output carry C
4
.

--- Content provided by FirstRanker.com ---

4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0

--- Content provided by FirstRanker.com ---

must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary

--- Content provided by FirstRanker.com ---

adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.

--- Content provided by FirstRanker.com ---

.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0

--- Content provided by FirstRanker.com ---

1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1

--- Content provided by FirstRanker.com ---

1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1



25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.

--- Content provided by FirstRanker.com ---

5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.

--- Content provided by FirstRanker.com ---

10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2

--- Content provided by FirstRanker.com ---

6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:



29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Observe the output and verify the truth table.

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 1 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
1 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?

--- Content provided by FirstRanker.com ---

2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?

--- Content provided by FirstRanker.com ---

7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?

--- Content provided by FirstRanker.com ---

13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The availability of large variety of codes for the same discrete elements of information results in

--- Content provided by FirstRanker.com ---

the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0

--- Content provided by FirstRanker.com ---

and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the

--- Content provided by FirstRanker.com ---

four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter



34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

G3 G2 G1 G0 B3 B2 B1 B0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x

1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

BCD code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for A:


A = X1 X2 + X3 X4 X1

--- Content provided by FirstRanker.com ---

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1

1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

Result:
Thus the code converters were designed and verified using the corresponding truth table.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.

--- Content provided by FirstRanker.com ---

1. What is binary code?
2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?

--- Content provided by FirstRanker.com ---

6. How to convert binary to gray code?
7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?

--- Content provided by FirstRanker.com ---

11. Explain the operation of EX ? OR.
12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?

--- Content provided by FirstRanker.com ---

16. What is minterm?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

--- Content provided by FirstRanker.com ---

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1

--- Content provided by FirstRanker.com ---

3 NOT gate IC 7404 1
4 Connecting wires - Required


Theory:

--- Content provided by FirstRanker.com ---

Parity checking is used for error detection in data transmission.
Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

--- Content provided by FirstRanker.com ---

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

--- Content provided by FirstRanker.com ---

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits

--- Content provided by FirstRanker.com ---

which is an odd parity number.
Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5

--- Content provided by FirstRanker.com ---

bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

--- Content provided by FirstRanker.com ---

Input Checker output Generator output
A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110

--- Content provided by FirstRanker.com ---

0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001

--- Content provided by FirstRanker.com ---

1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011

--- Content provided by FirstRanker.com ---

1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

--- Content provided by FirstRanker.com ---

3. The corresponding outputs are noted.

4. The theoretical and practical values were verified.

Result:

--- Content provided by FirstRanker.com ---

The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker

--- Content provided by FirstRanker.com ---

using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

2. Why parity bit is added to message?

3. What is parity checker?

--- Content provided by FirstRanker.com ---

4. What is odd parity?
5. What is even parity?

6. What are the gates involved for parity generator?

--- Content provided by FirstRanker.com ---

7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?

--- Content provided by FirstRanker.com ---

12. What is hamming code?
13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray

--- Content provided by FirstRanker.com ---

17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input

--- Content provided by FirstRanker.com ---

lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and

--- Content provided by FirstRanker.com ---

steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful

--- Content provided by FirstRanker.com ---

for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection

--- Content provided by FirstRanker.com ---

lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4 X 1 MULTIPLEXER

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?

--- Content provided by FirstRanker.com ---

2. What is demultiplexer?
3. What are the advantages of multiplexer?
4. What are the advantages of demultiplexer?
5. What is select signal?
6. How to choose select signal in multiplexer?

--- Content provided by FirstRanker.com ---

7. How to choose select signal in demultiplexer?
8. Write the formula used in select signal.
9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?
11. What is the application of demultiplexer?

--- Content provided by FirstRanker.com ---

12. Draw the truth table of multiplexer.
13. Draw the truth table of demultiplexer.
14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

EXP NO: 11 SHIFT REGISTER

--- Content provided by FirstRanker.com ---

Aim:

To design and implement the various shift register

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2
2. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

3. IC Trainer kit 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

A register is capable of shifting its binary information in one or both directions is
known as shift register. The logical configuration of shift register consist of a D-Flip flop
cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible
shift register is one that uses only flip flop. The output of a given flip flop is connected to the

--- Content provided by FirstRanker.com ---

input of next flip flop of the register. Each clock pulse shifts the content of register one bit position
to right.
PIN Diagram:

Logic Diagram:

--- Content provided by FirstRanker.com ---

SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth Table:

CLK Serial in Serial out
1 1 0
2 0 0

--- Content provided by FirstRanker.com ---

3 0 0
4 1 1
5 X 0
6 X 0
7 X 1

--- Content provided by FirstRanker.com ---

Logic Diagram:

Serial in parallel out:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

CLK DATA
OUTPUT
Q
A
Q

--- Content provided by FirstRanker.com ---

B
Q
C
Q
D

--- Content provided by FirstRanker.com ---

1 1 1 0 0 0
2 0 0 1 0 0
3 0 0 0 1 1
4 1 1 0 0 1

--- Content provided by FirstRanker.com ---

Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

CLK Q3 Q2 Q1 Q0 O/P
0 1 0 0 1 1
1 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2 0 0 0 0 0
3 0 0 0 0 1

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the implementation of shift registers using flip flops was completed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK
DATA INPUT OUTPUT

--- Content provided by FirstRanker.com ---

D
A D
B D
C D
D Q

--- Content provided by FirstRanker.com ---

A Q
B Q
C Q
D
1 1 0 0 1 1 0 0 1

--- Content provided by FirstRanker.com ---

2 1 0 1 0 1 0 1 0



51 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12: SYNCHRONOUS UP/DOWN COUNTER

Aim:

--- Content provided by FirstRanker.com ---

To design and implement 3 bit synchronous up/down counter

Apparatus required:

S.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. JK Flip Flop IC 7474 2
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5 XOR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6 IC Trainer Kit 1
7. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

A counter is a register capable of counting number of clock pulse arriving at its clock input.
Counter represents the number of clock pulses arrived. An up/down counter is one that is capable of
progressing in increasing order or decreasing order through a certain sequence. An up/down counter
is also called bidirectional counter. Usually up/down operation of the counter is controlled by up/down

--- Content provided by FirstRanker.com ---

signal. When this signal is high counter goes through up sequence and when up/down signal is low counter
follows reverse sequence.

K map:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

52 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Q Q

--- Content provided by FirstRanker.com ---

t+1 J K
0 0 0 X
0 1 1 X
1 0 X 1
1 1 X 0

--- Content provided by FirstRanker.com ---

State Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Characteristic Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________

--- Content provided by FirstRanker.com ---

Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on

--- Content provided by FirstRanker.com ---

heart and soul



DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to

--- Content provided by FirstRanker.com ---

professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals

--- Content provided by FirstRanker.com ---

To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new

--- Content provided by FirstRanker.com ---

technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall

--- Content provided by FirstRanker.com ---

development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good

--- Content provided by FirstRanker.com ---

professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.

--- Content provided by FirstRanker.com ---

c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.

--- Content provided by FirstRanker.com ---

g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.

--- Content provided by FirstRanker.com ---

k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:

--- Content provided by FirstRanker.com ---

The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits

--- Content provided by FirstRanker.com ---

? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.

--- Content provided by FirstRanker.com ---

3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers

--- Content provided by FirstRanker.com ---

4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.

--- Content provided by FirstRanker.com ---

? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor

--- Content provided by FirstRanker.com ---

5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.

--- Content provided by FirstRanker.com ---

Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.
Design and Implementation of Magnitude Comparator.

--- Content provided by FirstRanker.com ---

8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.

--- Content provided by FirstRanker.com ---

Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.

--- Content provided by FirstRanker.com ---

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.
OR gate

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.

--- Content provided by FirstRanker.com ---

NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The

--- Content provided by FirstRanker.com ---

output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.

--- Content provided by FirstRanker.com ---

3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.

--- Content provided by FirstRanker.com ---

8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?

--- Content provided by FirstRanker.com ---

13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A

--- Content provided by FirstRanker.com ---

2. A.B=B.A

2. Associative Law

The binary operator OR, AND is said to be associative if,

--- Content provided by FirstRanker.com ---

1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.

--- Content provided by FirstRanker.com ---

A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law

--- Content provided by FirstRanker.com ---

A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V

--- Content provided by FirstRanker.com ---

cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

S. No. Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required


Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four

--- Content provided by FirstRanker.com ---

possible elementary operations, namely,

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables

--- Content provided by FirstRanker.com ---

designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented

--- Content provided by FirstRanker.com ---

with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC



16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:



18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 V supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The

--- Content provided by FirstRanker.com ---

three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The

--- Content provided by FirstRanker.com ---

carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through
the full adder to the output carry C
4

--- Content provided by FirstRanker.com ---

.
4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C

--- Content provided by FirstRanker.com ---

0
must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

--- Content provided by FirstRanker.com ---

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

--- Content provided by FirstRanker.com ---

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1

--- Content provided by FirstRanker.com ---

1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1

--- Content provided by FirstRanker.com ---

1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.

--- Content provided by FirstRanker.com ---

4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.

--- Content provided by FirstRanker.com ---

9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?

--- Content provided by FirstRanker.com ---

14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.6: MAGNITUDE COMPARATOR

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude

--- Content provided by FirstRanker.com ---

comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 0 0 0
0 1 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 0
0 0 0 0
1 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 1
0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.

--- Content provided by FirstRanker.com ---

6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.

--- Content provided by FirstRanker.com ---

12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to BCD code converter

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2

--- Content provided by FirstRanker.com ---

6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs

--- Content provided by FirstRanker.com ---

and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as

--- Content provided by FirstRanker.com ---

specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:


G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

K map for B1:



K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x



38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

BCD code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for A:


A = X1 X2 + X3 X4 X1

--- Content provided by FirstRanker.com ---

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Procedure:

--- Content provided by FirstRanker.com ---

1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

Result:

--- Content provided by FirstRanker.com ---

Thus the code converters were designed and verified using the corresponding truth table.

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.

--- Content provided by FirstRanker.com ---

1. What is binary code?
2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?

--- Content provided by FirstRanker.com ---

5. What is sequential code?
6. How to convert binary to gray code?
7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?

--- Content provided by FirstRanker.com ---

10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.
12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?

--- Content provided by FirstRanker.com ---

15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.8: PARITY GENERATORS AND CHECKERS

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Component Type Quantity
1 Trainer Kit - 1

--- Content provided by FirstRanker.com ---

2 EX-OR IC7486 1
3 NOT gate IC 7404 1
4 Connecting wires - Required

--- Content provided by FirstRanker.com ---

Theory:
Parity checking is used for error detection in data transmission.
Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is

--- Content provided by FirstRanker.com ---

odd.

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is

--- Content provided by FirstRanker.com ---

even.

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also

--- Content provided by FirstRanker.com ---

the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.
Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and

--- Content provided by FirstRanker.com ---

also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

--- Content provided by FirstRanker.com ---

Input Checker output Generator output
A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101

--- Content provided by FirstRanker.com ---

0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111

--- Content provided by FirstRanker.com ---

1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000

--- Content provided by FirstRanker.com ---

1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

--- Content provided by FirstRanker.com ---

3. The corresponding outputs are noted.

4. The theoretical and practical values were verified.

--- Content provided by FirstRanker.com ---

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

2. Why parity bit is added to message?

--- Content provided by FirstRanker.com ---

3. What is parity checker?

4. What is odd parity?
5. What is even parity?

--- Content provided by FirstRanker.com ---

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?

--- Content provided by FirstRanker.com ---

11. What is ASCII code?
12. What is hamming code?
13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation

--- Content provided by FirstRanker.com ---

16. List the procedures to convert binary code into gray
17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or

--- Content provided by FirstRanker.com ---

lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines

--- Content provided by FirstRanker.com ---

which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is

--- Content provided by FirstRanker.com ---

used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n

--- Content provided by FirstRanker.com ---

possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4 X 1 MULTIPLEXER

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables

--- Content provided by FirstRanker.com ---

were verified.

Outcome:
At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is multiplexer?
2. What is demultiplexer?
3. What are the advantages of multiplexer?
4. What are the advantages of demultiplexer?
5. What is select signal?

--- Content provided by FirstRanker.com ---

6. How to choose select signal in multiplexer?
7. How to choose select signal in demultiplexer?
8. Write the formula used in select signal.
9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?

--- Content provided by FirstRanker.com ---

11. What is the application of demultiplexer?
12. Draw the truth table of multiplexer.
13. Draw the truth table of demultiplexer.
14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

EXP NO: 11 SHIFT REGISTER

Aim:

To design and implement the various shift register

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2

--- Content provided by FirstRanker.com ---

2. OR gate IC 7432 1
3. IC Trainer kit 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

A register is capable of shifting its binary information in one or both directions is
known as shift register. The logical configuration of shift register consist of a D-Flip flop
cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible

--- Content provided by FirstRanker.com ---

shift register is one that uses only flip flop. The output of a given flip flop is connected to the
input of next flip flop of the register. Each clock pulse shifts the content of register one bit position
to right.
PIN Diagram:

--- Content provided by FirstRanker.com ---

Logic Diagram:
SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth Table:

CLK Serial in Serial out
1 1 0

--- Content provided by FirstRanker.com ---

2 0 0
3 0 0
4 1 1
5 X 0
6 X 0

--- Content provided by FirstRanker.com ---

7 X 1


Logic Diagram:

--- Content provided by FirstRanker.com ---

Serial in parallel out:



Truth Table:

--- Content provided by FirstRanker.com ---

CLK DATA
OUTPUT
Q
A

--- Content provided by FirstRanker.com ---

Q
B
Q
C
Q

--- Content provided by FirstRanker.com ---

D

1 1 1 0 0 0
2 0 0 1 0 0
3 0 0 0 1 1

--- Content provided by FirstRanker.com ---

4 1 1 0 0 1


Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

CLK Q3 Q2 Q1 Q0 O/P
0 1 0 0 1 1

--- Content provided by FirstRanker.com ---

1 0 0 0 0 0
2 0 0 0 0 0
3 0 0 0 0 1

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per circuit diagram
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the implementation of shift registers using flip flops was completed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK

--- Content provided by FirstRanker.com ---

DATA INPUT OUTPUT
D
A D
B D
C D

--- Content provided by FirstRanker.com ---

D Q
A Q
B Q
C Q
D

--- Content provided by FirstRanker.com ---

1 1 0 0 1 1 0 0 1
2 1 0 1 0 1 0 1 0

--- Content provided by FirstRanker.com ---

51 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.12: SYNCHRONOUS UP/DOWN COUNTER

Aim:

--- Content provided by FirstRanker.com ---

To design and implement 3 bit synchronous up/down counter

Apparatus required:

--- Content provided by FirstRanker.com ---

S.No Name of the Apparatus Range Quantity
1. JK Flip Flop IC 7474 2
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1

--- Content provided by FirstRanker.com ---

5 XOR gate IC 7486 1
6 IC Trainer Kit 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

A counter is a register capable of counting number of clock pulse arriving at its clock input.
Counter represents the number of clock pulses arrived. An up/down counter is one that is capable of
progressing in increasing order or decreasing order through a certain sequence. An up/down counter

--- Content provided by FirstRanker.com ---

is also called bidirectional counter. Usually up/down operation of the counter is controlled by up/down
signal. When this signal is high counter goes through up sequence and when up/down signal is low counter
follows reverse sequence.

K map:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

52 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Q Q
t+1 J K
0 0 0 X
0 1 1 X
1 0 X 1

--- Content provided by FirstRanker.com ---

1 1 X 0

State Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Characteristic Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

53 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Input

--- Content provided by FirstRanker.com ---

Up/Down
Present
State
Q
A

--- Content provided by FirstRanker.com ---

Q
B
Q
C

--- Content provided by FirstRanker.com ---

Next State
Q
A+1
Q
B+1

--- Content provided by FirstRanker.com ---

Q
C+1
A
J
A

--- Content provided by FirstRanker.com ---

K
A

B
J

--- Content provided by FirstRanker.com ---

B
K
B

C

--- Content provided by FirstRanker.com ---

J
C
K
C

--- Content provided by FirstRanker.com ---

0 0 0 0 1 1 1 1 X 1 X 1 X
0 1 1 1 1 1 0 X 0 X 0 X 1
0 1 1 0 1 0 1 X 0 X 1 1 X
0 1 0 1 1 0 0 X 0 0 X X 1
0 1 0 0 0 1 1 X 1 1 X 1 X

--- Content provided by FirstRanker.com ---

0 0 1 1 0 1 0 0 X X 0 X 1
0 0 1 0 0 0 1 0 X X 1 1 X
0 0 0 1 0 0 0 0 X 0 X X 1
1 0 0 0 0 0 1 0 X 0 X 1 X
1 0 0 1 0 1 0 0 X 1 X X 1

--- Content provided by FirstRanker.com ---

1 0 1 0 0 1 1 0 X X 0 1 X
1 0 1 1 1 0 0 1 X X 1 X 1
1 1 0 0 1 0 1 X 0 0 X 1 X
1 1 0 1 1 1 0 X 0 1 X X 1
1 1 1 0 1 1 1 X 0 X 0 1 X

--- Content provided by FirstRanker.com ---

1 1 1 1 0 0 0 X 1 X 1 X 1


Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.
Result:

--- Content provided by FirstRanker.com ---

Thus the 3-bit synchronous up/down counters was implemented successfully.
Outcome:

At the completion of an experiment student will able to design the synchronous up/down counter.

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different

--- Content provided by FirstRanker.com ---

levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative

--- Content provided by FirstRanker.com ---

Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental

--- Content provided by FirstRanker.com ---

concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.

--- Content provided by FirstRanker.com ---

e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.

--- Content provided by FirstRanker.com ---

i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:
? Understand the various logic gates.

--- Content provided by FirstRanker.com ---

? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:

--- Content provided by FirstRanker.com ---

1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor

--- Content provided by FirstRanker.com ---

b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers

--- Content provided by FirstRanker.com ---

b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:

--- Content provided by FirstRanker.com ---

? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates

--- Content provided by FirstRanker.com ---

2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.

--- Content provided by FirstRanker.com ---

Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and

--- Content provided by FirstRanker.com ---

MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.

--- Content provided by FirstRanker.com ---

9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.

--- Content provided by FirstRanker.com ---

Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

Aim:

--- Content provided by FirstRanker.com ---

To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate
The AND gate performs a logical multiplication commonly known as AND function. The

--- Content provided by FirstRanker.com ---

output is high when both the inputs are high. The output is low level when any one of the inputs is
low.
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.

--- Content provided by FirstRanker.com ---

NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low

--- Content provided by FirstRanker.com ---

and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate

--- Content provided by FirstRanker.com ---

An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?

--- Content provided by FirstRanker.com ---

5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.

--- Content provided by FirstRanker.com ---

10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?

--- Content provided by FirstRanker.com ---

15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

1. A+AB = A

--- Content provided by FirstRanker.com ---

2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.

--- Content provided by FirstRanker.com ---

A.B = A+B


Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.

--- Content provided by FirstRanker.com ---

3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?

--- Content provided by FirstRanker.com ---

3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower

--- Content provided by FirstRanker.com ---

significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output
A B C S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 1 1



17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the

--- Content provided by FirstRanker.com ---

subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the

--- Content provided by FirstRanker.com ---

difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

Difference, DIFF = A B

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be

--- Content provided by FirstRanker.com ---

constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0

--- Content provided by FirstRanker.com ---

and it ripples through
the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing

--- Content provided by FirstRanker.com ---

subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it

--- Content provided by FirstRanker.com ---

becomes subtractor.



23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.

--- Content provided by FirstRanker.com ---

Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.

--- Content provided by FirstRanker.com ---

6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?

--- Content provided by FirstRanker.com ---

11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less

--- Content provided by FirstRanker.com ---

than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 1 0
0 0 0 1
0 0 0 1
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
1 0 0
0 0 0 0
0 0 0 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?

--- Content provided by FirstRanker.com ---

3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?

--- Content provided by FirstRanker.com ---

8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:
To design, construct and study the performance of 4-bit different code converters

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two

--- Content provided by FirstRanker.com ---

systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is

--- Content provided by FirstRanker.com ---

designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-

--- Content provided by FirstRanker.com ---

level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:



B3=G3

--- Content provided by FirstRanker.com ---

K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

G3 G2 G1 G0 B3 B2 B1 B0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:


E3 = B3 + B2 (B0 + B1)

--- Content provided by FirstRanker.com ---

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1

1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table

--- Content provided by FirstRanker.com ---

3. Observe the logical output and verify with the truth tables.

Result:
Thus the code converters were designed and verified using the corresponding truth table.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.


1. What is binary code?

--- Content provided by FirstRanker.com ---

2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?
6. How to convert binary to gray code?

--- Content provided by FirstRanker.com ---

7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.

--- Content provided by FirstRanker.com ---

12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

--- Content provided by FirstRanker.com ---

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1
3 NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4 Connecting wires - Required


Theory:
Parity checking is used for error detection in data transmission.

--- Content provided by FirstRanker.com ---

Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

--- Content provided by FirstRanker.com ---

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

--- Content provided by FirstRanker.com ---

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.

--- Content provided by FirstRanker.com ---

Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

Input Checker output Generator output

--- Content provided by FirstRanker.com ---

A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001

--- Content provided by FirstRanker.com ---

0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010

--- Content provided by FirstRanker.com ---

1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101

--- Content provided by FirstRanker.com ---

1 1 1 1 0 1 11111 11110



Procedure:

--- Content provided by FirstRanker.com ---

1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

3. The corresponding outputs are noted.

--- Content provided by FirstRanker.com ---

4. The theoretical and practical values were verified.

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and

--- Content provided by FirstRanker.com ---

even parity numbers are generated using the corresponding generators.

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



1. What is parity bit?

--- Content provided by FirstRanker.com ---

2. Why parity bit is added to message?

3. What is parity checker?

--- Content provided by FirstRanker.com ---

4. What is odd parity?
5. What is even parity?

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.

--- Content provided by FirstRanker.com ---

8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?
12. What is hamming code?

--- Content provided by FirstRanker.com ---

13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray
17. What are the applications of gray code?

--- Content provided by FirstRanker.com ---

18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

Sl. No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of

--- Content provided by FirstRanker.com ---

selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all

--- Content provided by FirstRanker.com ---

output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A

--- Content provided by FirstRanker.com ---

Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an

--- Content provided by FirstRanker.com ---

enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

4 X 1 MULTIPLEXER

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?
2. What is demultiplexer?

--- Content provided by FirstRanker.com ---

3. What are the advantages of multiplexer?
4. What are the advantages of demultiplexer?
5. What is select signal?
6. How to choose select signal in multiplexer?
7. How to choose select signal in demultiplexer?

--- Content provided by FirstRanker.com ---

8. Write the formula used in select signal.
9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?
11. What is the application of demultiplexer?
12. Draw the truth table of multiplexer.

--- Content provided by FirstRanker.com ---

13. Draw the truth table of demultiplexer.
14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

EXP NO: 11 SHIFT REGISTER

--- Content provided by FirstRanker.com ---

Aim:

To design and implement the various shift register

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2
2. OR gate IC 7432 1
3. IC Trainer kit 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:

A register is capable of shifting its binary information in one or both directions is

--- Content provided by FirstRanker.com ---

known as shift register. The logical configuration of shift register consist of a D-Flip flop
cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible
shift register is one that uses only flip flop. The output of a given flip flop is connected to the
input of next flip flop of the register. Each clock pulse shifts the content of register one bit position

--- Content provided by FirstRanker.com ---

to right.
PIN Diagram:

Logic Diagram:
SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth Table:

--- Content provided by FirstRanker.com ---

CLK Serial in Serial out
1 1 0
2 0 0
3 0 0

--- Content provided by FirstRanker.com ---

4 1 1
5 X 0
6 X 0
7 X 1

--- Content provided by FirstRanker.com ---

Logic Diagram:

Serial in parallel out:

--- Content provided by FirstRanker.com ---

Truth Table:

CLK DATA

--- Content provided by FirstRanker.com ---

OUTPUT
Q
A
Q
B

--- Content provided by FirstRanker.com ---

Q
C
Q
D

--- Content provided by FirstRanker.com ---

1 1 1 0 0 0
2 0 0 1 0 0
3 0 0 0 1 1
4 1 1 0 0 1

--- Content provided by FirstRanker.com ---

Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

CLK Q3 Q2 Q1 Q0 O/P
0 1 0 0 1 1
1 0 0 0 0 0
2 0 0 0 0 0

--- Content provided by FirstRanker.com ---

3 0 0 0 0 1

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the implementation of shift registers using flip flops was completed successfully.
Outcome:

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK
DATA INPUT OUTPUT
D

--- Content provided by FirstRanker.com ---

A D
B D
C D
D Q
A Q

--- Content provided by FirstRanker.com ---

B Q
C Q
D
1 1 0 0 1 1 0 0 1
2 1 0 1 0 1 0 1 0

--- Content provided by FirstRanker.com ---

51 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12: SYNCHRONOUS UP/DOWN COUNTER

Aim:

To design and implement 3 bit synchronous up/down counter

--- Content provided by FirstRanker.com ---

Apparatus required:

S.No Name of the Apparatus Range Quantity
1. JK Flip Flop IC 7474 2

--- Content provided by FirstRanker.com ---

2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5 XOR gate IC 7486 1
6 IC Trainer Kit 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

A counter is a register capable of counting number of clock pulse arriving at its clock input.
Counter represents the number of clock pulses arrived. An up/down counter is one that is capable of
progressing in increasing order or decreasing order through a certain sequence. An up/down counter
is also called bidirectional counter. Usually up/down operation of the counter is controlled by up/down
signal. When this signal is high counter goes through up sequence and when up/down signal is low counter

--- Content provided by FirstRanker.com ---

follows reverse sequence.

K map:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

52 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Q Q
t+1 J K

--- Content provided by FirstRanker.com ---

0 0 0 X
0 1 1 X
1 0 X 1
1 1 X 0

--- Content provided by FirstRanker.com ---

State Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Characteristic Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

53 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Input
Up/Down
Present

--- Content provided by FirstRanker.com ---

State
Q
A
Q
B

--- Content provided by FirstRanker.com ---

Q
C

Next State
Q

--- Content provided by FirstRanker.com ---

A+1
Q
B+1
Q
C+1

--- Content provided by FirstRanker.com ---

A
J
A
K
A

--- Content provided by FirstRanker.com ---

B
J
B
K

--- Content provided by FirstRanker.com ---

B

C
J
C

--- Content provided by FirstRanker.com ---

K
C

0 0 0 0 1 1 1 1 X 1 X 1 X
0 1 1 1 1 1 0 X 0 X 0 X 1

--- Content provided by FirstRanker.com ---

0 1 1 0 1 0 1 X 0 X 1 1 X
0 1 0 1 1 0 0 X 0 0 X X 1
0 1 0 0 0 1 1 X 1 1 X 1 X
0 0 1 1 0 1 0 0 X X 0 X 1
0 0 1 0 0 0 1 0 X X 1 1 X

--- Content provided by FirstRanker.com ---

0 0 0 1 0 0 0 0 X 0 X X 1
1 0 0 0 0 0 1 0 X 0 X 1 X
1 0 0 1 0 1 0 0 X 1 X X 1
1 0 1 0 0 1 1 0 X X 0 1 X
1 0 1 1 1 0 0 1 X X 1 X 1

--- Content provided by FirstRanker.com ---

1 1 0 0 1 0 1 X 0 0 X 1 X
1 1 0 1 1 1 0 X 0 1 X X 1
1 1 1 0 1 1 1 X 0 X 0 1 X
1 1 1 1 0 0 0 X 1 X 1 X 1

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.
Result:
Thus the 3-bit synchronous up/down counters was implemented successfully.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the synchronous up/down counter.

--- Content provided by FirstRanker.com ---

54 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12:

SIMULATION OF COMBINATIONAL CIRCUITS USING HDL

Aim:

--- Content provided by FirstRanker.com ---

To write a verilog code for half adder, full adder and multiplexer

Tools Required:
Xilinx 9.2

--- Content provided by FirstRanker.com ---

Program:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Simulation wave for half adder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________

--- Content provided by FirstRanker.com ---

Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on

--- Content provided by FirstRanker.com ---

heart and soul



DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to

--- Content provided by FirstRanker.com ---

professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals

--- Content provided by FirstRanker.com ---

To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new

--- Content provided by FirstRanker.com ---

technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall

--- Content provided by FirstRanker.com ---

development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good

--- Content provided by FirstRanker.com ---

professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.

--- Content provided by FirstRanker.com ---

c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.

--- Content provided by FirstRanker.com ---

g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.

--- Content provided by FirstRanker.com ---

k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:

--- Content provided by FirstRanker.com ---

The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits

--- Content provided by FirstRanker.com ---

? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.

--- Content provided by FirstRanker.com ---

3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers

--- Content provided by FirstRanker.com ---

4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.

--- Content provided by FirstRanker.com ---

? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY



6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.

--- Content provided by FirstRanker.com ---

1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor

--- Content provided by FirstRanker.com ---

5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.

--- Content provided by FirstRanker.com ---

Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.
Design and Implementation of Magnitude Comparator.

--- Content provided by FirstRanker.com ---

8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.

--- Content provided by FirstRanker.com ---

Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.

--- Content provided by FirstRanker.com ---

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.
OR gate

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.

--- Content provided by FirstRanker.com ---

NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The

--- Content provided by FirstRanker.com ---

output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.

--- Content provided by FirstRanker.com ---

3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.

--- Content provided by FirstRanker.com ---

8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?

--- Content provided by FirstRanker.com ---

13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A

--- Content provided by FirstRanker.com ---

2. A.B=B.A

2. Associative Law

The binary operator OR, AND is said to be associative if,

--- Content provided by FirstRanker.com ---

1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.

--- Content provided by FirstRanker.com ---

A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law

--- Content provided by FirstRanker.com ---

A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V

--- Content provided by FirstRanker.com ---

cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

S. No. Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required


Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four

--- Content provided by FirstRanker.com ---

possible elementary operations, namely,

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables

--- Content provided by FirstRanker.com ---

designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented

--- Content provided by FirstRanker.com ---

with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC



16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:



18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 V supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The

--- Content provided by FirstRanker.com ---

three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The

--- Content provided by FirstRanker.com ---

carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through
the full adder to the output carry C
4

--- Content provided by FirstRanker.com ---

.
4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C

--- Content provided by FirstRanker.com ---

0
must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

--- Content provided by FirstRanker.com ---

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

--- Content provided by FirstRanker.com ---

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1

--- Content provided by FirstRanker.com ---

1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1

--- Content provided by FirstRanker.com ---

1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.

--- Content provided by FirstRanker.com ---

4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.

--- Content provided by FirstRanker.com ---

9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?

--- Content provided by FirstRanker.com ---

14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.6: MAGNITUDE COMPARATOR

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude

--- Content provided by FirstRanker.com ---

comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 0 0 0
0 1 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 0
0 0 0 0
1 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 1
0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.

--- Content provided by FirstRanker.com ---

6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.

--- Content provided by FirstRanker.com ---

12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to BCD code converter

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2

--- Content provided by FirstRanker.com ---

6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs

--- Content provided by FirstRanker.com ---

and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as

--- Content provided by FirstRanker.com ---

specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:


G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

K map for B1:



K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x



38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

BCD code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for A:


A = X1 X2 + X3 X4 X1

--- Content provided by FirstRanker.com ---

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Procedure:

--- Content provided by FirstRanker.com ---

1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

Result:

--- Content provided by FirstRanker.com ---

Thus the code converters were designed and verified using the corresponding truth table.

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.

--- Content provided by FirstRanker.com ---

1. What is binary code?
2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?

--- Content provided by FirstRanker.com ---

5. What is sequential code?
6. How to convert binary to gray code?
7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?

--- Content provided by FirstRanker.com ---

10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.
12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?

--- Content provided by FirstRanker.com ---

15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.8: PARITY GENERATORS AND CHECKERS

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Component Type Quantity
1 Trainer Kit - 1

--- Content provided by FirstRanker.com ---

2 EX-OR IC7486 1
3 NOT gate IC 7404 1
4 Connecting wires - Required

--- Content provided by FirstRanker.com ---

Theory:
Parity checking is used for error detection in data transmission.
Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is

--- Content provided by FirstRanker.com ---

odd.

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is

--- Content provided by FirstRanker.com ---

even.

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also

--- Content provided by FirstRanker.com ---

the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.
Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and

--- Content provided by FirstRanker.com ---

also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

--- Content provided by FirstRanker.com ---

Input Checker output Generator output
A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101

--- Content provided by FirstRanker.com ---

0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111

--- Content provided by FirstRanker.com ---

1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000

--- Content provided by FirstRanker.com ---

1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

--- Content provided by FirstRanker.com ---

3. The corresponding outputs are noted.

4. The theoretical and practical values were verified.

--- Content provided by FirstRanker.com ---

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

2. Why parity bit is added to message?

--- Content provided by FirstRanker.com ---

3. What is parity checker?

4. What is odd parity?
5. What is even parity?

--- Content provided by FirstRanker.com ---

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?

--- Content provided by FirstRanker.com ---

11. What is ASCII code?
12. What is hamming code?
13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation

--- Content provided by FirstRanker.com ---

16. List the procedures to convert binary code into gray
17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or

--- Content provided by FirstRanker.com ---

lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines

--- Content provided by FirstRanker.com ---

which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is

--- Content provided by FirstRanker.com ---

used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n

--- Content provided by FirstRanker.com ---

possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4 X 1 MULTIPLEXER

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables

--- Content provided by FirstRanker.com ---

were verified.

Outcome:
At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is multiplexer?
2. What is demultiplexer?
3. What are the advantages of multiplexer?
4. What are the advantages of demultiplexer?
5. What is select signal?

--- Content provided by FirstRanker.com ---

6. How to choose select signal in multiplexer?
7. How to choose select signal in demultiplexer?
8. Write the formula used in select signal.
9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?

--- Content provided by FirstRanker.com ---

11. What is the application of demultiplexer?
12. Draw the truth table of multiplexer.
13. Draw the truth table of demultiplexer.
14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

EXP NO: 11 SHIFT REGISTER

Aim:

To design and implement the various shift register

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2

--- Content provided by FirstRanker.com ---

2. OR gate IC 7432 1
3. IC Trainer kit 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

A register is capable of shifting its binary information in one or both directions is
known as shift register. The logical configuration of shift register consist of a D-Flip flop
cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible

--- Content provided by FirstRanker.com ---

shift register is one that uses only flip flop. The output of a given flip flop is connected to the
input of next flip flop of the register. Each clock pulse shifts the content of register one bit position
to right.
PIN Diagram:

--- Content provided by FirstRanker.com ---

Logic Diagram:
SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth Table:

CLK Serial in Serial out
1 1 0

--- Content provided by FirstRanker.com ---

2 0 0
3 0 0
4 1 1
5 X 0
6 X 0

--- Content provided by FirstRanker.com ---

7 X 1


Logic Diagram:

--- Content provided by FirstRanker.com ---

Serial in parallel out:



Truth Table:

--- Content provided by FirstRanker.com ---

CLK DATA
OUTPUT
Q
A

--- Content provided by FirstRanker.com ---

Q
B
Q
C
Q

--- Content provided by FirstRanker.com ---

D

1 1 1 0 0 0
2 0 0 1 0 0
3 0 0 0 1 1

--- Content provided by FirstRanker.com ---

4 1 1 0 0 1


Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

CLK Q3 Q2 Q1 Q0 O/P
0 1 0 0 1 1

--- Content provided by FirstRanker.com ---

1 0 0 0 0 0
2 0 0 0 0 0
3 0 0 0 0 1

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per circuit diagram
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the implementation of shift registers using flip flops was completed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK

--- Content provided by FirstRanker.com ---

DATA INPUT OUTPUT
D
A D
B D
C D

--- Content provided by FirstRanker.com ---

D Q
A Q
B Q
C Q
D

--- Content provided by FirstRanker.com ---

1 1 0 0 1 1 0 0 1
2 1 0 1 0 1 0 1 0

--- Content provided by FirstRanker.com ---

51 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.12: SYNCHRONOUS UP/DOWN COUNTER

Aim:

--- Content provided by FirstRanker.com ---

To design and implement 3 bit synchronous up/down counter

Apparatus required:

--- Content provided by FirstRanker.com ---

S.No Name of the Apparatus Range Quantity
1. JK Flip Flop IC 7474 2
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1

--- Content provided by FirstRanker.com ---

5 XOR gate IC 7486 1
6 IC Trainer Kit 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

A counter is a register capable of counting number of clock pulse arriving at its clock input.
Counter represents the number of clock pulses arrived. An up/down counter is one that is capable of
progressing in increasing order or decreasing order through a certain sequence. An up/down counter

--- Content provided by FirstRanker.com ---

is also called bidirectional counter. Usually up/down operation of the counter is controlled by up/down
signal. When this signal is high counter goes through up sequence and when up/down signal is low counter
follows reverse sequence.

K map:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

52 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Q Q
t+1 J K
0 0 0 X
0 1 1 X
1 0 X 1

--- Content provided by FirstRanker.com ---

1 1 X 0

State Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Characteristic Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

53 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Input

--- Content provided by FirstRanker.com ---

Up/Down
Present
State
Q
A

--- Content provided by FirstRanker.com ---

Q
B
Q
C

--- Content provided by FirstRanker.com ---

Next State
Q
A+1
Q
B+1

--- Content provided by FirstRanker.com ---

Q
C+1
A
J
A

--- Content provided by FirstRanker.com ---

K
A

B
J

--- Content provided by FirstRanker.com ---

B
K
B

C

--- Content provided by FirstRanker.com ---

J
C
K
C

--- Content provided by FirstRanker.com ---

0 0 0 0 1 1 1 1 X 1 X 1 X
0 1 1 1 1 1 0 X 0 X 0 X 1
0 1 1 0 1 0 1 X 0 X 1 1 X
0 1 0 1 1 0 0 X 0 0 X X 1
0 1 0 0 0 1 1 X 1 1 X 1 X

--- Content provided by FirstRanker.com ---

0 0 1 1 0 1 0 0 X X 0 X 1
0 0 1 0 0 0 1 0 X X 1 1 X
0 0 0 1 0 0 0 0 X 0 X X 1
1 0 0 0 0 0 1 0 X 0 X 1 X
1 0 0 1 0 1 0 0 X 1 X X 1

--- Content provided by FirstRanker.com ---

1 0 1 0 0 1 1 0 X X 0 1 X
1 0 1 1 1 0 0 1 X X 1 X 1
1 1 0 0 1 0 1 X 0 0 X 1 X
1 1 0 1 1 1 0 X 0 1 X X 1
1 1 1 0 1 1 1 X 0 X 0 1 X

--- Content provided by FirstRanker.com ---

1 1 1 1 0 0 0 X 1 X 1 X 1


Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.
Result:

--- Content provided by FirstRanker.com ---

Thus the 3-bit synchronous up/down counters was implemented successfully.
Outcome:

At the completion of an experiment student will able to design the synchronous up/down counter.

--- Content provided by FirstRanker.com ---

54 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12:

SIMULATION OF COMBINATIONAL CIRCUITS USING HDL

--- Content provided by FirstRanker.com ---

Aim:

To write a verilog code for half adder, full adder and multiplexer

--- Content provided by FirstRanker.com ---

Tools Required:
Xilinx 9.2

--- Content provided by FirstRanker.com ---

Program:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Simulation wave for half adder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

55 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

MULTIPLEXER:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Write and draw the Digital logic system.
2. Write the Verilog code for above system.
3. Enter the Verilog code in Xilinx software.

--- Content provided by FirstRanker.com ---

4. Check the syntax and simulate the above Verilog code (using ModelSim or Xilinx) and verify the
output waveform as obtained.
5. Implement the above code in Spartan III using FPGA kit.

Result:

--- Content provided by FirstRanker.com ---

Thus the verilog code for half adder, full adder and multiplexer were simulated and verified
successfully.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to be known the verilog code for half adder,
full adder and multiplexer.

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and

--- Content provided by FirstRanker.com ---

training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.

--- Content provided by FirstRanker.com ---

? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence

--- Content provided by FirstRanker.com ---

To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which

--- Content provided by FirstRanker.com ---

enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a

--- Content provided by FirstRanker.com ---

team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with

--- Content provided by FirstRanker.com ---

commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)


a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.

--- Content provided by FirstRanker.com ---

b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to

--- Content provided by FirstRanker.com ---

analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.

--- Content provided by FirstRanker.com ---

j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.

--- Content provided by FirstRanker.com ---

? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary

--- Content provided by FirstRanker.com ---

functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator

--- Content provided by FirstRanker.com ---

d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.

--- Content provided by FirstRanker.com ---

6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.

--- Content provided by FirstRanker.com ---

? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary

--- Content provided by FirstRanker.com ---

Functions, Code Converters

3.
Implementation of half adder and full adder
4.

--- Content provided by FirstRanker.com ---

Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

7.

--- Content provided by FirstRanker.com ---

Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.

--- Content provided by FirstRanker.com ---

10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

--- Content provided by FirstRanker.com ---

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

8. Connecting wires As required

Theory:
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 and X-OR are known as

--- Content provided by FirstRanker.com ---

universal gates. Basic gates form these 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.

--- Content provided by FirstRanker.com ---

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.
NOT gate
A NOT gate is the physical realization of the complementation operation. The NOT gate is

--- Content provided by FirstRanker.com ---

called an inverter. The output is high when the input is low. The output is low when the input is high.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate

--- Content provided by FirstRanker.com ---

The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive

--- Content provided by FirstRanker.com ---

OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.



8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.

--- Content provided by FirstRanker.com ---

2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.

--- Content provided by FirstRanker.com ---

7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.

--- Content provided by FirstRanker.com ---

12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC

--- Content provided by FirstRanker.com ---

GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

The binary operator OR, AND is said to be commutative if,

--- Content provided by FirstRanker.com ---

1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

3. Distributive Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

6. Complementary Law

1. A+A' = 1

--- Content provided by FirstRanker.com ---

2. A.A' = 0

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual

--- Content provided by FirstRanker.com ---

complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:
1. Obtain the required IC along with the Digital trainer kit.

--- Content provided by FirstRanker.com ---

2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics

--- Content provided by FirstRanker.com ---

5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. EX-OR gate IC 7486 1
6. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

--- Content provided by FirstRanker.com ---

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The

--- Content provided by FirstRanker.com ---

three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

--- Content provided by FirstRanker.com ---

Carry, C = A . B


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1


Sl.No. Input Output
A B S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C


Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained

--- Content provided by FirstRanker.com ---

as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor

--- Content provided by FirstRanker.com ---

Truth table:


Sl.No.
Input Output

--- Content provided by FirstRanker.com ---

A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1

--- Content provided by FirstRanker.com ---

5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are

--- Content provided by FirstRanker.com ---

designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through
the full adder to the output carry C

--- Content provided by FirstRanker.com ---

4
.
4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input

--- Content provided by FirstRanker.com ---

?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

--- Content provided by FirstRanker.com ---

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

--- Content provided by FirstRanker.com ---

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:



24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.

--- Content provided by FirstRanker.com ---

2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was

--- Content provided by FirstRanker.com ---

verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction

--- Content provided by FirstRanker.com ---

A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.

--- Content provided by FirstRanker.com ---

3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?

--- Content provided by FirstRanker.com ---

8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?

--- Content provided by FirstRanker.com ---

13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.6: MAGNITUDE COMPARATOR

Aim:
To design, construct and study the performance of 2 bit magnitude comparator

--- Content provided by FirstRanker.com ---

Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by

--- Content provided by FirstRanker.com ---

three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:



Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0
0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 1
0 0 0 0
0 0 0 0
1 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 0 0 1
0 0 0 1
0 0 1

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.

--- Content provided by FirstRanker.com ---

5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.

--- Content provided by FirstRanker.com ---

10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to

--- Content provided by FirstRanker.com ---

binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert

--- Content provided by FirstRanker.com ---

from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is

--- Content provided by FirstRanker.com ---

C+D has been used to implement partially each of three outputs.



Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:


G3 = B3

--- Content provided by FirstRanker.com ---

K map for G2:

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x

0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0

1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

--- Content provided by FirstRanker.com ---

Result:
Thus the code converters were designed and verified using the corresponding truth table.

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.

--- Content provided by FirstRanker.com ---

1. What is binary code?
2. What is gray code?
3. What are the advantages of gray code?

--- Content provided by FirstRanker.com ---

4. What is unit distance code?
5. What is sequential code?
6. How to convert binary to gray code?
7. How to convert gray to binary code?
8. What is reflective code?

--- Content provided by FirstRanker.com ---

9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.
12. What is K ? Map?
13. Draw the truth table of EX- OR gate.

--- Content provided by FirstRanker.com ---

14. What is SOP?
15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.8: PARITY GENERATORS AND CHECKERS

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity

--- Content provided by FirstRanker.com ---

and even parity numbers using the generators

Apparatus required:

Sl. No Component Type Quantity

--- Content provided by FirstRanker.com ---

1 Trainer Kit - 1
2 EX-OR IC7486 1
3 NOT gate IC 7404 1
4 Connecting wires - Required

--- Content provided by FirstRanker.com ---

Theory:
Parity checking is used for error detection in data transmission.
Odd parity checkers:

--- Content provided by FirstRanker.com ---

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

Even parity checker:

--- Content provided by FirstRanker.com ---

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

Odd parity generators:

--- Content provided by FirstRanker.com ---

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.
Even parity generator:

--- Content provided by FirstRanker.com ---

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

Input Checker output Generator output
A B C D D odd even odd even
0 0 0 1 1 0 00010 00011

--- Content provided by FirstRanker.com ---

0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100

--- Content provided by FirstRanker.com ---

0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111

--- Content provided by FirstRanker.com ---

1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

--- Content provided by FirstRanker.com ---

2. The inputs are given as per the truth table.

3. The corresponding outputs are noted.

4. The theoretical and practical values were verified.

--- Content provided by FirstRanker.com ---

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

2. Why parity bit is added to message?

--- Content provided by FirstRanker.com ---

3. What is parity checker?

4. What is odd parity?
5. What is even parity?

--- Content provided by FirstRanker.com ---

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?
9. What is a sequential code?

--- Content provided by FirstRanker.com ---

10. What is error deducting code?
11. What is ASCII code?
12. What is hamming code?
13. List the binary weighted code.
14. List the binary non weighted code.

--- Content provided by FirstRanker.com ---

15. Write the hamming code equation
16. List the procedures to convert binary code into gray
17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2
n

--- Content provided by FirstRanker.com ---

input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads

--- Content provided by FirstRanker.com ---

change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2

--- Content provided by FirstRanker.com ---

n
possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.

--- Content provided by FirstRanker.com ---

Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

4 X 1 MULTIPLEXER

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Result:

--- Content provided by FirstRanker.com ---

The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

Outcome:
At the completion of an experiment student will able to design the multiplexer and the

--- Content provided by FirstRanker.com ---

demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?
2. What is demultiplexer?
3. What are the advantages of multiplexer?
4. What are the advantages of demultiplexer?

--- Content provided by FirstRanker.com ---

5. What is select signal?
6. How to choose select signal in multiplexer?
7. How to choose select signal in demultiplexer?
8. Write the formula used in select signal.
9. What is the difference between the multiplexer and demultiplexer?

--- Content provided by FirstRanker.com ---

10. What is the application of multiplexer?
11. What is the application of demultiplexer?
12. Draw the truth table of multiplexer.
13. Draw the truth table of demultiplexer.
14. How many select signals are needed in 8*1 multiplexer?

--- Content provided by FirstRanker.com ---

15. How many select signals are needed in 8*1 demultiplexer?



Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

EXP NO: 11 SHIFT REGISTER

Aim:

--- Content provided by FirstRanker.com ---

To design and implement the various shift register

Apparatus required:

Sl. No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. D flip flop IC 7474 2
2. OR gate IC 7432 1
3. IC Trainer kit 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

A register is capable of shifting its binary information in one or both directions is
known as shift register. The logical configuration of shift register consist of a D-Flip flop
cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive

--- Content provided by FirstRanker.com ---

common clock pulses which causes the shift in the output of the flip flop.The simplest possible
shift register is one that uses only flip flop. The output of a given flip flop is connected to the
input of next flip flop of the register. Each clock pulse shifts the content of register one bit position
to right.
PIN Diagram:

--- Content provided by FirstRanker.com ---

Logic Diagram:
SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth Table:

CLK Serial in Serial out

--- Content provided by FirstRanker.com ---

1 1 0
2 0 0
3 0 0
4 1 1
5 X 0

--- Content provided by FirstRanker.com ---

6 X 0
7 X 1


Logic Diagram:

--- Content provided by FirstRanker.com ---

Serial in parallel out:

--- Content provided by FirstRanker.com ---

Truth Table:

CLK DATA
OUTPUT
Q

--- Content provided by FirstRanker.com ---

A
Q
B
Q
C

--- Content provided by FirstRanker.com ---

Q
D

1 1 1 0 0 0
2 0 0 1 0 0

--- Content provided by FirstRanker.com ---

3 0 0 0 1 1
4 1 1 0 0 1


Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

CLK Q3 Q2 Q1 Q0 O/P

--- Content provided by FirstRanker.com ---

0 1 0 0 1 1
1 0 0 0 0 0
2 0 0 0 0 0
3 0 0 0 0 1

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per circuit diagram
2. Logical inputs are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Observe the output and verify the truth table.

Result:

Thus the implementation of shift registers using flip flops was completed successfully.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK
DATA INPUT OUTPUT
D
A D
B D

--- Content provided by FirstRanker.com ---

C D
D Q
A Q
B Q
C Q

--- Content provided by FirstRanker.com ---

D
1 1 0 0 1 1 0 0 1
2 1 0 1 0 1 0 1 0

--- Content provided by FirstRanker.com ---

51 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.12: SYNCHRONOUS UP/DOWN COUNTER

--- Content provided by FirstRanker.com ---

Aim:

To design and implement 3 bit synchronous up/down counter

Apparatus required:

--- Content provided by FirstRanker.com ---

S.No Name of the Apparatus Range Quantity
1. JK Flip Flop IC 7474 2
2. OR gate IC 7432 1
3. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4. AND gate ( three input ) IC 7411 1
5 XOR gate IC 7486 1
6 IC Trainer Kit 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

A counter is a register capable of counting number of clock pulse arriving at its clock input.
Counter represents the number of clock pulses arrived. An up/down counter is one that is capable of

--- Content provided by FirstRanker.com ---

progressing in increasing order or decreasing order through a certain sequence. An up/down counter
is also called bidirectional counter. Usually up/down operation of the counter is controlled by up/down
signal. When this signal is high counter goes through up sequence and when up/down signal is low counter
follows reverse sequence.

--- Content provided by FirstRanker.com ---

K map:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

52 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Q Q
t+1 J K
0 0 0 X
0 1 1 X

--- Content provided by FirstRanker.com ---

1 0 X 1
1 1 X 0

State Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Characteristic Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

53 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Input
Up/Down
Present
State
Q

--- Content provided by FirstRanker.com ---

A
Q
B
Q
C

--- Content provided by FirstRanker.com ---

Next State
Q
A+1
Q

--- Content provided by FirstRanker.com ---

B+1
Q
C+1
A
J

--- Content provided by FirstRanker.com ---

A
K
A

B

--- Content provided by FirstRanker.com ---

J
B
K
B

--- Content provided by FirstRanker.com ---

C
J
C
K
C

--- Content provided by FirstRanker.com ---

0 0 0 0 1 1 1 1 X 1 X 1 X
0 1 1 1 1 1 0 X 0 X 0 X 1
0 1 1 0 1 0 1 X 0 X 1 1 X
0 1 0 1 1 0 0 X 0 0 X X 1

--- Content provided by FirstRanker.com ---

0 1 0 0 0 1 1 X 1 1 X 1 X
0 0 1 1 0 1 0 0 X X 0 X 1
0 0 1 0 0 0 1 0 X X 1 1 X
0 0 0 1 0 0 0 0 X 0 X X 1
1 0 0 0 0 0 1 0 X 0 X 1 X

--- Content provided by FirstRanker.com ---

1 0 0 1 0 1 0 0 X 1 X X 1
1 0 1 0 0 1 1 0 X X 0 1 X
1 0 1 1 1 0 0 1 X X 1 X 1
1 1 0 0 1 0 1 X 0 0 X 1 X
1 1 0 1 1 1 0 X 0 1 X X 1

--- Content provided by FirstRanker.com ---

1 1 1 0 1 1 1 X 0 X 0 1 X
1 1 1 1 0 0 0 X 1 X 1 X 1


Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:
Thus the 3-bit synchronous up/down counters was implemented successfully.
Outcome:

At the completion of an experiment student will able to design the synchronous up/down counter.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

54 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Expt.No.12:

--- Content provided by FirstRanker.com ---

SIMULATION OF COMBINATIONAL CIRCUITS USING HDL

Aim:

To write a verilog code for half adder, full adder and multiplexer

--- Content provided by FirstRanker.com ---

Tools Required:
Xilinx 9.2

--- Content provided by FirstRanker.com ---

Program:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Simulation wave for half adder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

55 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

MULTIPLEXER:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Write and draw the Digital logic system.
2. Write the Verilog code for above system.

--- Content provided by FirstRanker.com ---

3. Enter the Verilog code in Xilinx software.
4. Check the syntax and simulate the above Verilog code (using ModelSim or Xilinx) and verify the
output waveform as obtained.
5. Implement the above code in Spartan III using FPGA kit.

--- Content provided by FirstRanker.com ---

Result:

Thus the verilog code for half adder, full adder and multiplexer were simulated and verified
successfully.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to be known the verilog code for half adder,
full adder and multiplexer.

--- Content provided by FirstRanker.com ---

56 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.13:

SIMULATION OF SEQUENTIAL CIRCUITS USING HDL

Aim:

--- Content provided by FirstRanker.com ---

To write a verilog code for RS, D, JK flip flop and up counter

Tools required:

--- Content provided by FirstRanker.com ---

Xilinx 9.2

Program:

RS Flip Flop:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

D Flip Flop:

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice



1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and

--- Content provided by FirstRanker.com ---

enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s

--- Content provided by FirstRanker.com ---

needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the

--- Content provided by FirstRanker.com ---

industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism

--- Content provided by FirstRanker.com ---

To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics

--- Content provided by FirstRanker.com ---

To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.

--- Content provided by FirstRanker.com ---

f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also

--- Content provided by FirstRanker.com ---

will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.

--- Content provided by FirstRanker.com ---

? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.

--- Content provided by FirstRanker.com ---

2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker

--- Content provided by FirstRanker.com ---

c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters

--- Content provided by FirstRanker.com ---

5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.

--- Content provided by FirstRanker.com ---

? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.

--- Content provided by FirstRanker.com ---

Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.
Implementation of half adder and full adder

--- Content provided by FirstRanker.com ---

4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.

--- Content provided by FirstRanker.com ---

Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog

--- Content provided by FirstRanker.com ---

HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:
Circuit that takes the logical decision and the process are called logic gates. Each gate has one or

--- Content provided by FirstRanker.com ---

more input and only one output. OR, AND and NOT are basic gates. NAND, NOR and X-OR are known as
universal gates. Basic gates form these 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

--- Content provided by FirstRanker.com ---

low.
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.
NOT gate

--- Content provided by FirstRanker.com ---

A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.

--- Content provided by FirstRanker.com ---

NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is

--- Content provided by FirstRanker.com ---

similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

1. Connections are given as per the circuit diagram.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

At the completion of an experiment student will able to verify the truth

--- Content provided by FirstRanker.com ---

table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?

--- Content provided by FirstRanker.com ---

6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.

--- Content provided by FirstRanker.com ---

11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?

--- Content provided by FirstRanker.com ---

16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:

--- Content provided by FirstRanker.com ---

1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.

--- Content provided by FirstRanker.com ---

4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?

--- Content provided by FirstRanker.com ---

4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.

--- Content provided by FirstRanker.com ---

Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,

--- Content provided by FirstRanker.com ---

S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 1
8. 1 1 1 1 1


Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the

--- Content provided by FirstRanker.com ---

full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.

--- Content provided by FirstRanker.com ---

Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:


Sl.No.

--- Content provided by FirstRanker.com ---

Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to

--- Content provided by FirstRanker.com ---

the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through

--- Content provided by FirstRanker.com ---

the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.

--- Content provided by FirstRanker.com ---

4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:

--- Content provided by FirstRanker.com ---

The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?

--- Content provided by FirstRanker.com ---

2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.

--- Content provided by FirstRanker.com ---

7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?

--- Content provided by FirstRanker.com ---

12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two

--- Content provided by FirstRanker.com ---

numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 1 0
0 0 0 1
0 0 0 1
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

1 0 0
0 0 0 0
0 0 0 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.

--- Content provided by FirstRanker.com ---

4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.

--- Content provided by FirstRanker.com ---

9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION



31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the

--- Content provided by FirstRanker.com ---

two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a

--- Content provided by FirstRanker.com ---

circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are

--- Content provided by FirstRanker.com ---

various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:



32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:



33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G0:



Truth table:

--- Content provided by FirstRanker.com ---

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:



K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:


E3 = B3 + B2 (B0 + B1)

--- Content provided by FirstRanker.com ---

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x

1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1

1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

--- Content provided by FirstRanker.com ---

Result:
Thus the code converters were designed and verified using the corresponding truth table.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the binary to gray converter.


1. What is binary code?
2. What is gray code?

--- Content provided by FirstRanker.com ---

3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?
6. How to convert binary to gray code?
7. How to convert gray to binary code?

--- Content provided by FirstRanker.com ---

8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.
12. What is K ? Map?

--- Content provided by FirstRanker.com ---

13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

Aim:

--- Content provided by FirstRanker.com ---

To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1
3 NOT gate IC 7404 1
4 Connecting wires - Required

--- Content provided by FirstRanker.com ---

Theory:
Parity checking is used for error detection in data transmission.
Odd parity checkers:

--- Content provided by FirstRanker.com ---

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

Even parity checker:

--- Content provided by FirstRanker.com ---

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

Odd parity generators:

--- Content provided by FirstRanker.com ---

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.
Even parity generator:

--- Content provided by FirstRanker.com ---

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

Input Checker output Generator output
A B C D D odd even odd even

--- Content provided by FirstRanker.com ---

0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010

--- Content provided by FirstRanker.com ---

0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100

--- Content provided by FirstRanker.com ---

1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

--- Content provided by FirstRanker.com ---

2. The inputs are given as per the truth table.

3. The corresponding outputs are noted.

--- Content provided by FirstRanker.com ---

4. The theoretical and practical values were verified.

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

--- Content provided by FirstRanker.com ---

2. Why parity bit is added to message?

3. What is parity checker?

4. What is odd parity?

--- Content provided by FirstRanker.com ---

5. What is even parity?

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?

--- Content provided by FirstRanker.com ---

9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?
12. What is hamming code?
13. List the binary weighted code.

--- Content provided by FirstRanker.com ---

14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray
17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2

--- Content provided by FirstRanker.com ---

n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be

--- Content provided by FirstRanker.com ---

selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of

--- Content provided by FirstRanker.com ---

2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-

--- Content provided by FirstRanker.com ---

active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

4 X 1 MULTIPLEXER

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?
2. What is demultiplexer?
3. What are the advantages of multiplexer?

--- Content provided by FirstRanker.com ---

4. What are the advantages of demultiplexer?
5. What is select signal?
6. How to choose select signal in multiplexer?
7. How to choose select signal in demultiplexer?
8. Write the formula used in select signal.

--- Content provided by FirstRanker.com ---

9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?
11. What is the application of demultiplexer?
12. Draw the truth table of multiplexer.
13. Draw the truth table of demultiplexer.

--- Content provided by FirstRanker.com ---

14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

EXP NO: 11 SHIFT REGISTER

Aim:

--- Content provided by FirstRanker.com ---

To design and implement the various shift register

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2
2. OR gate IC 7432 1
3. IC Trainer kit 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

A register is capable of shifting its binary information in one or both directions is
known as shift register. The logical configuration of shift register consist of a D-Flip flop

--- Content provided by FirstRanker.com ---

cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible
shift register is one that uses only flip flop. The output of a given flip flop is connected to the
input of next flip flop of the register. Each clock pulse shifts the content of register one bit position
to right.

--- Content provided by FirstRanker.com ---

PIN Diagram:

Logic Diagram:
SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth Table:

--- Content provided by FirstRanker.com ---

CLK Serial in Serial out
1 1 0
2 0 0
3 0 0
4 1 1

--- Content provided by FirstRanker.com ---

5 X 0
6 X 0
7 X 1

--- Content provided by FirstRanker.com ---

Logic Diagram:

Serial in parallel out:

--- Content provided by FirstRanker.com ---

Truth Table:

CLK DATA
OUTPUT

--- Content provided by FirstRanker.com ---

Q
A
Q
B
Q

--- Content provided by FirstRanker.com ---

C
Q
D

1 1 1 0 0 0

--- Content provided by FirstRanker.com ---

2 0 0 1 0 0
3 0 0 0 1 1
4 1 1 0 0 1

--- Content provided by FirstRanker.com ---

Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

CLK Q3 Q2 Q1 Q0 O/P
0 1 0 0 1 1
1 0 0 0 0 0
2 0 0 0 0 0
3 0 0 0 0 1

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per circuit diagram

--- Content provided by FirstRanker.com ---

2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the implementation of shift registers using flip flops was completed successfully.
Outcome:

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK
DATA INPUT OUTPUT
D
A D

--- Content provided by FirstRanker.com ---

B D
C D
D Q
A Q
B Q

--- Content provided by FirstRanker.com ---

C Q
D
1 1 0 0 1 1 0 0 1
2 1 0 1 0 1 0 1 0

--- Content provided by FirstRanker.com ---

51 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.12: SYNCHRONOUS UP/DOWN COUNTER

--- Content provided by FirstRanker.com ---

Aim:

To design and implement 3 bit synchronous up/down counter

--- Content provided by FirstRanker.com ---

Apparatus required:

S.No Name of the Apparatus Range Quantity
1. JK Flip Flop IC 7474 2
2. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5 XOR gate IC 7486 1
6 IC Trainer Kit 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

A counter is a register capable of counting number of clock pulse arriving at its clock input.

--- Content provided by FirstRanker.com ---

Counter represents the number of clock pulses arrived. An up/down counter is one that is capable of
progressing in increasing order or decreasing order through a certain sequence. An up/down counter
is also called bidirectional counter. Usually up/down operation of the counter is controlled by up/down
signal. When this signal is high counter goes through up sequence and when up/down signal is low counter
follows reverse sequence.

--- Content provided by FirstRanker.com ---

K map:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

52 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Q Q
t+1 J K
0 0 0 X

--- Content provided by FirstRanker.com ---

0 1 1 X
1 0 X 1
1 1 X 0

State Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Characteristic Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

53 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Input
Up/Down
Present
State

--- Content provided by FirstRanker.com ---

Q
A
Q
B
Q

--- Content provided by FirstRanker.com ---

C

Next State
Q
A+1

--- Content provided by FirstRanker.com ---

Q
B+1
Q
C+1
A

--- Content provided by FirstRanker.com ---

J
A
K
A

--- Content provided by FirstRanker.com ---

B
J
B
K
B

--- Content provided by FirstRanker.com ---

C
J
C
K

--- Content provided by FirstRanker.com ---

C

0 0 0 0 1 1 1 1 X 1 X 1 X
0 1 1 1 1 1 0 X 0 X 0 X 1
0 1 1 0 1 0 1 X 0 X 1 1 X

--- Content provided by FirstRanker.com ---

0 1 0 1 1 0 0 X 0 0 X X 1
0 1 0 0 0 1 1 X 1 1 X 1 X
0 0 1 1 0 1 0 0 X X 0 X 1
0 0 1 0 0 0 1 0 X X 1 1 X
0 0 0 1 0 0 0 0 X 0 X X 1

--- Content provided by FirstRanker.com ---

1 0 0 0 0 0 1 0 X 0 X 1 X
1 0 0 1 0 1 0 0 X 1 X X 1
1 0 1 0 0 1 1 0 X X 0 1 X
1 0 1 1 1 0 0 1 X X 1 X 1
1 1 0 0 1 0 1 X 0 0 X 1 X

--- Content provided by FirstRanker.com ---

1 1 0 1 1 1 0 X 0 1 X X 1
1 1 1 0 1 1 1 X 0 X 0 1 X
1 1 1 1 0 0 0 X 1 X 1 X 1

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Observe the output and verify the truth table.
Result:
Thus the 3-bit synchronous up/down counters was implemented successfully.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the synchronous up/down counter.

--- Content provided by FirstRanker.com ---

54 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Expt.No.12:

--- Content provided by FirstRanker.com ---

SIMULATION OF COMBINATIONAL CIRCUITS USING HDL

Aim:

--- Content provided by FirstRanker.com ---

To write a verilog code for half adder, full adder and multiplexer

Tools Required:
Xilinx 9.2

--- Content provided by FirstRanker.com ---

Program:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Simulation wave for half adder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

55 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


MULTIPLEXER:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Write and draw the Digital logic system.

--- Content provided by FirstRanker.com ---

2. Write the Verilog code for above system.
3. Enter the Verilog code in Xilinx software.
4. Check the syntax and simulate the above Verilog code (using ModelSim or Xilinx) and verify the
output waveform as obtained.
5. Implement the above code in Spartan III using FPGA kit.

--- Content provided by FirstRanker.com ---

Result:

Thus the verilog code for half adder, full adder and multiplexer were simulated and verified
successfully.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to be known the verilog code for half adder,
full adder and multiplexer.

--- Content provided by FirstRanker.com ---

56 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.13:

SIMULATION OF SEQUENTIAL CIRCUITS USING HDL

--- Content provided by FirstRanker.com ---

Aim:

To write a verilog code for RS, D, JK flip flop and up counter

Tools required:

--- Content provided by FirstRanker.com ---

Xilinx 9.2

Program:

--- Content provided by FirstRanker.com ---

RS Flip Flop:

--- Content provided by FirstRanker.com ---

D Flip Flop:

--- Content provided by FirstRanker.com ---

57 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

JK Flip Flop:

--- Content provided by FirstRanker.com ---

Up Counter:

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________

--- Content provided by FirstRanker.com ---

Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics

--- Content provided by FirstRanker.com ---

Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.

--- Content provided by FirstRanker.com ---

? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of

--- Content provided by FirstRanker.com ---

engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.

--- Content provided by FirstRanker.com ---

d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.

--- Content provided by FirstRanker.com ---

h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:

--- Content provided by FirstRanker.com ---

? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL

--- Content provided by FirstRanker.com ---

List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:

--- Content provided by FirstRanker.com ---

a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:

--- Content provided by FirstRanker.com ---

a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.

--- Content provided by FirstRanker.com ---

? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.

--- Content provided by FirstRanker.com ---

Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.

--- Content provided by FirstRanker.com ---

Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI

--- Content provided by FirstRanker.com ---

Devices

7.
Design and Implementation of Magnitude Comparator.
8.

--- Content provided by FirstRanker.com ---

Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.

--- Content provided by FirstRanker.com ---

11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.

--- Content provided by FirstRanker.com ---

Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate

--- Content provided by FirstRanker.com ---

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.
OR gate
The OR gate performs a logical addition commonly known as OR function. The output is

--- Content provided by FirstRanker.com ---

high when any one of the inputs is high. The output is low level when both the inputs are low.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate

--- Content provided by FirstRanker.com ---

The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.

--- Content provided by FirstRanker.com ---

EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?

--- Content provided by FirstRanker.com ---

4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.

--- Content provided by FirstRanker.com ---

9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?

--- Content provided by FirstRanker.com ---

14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C

--- Content provided by FirstRanker.com ---

2. A.(B.C) = (A.B).C

3. Distributive Law

The binary operator OR, AND is said to be distributive if,

--- Content provided by FirstRanker.com ---

1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B

--- Content provided by FirstRanker.com ---

2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B


Design

--- Content provided by FirstRanker.com ---

1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc

--- Content provided by FirstRanker.com ---

.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.



1. What is Demorgan?s law?

--- Content provided by FirstRanker.com ---

2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is

--- Content provided by FirstRanker.com ---

performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1

--- Content provided by FirstRanker.com ---

5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit

--- Content provided by FirstRanker.com ---

is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input

--- Content provided by FirstRanker.com ---

variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be

--- Content provided by FirstRanker.com ---

implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:

--- Content provided by FirstRanker.com ---

To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C

--- Content provided by FirstRanker.com ---

0
and it ripples through
the full adder to the output carry C
4
.

--- Content provided by FirstRanker.com ---

4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0

--- Content provided by FirstRanker.com ---

must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary

--- Content provided by FirstRanker.com ---

adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.

--- Content provided by FirstRanker.com ---

.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0

--- Content provided by FirstRanker.com ---

1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1

--- Content provided by FirstRanker.com ---

1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1



25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.

--- Content provided by FirstRanker.com ---

5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.

--- Content provided by FirstRanker.com ---

10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2

--- Content provided by FirstRanker.com ---

6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:



29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Observe the output and verify the truth table.

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 1 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
1 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?

--- Content provided by FirstRanker.com ---

2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?

--- Content provided by FirstRanker.com ---

7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?

--- Content provided by FirstRanker.com ---

13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The availability of large variety of codes for the same discrete elements of information results in

--- Content provided by FirstRanker.com ---

the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0

--- Content provided by FirstRanker.com ---

and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the

--- Content provided by FirstRanker.com ---

four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter



34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

G3 G2 G1 G0 B3 B2 B1 B0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x

1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

BCD code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for A:


A = X1 X2 + X3 X4 X1

--- Content provided by FirstRanker.com ---

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1

1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

Result:
Thus the code converters were designed and verified using the corresponding truth table.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.

--- Content provided by FirstRanker.com ---

1. What is binary code?
2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?

--- Content provided by FirstRanker.com ---

6. How to convert binary to gray code?
7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?

--- Content provided by FirstRanker.com ---

11. Explain the operation of EX ? OR.
12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?

--- Content provided by FirstRanker.com ---

16. What is minterm?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

--- Content provided by FirstRanker.com ---

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1

--- Content provided by FirstRanker.com ---

3 NOT gate IC 7404 1
4 Connecting wires - Required


Theory:

--- Content provided by FirstRanker.com ---

Parity checking is used for error detection in data transmission.
Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

--- Content provided by FirstRanker.com ---

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

--- Content provided by FirstRanker.com ---

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits

--- Content provided by FirstRanker.com ---

which is an odd parity number.
Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5

--- Content provided by FirstRanker.com ---

bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

--- Content provided by FirstRanker.com ---

Input Checker output Generator output
A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110

--- Content provided by FirstRanker.com ---

0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001

--- Content provided by FirstRanker.com ---

1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011

--- Content provided by FirstRanker.com ---

1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

--- Content provided by FirstRanker.com ---

3. The corresponding outputs are noted.

4. The theoretical and practical values were verified.

Result:

--- Content provided by FirstRanker.com ---

The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker

--- Content provided by FirstRanker.com ---

using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

2. Why parity bit is added to message?

3. What is parity checker?

--- Content provided by FirstRanker.com ---

4. What is odd parity?
5. What is even parity?

6. What are the gates involved for parity generator?

--- Content provided by FirstRanker.com ---

7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?

--- Content provided by FirstRanker.com ---

12. What is hamming code?
13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray

--- Content provided by FirstRanker.com ---

17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input

--- Content provided by FirstRanker.com ---

lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and

--- Content provided by FirstRanker.com ---

steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful

--- Content provided by FirstRanker.com ---

for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection

--- Content provided by FirstRanker.com ---

lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4 X 1 MULTIPLEXER

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?

--- Content provided by FirstRanker.com ---

2. What is demultiplexer?
3. What are the advantages of multiplexer?
4. What are the advantages of demultiplexer?
5. What is select signal?
6. How to choose select signal in multiplexer?

--- Content provided by FirstRanker.com ---

7. How to choose select signal in demultiplexer?
8. Write the formula used in select signal.
9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?
11. What is the application of demultiplexer?

--- Content provided by FirstRanker.com ---

12. Draw the truth table of multiplexer.
13. Draw the truth table of demultiplexer.
14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

EXP NO: 11 SHIFT REGISTER

--- Content provided by FirstRanker.com ---

Aim:

To design and implement the various shift register

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2
2. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

3. IC Trainer kit 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

A register is capable of shifting its binary information in one or both directions is
known as shift register. The logical configuration of shift register consist of a D-Flip flop
cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible
shift register is one that uses only flip flop. The output of a given flip flop is connected to the

--- Content provided by FirstRanker.com ---

input of next flip flop of the register. Each clock pulse shifts the content of register one bit position
to right.
PIN Diagram:

Logic Diagram:

--- Content provided by FirstRanker.com ---

SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth Table:

CLK Serial in Serial out
1 1 0
2 0 0

--- Content provided by FirstRanker.com ---

3 0 0
4 1 1
5 X 0
6 X 0
7 X 1

--- Content provided by FirstRanker.com ---

Logic Diagram:

Serial in parallel out:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

CLK DATA
OUTPUT
Q
A
Q

--- Content provided by FirstRanker.com ---

B
Q
C
Q
D

--- Content provided by FirstRanker.com ---

1 1 1 0 0 0
2 0 0 1 0 0
3 0 0 0 1 1
4 1 1 0 0 1

--- Content provided by FirstRanker.com ---

Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

CLK Q3 Q2 Q1 Q0 O/P
0 1 0 0 1 1
1 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2 0 0 0 0 0
3 0 0 0 0 1

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the implementation of shift registers using flip flops was completed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK
DATA INPUT OUTPUT

--- Content provided by FirstRanker.com ---

D
A D
B D
C D
D Q

--- Content provided by FirstRanker.com ---

A Q
B Q
C Q
D
1 1 0 0 1 1 0 0 1

--- Content provided by FirstRanker.com ---

2 1 0 1 0 1 0 1 0



51 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12: SYNCHRONOUS UP/DOWN COUNTER

Aim:

--- Content provided by FirstRanker.com ---

To design and implement 3 bit synchronous up/down counter

Apparatus required:

S.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. JK Flip Flop IC 7474 2
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5 XOR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6 IC Trainer Kit 1
7. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

A counter is a register capable of counting number of clock pulse arriving at its clock input.
Counter represents the number of clock pulses arrived. An up/down counter is one that is capable of
progressing in increasing order or decreasing order through a certain sequence. An up/down counter
is also called bidirectional counter. Usually up/down operation of the counter is controlled by up/down

--- Content provided by FirstRanker.com ---

signal. When this signal is high counter goes through up sequence and when up/down signal is low counter
follows reverse sequence.

K map:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

52 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Q Q

--- Content provided by FirstRanker.com ---

t+1 J K
0 0 0 X
0 1 1 X
1 0 X 1
1 1 X 0

--- Content provided by FirstRanker.com ---

State Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Characteristic Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

53 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Input
Up/Down

--- Content provided by FirstRanker.com ---

Present
State
Q
A
Q

--- Content provided by FirstRanker.com ---

B
Q
C

Next State

--- Content provided by FirstRanker.com ---

Q
A+1
Q
B+1
Q

--- Content provided by FirstRanker.com ---

C+1
A
J
A
K

--- Content provided by FirstRanker.com ---

A

B
J
B

--- Content provided by FirstRanker.com ---

K
B

C
J

--- Content provided by FirstRanker.com ---

C
K
C

0 0 0 0 1 1 1 1 X 1 X 1 X

--- Content provided by FirstRanker.com ---

0 1 1 1 1 1 0 X 0 X 0 X 1
0 1 1 0 1 0 1 X 0 X 1 1 X
0 1 0 1 1 0 0 X 0 0 X X 1
0 1 0 0 0 1 1 X 1 1 X 1 X
0 0 1 1 0 1 0 0 X X 0 X 1

--- Content provided by FirstRanker.com ---

0 0 1 0 0 0 1 0 X X 1 1 X
0 0 0 1 0 0 0 0 X 0 X X 1
1 0 0 0 0 0 1 0 X 0 X 1 X
1 0 0 1 0 1 0 0 X 1 X X 1
1 0 1 0 0 1 1 0 X X 0 1 X

--- Content provided by FirstRanker.com ---

1 0 1 1 1 0 0 1 X X 1 X 1
1 1 0 0 1 0 1 X 0 0 X 1 X
1 1 0 1 1 1 0 X 0 1 X X 1
1 1 1 0 1 1 1 X 0 X 0 1 X
1 1 1 1 0 0 0 X 1 X 1 X 1

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.
Result:
Thus the 3-bit synchronous up/down counters was implemented successfully.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the synchronous up/down counter.

--- Content provided by FirstRanker.com ---

54 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12:

SIMULATION OF COMBINATIONAL CIRCUITS USING HDL

--- Content provided by FirstRanker.com ---

Aim:

To write a verilog code for half adder, full adder and multiplexer

Tools Required:

--- Content provided by FirstRanker.com ---

Xilinx 9.2



Program:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Simulation wave for half adder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

55 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

MULTIPLEXER:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Write and draw the Digital logic system.
2. Write the Verilog code for above system.
3. Enter the Verilog code in Xilinx software.
4. Check the syntax and simulate the above Verilog code (using ModelSim or Xilinx) and verify the

--- Content provided by FirstRanker.com ---

output waveform as obtained.
5. Implement the above code in Spartan III using FPGA kit.

Result:

--- Content provided by FirstRanker.com ---

Thus the verilog code for half adder, full adder and multiplexer were simulated and verified
successfully.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to be known the verilog code for half adder,
full adder and multiplexer.

--- Content provided by FirstRanker.com ---

56 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.13:

--- Content provided by FirstRanker.com ---

SIMULATION OF SEQUENTIAL CIRCUITS USING HDL

Aim:

To write a verilog code for RS, D, JK flip flop and up counter

--- Content provided by FirstRanker.com ---

Tools required:

Xilinx 9.2

--- Content provided by FirstRanker.com ---

Program:

RS Flip Flop:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

D Flip Flop:

--- Content provided by FirstRanker.com ---

57 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

JK Flip Flop:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Up Counter:

--- Content provided by FirstRanker.com ---

58 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:

--- Content provided by FirstRanker.com ---

Thus the verilog code for RS,D,JK Filp Flop and up counter were simulated and verified
successfully.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to be known the verilog code for RS, D, JK
Filp Flop and up counter .

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different

--- Content provided by FirstRanker.com ---

levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative

--- Content provided by FirstRanker.com ---

Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental

--- Content provided by FirstRanker.com ---

concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.

--- Content provided by FirstRanker.com ---

e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.

--- Content provided by FirstRanker.com ---

i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:
? Understand the various logic gates.

--- Content provided by FirstRanker.com ---

? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:

--- Content provided by FirstRanker.com ---

1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor

--- Content provided by FirstRanker.com ---

b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers

--- Content provided by FirstRanker.com ---

b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:

--- Content provided by FirstRanker.com ---

? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates

--- Content provided by FirstRanker.com ---

2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.

--- Content provided by FirstRanker.com ---

Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and

--- Content provided by FirstRanker.com ---

MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.

--- Content provided by FirstRanker.com ---

9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.

--- Content provided by FirstRanker.com ---

Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

Aim:

--- Content provided by FirstRanker.com ---

To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate
The AND gate performs a logical multiplication commonly known as AND function. The

--- Content provided by FirstRanker.com ---

output is high when both the inputs are high. The output is low level when any one of the inputs is
low.
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.

--- Content provided by FirstRanker.com ---

NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low

--- Content provided by FirstRanker.com ---

and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate

--- Content provided by FirstRanker.com ---

An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?

--- Content provided by FirstRanker.com ---

5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.

--- Content provided by FirstRanker.com ---

10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?

--- Content provided by FirstRanker.com ---

15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

1. A+AB = A

--- Content provided by FirstRanker.com ---

2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.

--- Content provided by FirstRanker.com ---

A.B = A+B


Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.

--- Content provided by FirstRanker.com ---

3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?

--- Content provided by FirstRanker.com ---

3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower

--- Content provided by FirstRanker.com ---

significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output
A B C S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 1 1



17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the

--- Content provided by FirstRanker.com ---

subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the

--- Content provided by FirstRanker.com ---

difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

Difference, DIFF = A B

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be

--- Content provided by FirstRanker.com ---

constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0

--- Content provided by FirstRanker.com ---

and it ripples through
the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing

--- Content provided by FirstRanker.com ---

subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it

--- Content provided by FirstRanker.com ---

becomes subtractor.



23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.

--- Content provided by FirstRanker.com ---

Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.

--- Content provided by FirstRanker.com ---

6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?

--- Content provided by FirstRanker.com ---

11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less

--- Content provided by FirstRanker.com ---

than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 1 0
0 0 0 1
0 0 0 1
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
1 0 0
0 0 0 0
0 0 0 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?

--- Content provided by FirstRanker.com ---

3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?

--- Content provided by FirstRanker.com ---

8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:
To design, construct and study the performance of 4-bit different code converters

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two

--- Content provided by FirstRanker.com ---

systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is

--- Content provided by FirstRanker.com ---

designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-

--- Content provided by FirstRanker.com ---

level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:



B3=G3

--- Content provided by FirstRanker.com ---

K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

G3 G2 G1 G0 B3 B2 B1 B0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:


E3 = B3 + B2 (B0 + B1)

--- Content provided by FirstRanker.com ---

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1

1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table

--- Content provided by FirstRanker.com ---

3. Observe the logical output and verify with the truth tables.

Result:
Thus the code converters were designed and verified using the corresponding truth table.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.


1. What is binary code?

--- Content provided by FirstRanker.com ---

2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?
6. How to convert binary to gray code?

--- Content provided by FirstRanker.com ---

7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.

--- Content provided by FirstRanker.com ---

12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

--- Content provided by FirstRanker.com ---

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1
3 NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4 Connecting wires - Required


Theory:
Parity checking is used for error detection in data transmission.

--- Content provided by FirstRanker.com ---

Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

--- Content provided by FirstRanker.com ---

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

--- Content provided by FirstRanker.com ---

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.

--- Content provided by FirstRanker.com ---

Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

Input Checker output Generator output

--- Content provided by FirstRanker.com ---

A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001

--- Content provided by FirstRanker.com ---

0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010

--- Content provided by FirstRanker.com ---

1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101

--- Content provided by FirstRanker.com ---

1 1 1 1 0 1 11111 11110



Procedure:

--- Content provided by FirstRanker.com ---

1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

3. The corresponding outputs are noted.

--- Content provided by FirstRanker.com ---

4. The theoretical and practical values were verified.

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and

--- Content provided by FirstRanker.com ---

even parity numbers are generated using the corresponding generators.

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



1. What is parity bit?

--- Content provided by FirstRanker.com ---

2. Why parity bit is added to message?

3. What is parity checker?

--- Content provided by FirstRanker.com ---

4. What is odd parity?
5. What is even parity?

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.

--- Content provided by FirstRanker.com ---

8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?
12. What is hamming code?

--- Content provided by FirstRanker.com ---

13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray
17. What are the applications of gray code?

--- Content provided by FirstRanker.com ---

18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

Sl. No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of

--- Content provided by FirstRanker.com ---

selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all

--- Content provided by FirstRanker.com ---

output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A

--- Content provided by FirstRanker.com ---

Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an

--- Content provided by FirstRanker.com ---

enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

4 X 1 MULTIPLEXER

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?
2. What is demultiplexer?

--- Content provided by FirstRanker.com ---

3. What are the advantages of multiplexer?
4. What are the advantages of demultiplexer?
5. What is select signal?
6. How to choose select signal in multiplexer?
7. How to choose select signal in demultiplexer?

--- Content provided by FirstRanker.com ---

8. Write the formula used in select signal.
9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?
11. What is the application of demultiplexer?
12. Draw the truth table of multiplexer.

--- Content provided by FirstRanker.com ---

13. Draw the truth table of demultiplexer.
14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

EXP NO: 11 SHIFT REGISTER

--- Content provided by FirstRanker.com ---

Aim:

To design and implement the various shift register

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2
2. OR gate IC 7432 1
3. IC Trainer kit 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:

A register is capable of shifting its binary information in one or both directions is

--- Content provided by FirstRanker.com ---

known as shift register. The logical configuration of shift register consist of a D-Flip flop
cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible
shift register is one that uses only flip flop. The output of a given flip flop is connected to the
input of next flip flop of the register. Each clock pulse shifts the content of register one bit position

--- Content provided by FirstRanker.com ---

to right.
PIN Diagram:

Logic Diagram:
SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth Table:

--- Content provided by FirstRanker.com ---

CLK Serial in Serial out
1 1 0
2 0 0
3 0 0

--- Content provided by FirstRanker.com ---

4 1 1
5 X 0
6 X 0
7 X 1

--- Content provided by FirstRanker.com ---

Logic Diagram:

Serial in parallel out:

--- Content provided by FirstRanker.com ---

Truth Table:

CLK DATA

--- Content provided by FirstRanker.com ---

OUTPUT
Q
A
Q
B

--- Content provided by FirstRanker.com ---

Q
C
Q
D

--- Content provided by FirstRanker.com ---

1 1 1 0 0 0
2 0 0 1 0 0
3 0 0 0 1 1
4 1 1 0 0 1

--- Content provided by FirstRanker.com ---

Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

CLK Q3 Q2 Q1 Q0 O/P
0 1 0 0 1 1
1 0 0 0 0 0
2 0 0 0 0 0

--- Content provided by FirstRanker.com ---

3 0 0 0 0 1

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the implementation of shift registers using flip flops was completed successfully.
Outcome:

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK
DATA INPUT OUTPUT
D

--- Content provided by FirstRanker.com ---

A D
B D
C D
D Q
A Q

--- Content provided by FirstRanker.com ---

B Q
C Q
D
1 1 0 0 1 1 0 0 1
2 1 0 1 0 1 0 1 0

--- Content provided by FirstRanker.com ---

51 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12: SYNCHRONOUS UP/DOWN COUNTER

Aim:

To design and implement 3 bit synchronous up/down counter

--- Content provided by FirstRanker.com ---

Apparatus required:

S.No Name of the Apparatus Range Quantity
1. JK Flip Flop IC 7474 2

--- Content provided by FirstRanker.com ---

2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5 XOR gate IC 7486 1
6 IC Trainer Kit 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

A counter is a register capable of counting number of clock pulse arriving at its clock input.
Counter represents the number of clock pulses arrived. An up/down counter is one that is capable of
progressing in increasing order or decreasing order through a certain sequence. An up/down counter
is also called bidirectional counter. Usually up/down operation of the counter is controlled by up/down
signal. When this signal is high counter goes through up sequence and when up/down signal is low counter

--- Content provided by FirstRanker.com ---

follows reverse sequence.

K map:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

52 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Q Q
t+1 J K

--- Content provided by FirstRanker.com ---

0 0 0 X
0 1 1 X
1 0 X 1
1 1 X 0

--- Content provided by FirstRanker.com ---

State Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Characteristic Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

53 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Input
Up/Down
Present

--- Content provided by FirstRanker.com ---

State
Q
A
Q
B

--- Content provided by FirstRanker.com ---

Q
C

Next State
Q

--- Content provided by FirstRanker.com ---

A+1
Q
B+1
Q
C+1

--- Content provided by FirstRanker.com ---

A
J
A
K
A

--- Content provided by FirstRanker.com ---

B
J
B
K

--- Content provided by FirstRanker.com ---

B

C
J
C

--- Content provided by FirstRanker.com ---

K
C

0 0 0 0 1 1 1 1 X 1 X 1 X
0 1 1 1 1 1 0 X 0 X 0 X 1

--- Content provided by FirstRanker.com ---

0 1 1 0 1 0 1 X 0 X 1 1 X
0 1 0 1 1 0 0 X 0 0 X X 1
0 1 0 0 0 1 1 X 1 1 X 1 X
0 0 1 1 0 1 0 0 X X 0 X 1
0 0 1 0 0 0 1 0 X X 1 1 X

--- Content provided by FirstRanker.com ---

0 0 0 1 0 0 0 0 X 0 X X 1
1 0 0 0 0 0 1 0 X 0 X 1 X
1 0 0 1 0 1 0 0 X 1 X X 1
1 0 1 0 0 1 1 0 X X 0 1 X
1 0 1 1 1 0 0 1 X X 1 X 1

--- Content provided by FirstRanker.com ---

1 1 0 0 1 0 1 X 0 0 X 1 X
1 1 0 1 1 1 0 X 0 1 X X 1
1 1 1 0 1 1 1 X 0 X 0 1 X
1 1 1 1 0 0 0 X 1 X 1 X 1

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.
Result:
Thus the 3-bit synchronous up/down counters was implemented successfully.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the synchronous up/down counter.

--- Content provided by FirstRanker.com ---

54 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12:

SIMULATION OF COMBINATIONAL CIRCUITS USING HDL

Aim:

--- Content provided by FirstRanker.com ---

To write a verilog code for half adder, full adder and multiplexer

Tools Required:
Xilinx 9.2

--- Content provided by FirstRanker.com ---

Program:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Simulation wave for half adder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

55 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


MULTIPLEXER:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Write and draw the Digital logic system.
2. Write the Verilog code for above system.
3. Enter the Verilog code in Xilinx software.
4. Check the syntax and simulate the above Verilog code (using ModelSim or Xilinx) and verify the
output waveform as obtained.

--- Content provided by FirstRanker.com ---

5. Implement the above code in Spartan III using FPGA kit.

Result:

Thus the verilog code for half adder, full adder and multiplexer were simulated and verified

--- Content provided by FirstRanker.com ---

successfully.

Outcome:

At the completion of an experiment student will able to be known the verilog code for half adder,

--- Content provided by FirstRanker.com ---

full adder and multiplexer.

--- Content provided by FirstRanker.com ---

56 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.13:

SIMULATION OF SEQUENTIAL CIRCUITS USING HDL

--- Content provided by FirstRanker.com ---

Aim:

To write a verilog code for RS, D, JK flip flop and up counter

--- Content provided by FirstRanker.com ---

Tools required:

Xilinx 9.2

Program:

--- Content provided by FirstRanker.com ---

RS Flip Flop:

--- Content provided by FirstRanker.com ---

D Flip Flop:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

57 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

JK Flip Flop:

--- Content provided by FirstRanker.com ---

Up Counter:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

58 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:

--- Content provided by FirstRanker.com ---

Thus the verilog code for RS,D,JK Filp Flop and up counter were simulated and verified
successfully.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to be known the verilog code for RS, D, JK
Filp Flop and up counter .

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

59 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

ADDITIONAL EXPERIMENTS

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________

--- Content provided by FirstRanker.com ---

Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics

--- Content provided by FirstRanker.com ---

Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.

--- Content provided by FirstRanker.com ---

? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of

--- Content provided by FirstRanker.com ---

engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.

--- Content provided by FirstRanker.com ---

d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.

--- Content provided by FirstRanker.com ---

h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:

--- Content provided by FirstRanker.com ---

? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL

--- Content provided by FirstRanker.com ---

List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:

--- Content provided by FirstRanker.com ---

a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:

--- Content provided by FirstRanker.com ---

a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.

--- Content provided by FirstRanker.com ---

? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.

--- Content provided by FirstRanker.com ---

Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.

--- Content provided by FirstRanker.com ---

Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI

--- Content provided by FirstRanker.com ---

Devices

7.
Design and Implementation of Magnitude Comparator.
8.

--- Content provided by FirstRanker.com ---

Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.

--- Content provided by FirstRanker.com ---

11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.

--- Content provided by FirstRanker.com ---

Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate

--- Content provided by FirstRanker.com ---

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.
OR gate
The OR gate performs a logical addition commonly known as OR function. The output is

--- Content provided by FirstRanker.com ---

high when any one of the inputs is high. The output is low level when both the inputs are low.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate

--- Content provided by FirstRanker.com ---

The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.

--- Content provided by FirstRanker.com ---

EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?

--- Content provided by FirstRanker.com ---

4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.

--- Content provided by FirstRanker.com ---

9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?

--- Content provided by FirstRanker.com ---

14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C

--- Content provided by FirstRanker.com ---

2. A.(B.C) = (A.B).C

3. Distributive Law

The binary operator OR, AND is said to be distributive if,

--- Content provided by FirstRanker.com ---

1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B

--- Content provided by FirstRanker.com ---

2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B


Design

--- Content provided by FirstRanker.com ---

1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc

--- Content provided by FirstRanker.com ---

.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.



1. What is Demorgan?s law?

--- Content provided by FirstRanker.com ---

2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is

--- Content provided by FirstRanker.com ---

performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1

--- Content provided by FirstRanker.com ---

5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit

--- Content provided by FirstRanker.com ---

is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input

--- Content provided by FirstRanker.com ---

variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be

--- Content provided by FirstRanker.com ---

implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:

--- Content provided by FirstRanker.com ---

To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C

--- Content provided by FirstRanker.com ---

0
and it ripples through
the full adder to the output carry C
4
.

--- Content provided by FirstRanker.com ---

4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0

--- Content provided by FirstRanker.com ---

must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary

--- Content provided by FirstRanker.com ---

adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.

--- Content provided by FirstRanker.com ---

.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0

--- Content provided by FirstRanker.com ---

1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1

--- Content provided by FirstRanker.com ---

1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1



25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.

--- Content provided by FirstRanker.com ---

5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.

--- Content provided by FirstRanker.com ---

10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2

--- Content provided by FirstRanker.com ---

6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:



29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Observe the output and verify the truth table.

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 1 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
1 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?

--- Content provided by FirstRanker.com ---

2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?

--- Content provided by FirstRanker.com ---

7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?

--- Content provided by FirstRanker.com ---

13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The availability of large variety of codes for the same discrete elements of information results in

--- Content provided by FirstRanker.com ---

the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0

--- Content provided by FirstRanker.com ---

and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the

--- Content provided by FirstRanker.com ---

four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter



34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

G3 G2 G1 G0 B3 B2 B1 B0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x

1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

BCD code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for A:


A = X1 X2 + X3 X4 X1

--- Content provided by FirstRanker.com ---

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1

1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

Result:
Thus the code converters were designed and verified using the corresponding truth table.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.

--- Content provided by FirstRanker.com ---

1. What is binary code?
2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?

--- Content provided by FirstRanker.com ---

6. How to convert binary to gray code?
7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?

--- Content provided by FirstRanker.com ---

11. Explain the operation of EX ? OR.
12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?

--- Content provided by FirstRanker.com ---

16. What is minterm?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

--- Content provided by FirstRanker.com ---

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1

--- Content provided by FirstRanker.com ---

3 NOT gate IC 7404 1
4 Connecting wires - Required


Theory:

--- Content provided by FirstRanker.com ---

Parity checking is used for error detection in data transmission.
Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

--- Content provided by FirstRanker.com ---

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

--- Content provided by FirstRanker.com ---

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits

--- Content provided by FirstRanker.com ---

which is an odd parity number.
Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5

--- Content provided by FirstRanker.com ---

bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

--- Content provided by FirstRanker.com ---

Input Checker output Generator output
A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110

--- Content provided by FirstRanker.com ---

0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001

--- Content provided by FirstRanker.com ---

1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011

--- Content provided by FirstRanker.com ---

1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

--- Content provided by FirstRanker.com ---

3. The corresponding outputs are noted.

4. The theoretical and practical values were verified.

Result:

--- Content provided by FirstRanker.com ---

The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker

--- Content provided by FirstRanker.com ---

using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

2. Why parity bit is added to message?

3. What is parity checker?

--- Content provided by FirstRanker.com ---

4. What is odd parity?
5. What is even parity?

6. What are the gates involved for parity generator?

--- Content provided by FirstRanker.com ---

7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?

--- Content provided by FirstRanker.com ---

12. What is hamming code?
13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray

--- Content provided by FirstRanker.com ---

17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input

--- Content provided by FirstRanker.com ---

lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and

--- Content provided by FirstRanker.com ---

steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful

--- Content provided by FirstRanker.com ---

for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection

--- Content provided by FirstRanker.com ---

lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4 X 1 MULTIPLEXER

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?

--- Content provided by FirstRanker.com ---

2. What is demultiplexer?
3. What are the advantages of multiplexer?
4. What are the advantages of demultiplexer?
5. What is select signal?
6. How to choose select signal in multiplexer?

--- Content provided by FirstRanker.com ---

7. How to choose select signal in demultiplexer?
8. Write the formula used in select signal.
9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?
11. What is the application of demultiplexer?

--- Content provided by FirstRanker.com ---

12. Draw the truth table of multiplexer.
13. Draw the truth table of demultiplexer.
14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

EXP NO: 11 SHIFT REGISTER

--- Content provided by FirstRanker.com ---

Aim:

To design and implement the various shift register

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2
2. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

3. IC Trainer kit 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

A register is capable of shifting its binary information in one or both directions is
known as shift register. The logical configuration of shift register consist of a D-Flip flop
cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible
shift register is one that uses only flip flop. The output of a given flip flop is connected to the

--- Content provided by FirstRanker.com ---

input of next flip flop of the register. Each clock pulse shifts the content of register one bit position
to right.
PIN Diagram:

Logic Diagram:

--- Content provided by FirstRanker.com ---

SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth Table:

CLK Serial in Serial out
1 1 0
2 0 0

--- Content provided by FirstRanker.com ---

3 0 0
4 1 1
5 X 0
6 X 0
7 X 1

--- Content provided by FirstRanker.com ---

Logic Diagram:

Serial in parallel out:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

CLK DATA
OUTPUT
Q
A
Q

--- Content provided by FirstRanker.com ---

B
Q
C
Q
D

--- Content provided by FirstRanker.com ---

1 1 1 0 0 0
2 0 0 1 0 0
3 0 0 0 1 1
4 1 1 0 0 1

--- Content provided by FirstRanker.com ---

Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

CLK Q3 Q2 Q1 Q0 O/P
0 1 0 0 1 1
1 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2 0 0 0 0 0
3 0 0 0 0 1

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the implementation of shift registers using flip flops was completed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK
DATA INPUT OUTPUT

--- Content provided by FirstRanker.com ---

D
A D
B D
C D
D Q

--- Content provided by FirstRanker.com ---

A Q
B Q
C Q
D
1 1 0 0 1 1 0 0 1

--- Content provided by FirstRanker.com ---

2 1 0 1 0 1 0 1 0



51 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12: SYNCHRONOUS UP/DOWN COUNTER

Aim:

--- Content provided by FirstRanker.com ---

To design and implement 3 bit synchronous up/down counter

Apparatus required:

S.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. JK Flip Flop IC 7474 2
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5 XOR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6 IC Trainer Kit 1
7. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

A counter is a register capable of counting number of clock pulse arriving at its clock input.
Counter represents the number of clock pulses arrived. An up/down counter is one that is capable of
progressing in increasing order or decreasing order through a certain sequence. An up/down counter
is also called bidirectional counter. Usually up/down operation of the counter is controlled by up/down

--- Content provided by FirstRanker.com ---

signal. When this signal is high counter goes through up sequence and when up/down signal is low counter
follows reverse sequence.

K map:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

52 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Q Q

--- Content provided by FirstRanker.com ---

t+1 J K
0 0 0 X
0 1 1 X
1 0 X 1
1 1 X 0

--- Content provided by FirstRanker.com ---

State Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Characteristic Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

53 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Input
Up/Down

--- Content provided by FirstRanker.com ---

Present
State
Q
A
Q

--- Content provided by FirstRanker.com ---

B
Q
C

Next State

--- Content provided by FirstRanker.com ---

Q
A+1
Q
B+1
Q

--- Content provided by FirstRanker.com ---

C+1
A
J
A
K

--- Content provided by FirstRanker.com ---

A

B
J
B

--- Content provided by FirstRanker.com ---

K
B

C
J

--- Content provided by FirstRanker.com ---

C
K
C

0 0 0 0 1 1 1 1 X 1 X 1 X

--- Content provided by FirstRanker.com ---

0 1 1 1 1 1 0 X 0 X 0 X 1
0 1 1 0 1 0 1 X 0 X 1 1 X
0 1 0 1 1 0 0 X 0 0 X X 1
0 1 0 0 0 1 1 X 1 1 X 1 X
0 0 1 1 0 1 0 0 X X 0 X 1

--- Content provided by FirstRanker.com ---

0 0 1 0 0 0 1 0 X X 1 1 X
0 0 0 1 0 0 0 0 X 0 X X 1
1 0 0 0 0 0 1 0 X 0 X 1 X
1 0 0 1 0 1 0 0 X 1 X X 1
1 0 1 0 0 1 1 0 X X 0 1 X

--- Content provided by FirstRanker.com ---

1 0 1 1 1 0 0 1 X X 1 X 1
1 1 0 0 1 0 1 X 0 0 X 1 X
1 1 0 1 1 1 0 X 0 1 X X 1
1 1 1 0 1 1 1 X 0 X 0 1 X
1 1 1 1 0 0 0 X 1 X 1 X 1

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.
Result:
Thus the 3-bit synchronous up/down counters was implemented successfully.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the synchronous up/down counter.

--- Content provided by FirstRanker.com ---

54 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12:

SIMULATION OF COMBINATIONAL CIRCUITS USING HDL

--- Content provided by FirstRanker.com ---

Aim:

To write a verilog code for half adder, full adder and multiplexer

Tools Required:

--- Content provided by FirstRanker.com ---

Xilinx 9.2



Program:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Simulation wave for half adder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

55 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

MULTIPLEXER:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Write and draw the Digital logic system.
2. Write the Verilog code for above system.
3. Enter the Verilog code in Xilinx software.
4. Check the syntax and simulate the above Verilog code (using ModelSim or Xilinx) and verify the

--- Content provided by FirstRanker.com ---

output waveform as obtained.
5. Implement the above code in Spartan III using FPGA kit.

Result:

--- Content provided by FirstRanker.com ---

Thus the verilog code for half adder, full adder and multiplexer were simulated and verified
successfully.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to be known the verilog code for half adder,
full adder and multiplexer.

--- Content provided by FirstRanker.com ---

56 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.13:

--- Content provided by FirstRanker.com ---

SIMULATION OF SEQUENTIAL CIRCUITS USING HDL

Aim:

To write a verilog code for RS, D, JK flip flop and up counter

--- Content provided by FirstRanker.com ---

Tools required:

Xilinx 9.2

--- Content provided by FirstRanker.com ---

Program:

RS Flip Flop:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

D Flip Flop:

--- Content provided by FirstRanker.com ---

57 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

JK Flip Flop:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Up Counter:

--- Content provided by FirstRanker.com ---

58 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:

--- Content provided by FirstRanker.com ---

Thus the verilog code for RS,D,JK Filp Flop and up counter were simulated and verified
successfully.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to be known the verilog code for RS, D, JK
Filp Flop and up counter .

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

59 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

ADDITIONAL EXPERIMENTS

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

60 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Expt.No.8: ENCODER AND DECODER

--- Content provided by FirstRanker.com ---

Aim:

To study the operation of encoder and decoder circuits using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No Name of the Apparatus Range Quantity
1. Digital IC trainer 1
2. NOT Gate IC 7404 1

--- Content provided by FirstRanker.com ---

3. OR Gate IC 7432 1
4. AND Gate IC7408 1
5. Bread Board 1
6. NOT Gate IC7404 1
8. Connecting wires and probes As required

--- Content provided by FirstRanker.com ---

Theory:
Decoder
In digital electronics, a decoder can take the form of a multiple-input, multiple-output logic circuit that
converts coded inputs into coded outputs, where the input and output codes are different e.g. n-to-2n ,

--- Content provided by FirstRanker.com ---

binary-coded decimal decoders. Decoding is necessary in applications such as data multiplexing, 7
segment display and memory address decoding.
The example decoder circuit would be an AND gate because the output of an AND gate is "High" (1) only
when all its inputs are "High." Such output is called as "active High output". If instead of AND gate, the
NAND gate is connected the output will be "Low" (0) only when all its inputs are "High". Such output is

--- Content provided by FirstRanker.com ---

called as "active low output".
A slightly more complex decoder would be the n-to-2n type binary decoders. These types of decoders are
combinational circuits that convert binary information from 'n' coded inputs to a maximum of 2n unique
outputs. In case the 'n' bit coded information has unused bit combinations, the decoder may have less than
2n outputs. 2-to-4 decoder, 3-to-8 decoder or 4-to-16 decoder are other examples.

--- Content provided by FirstRanker.com ---

The input to a decoder is parallel binary number and it is used to detect the presence of a particular
binary number at the input. The output indicates presence or absence of specific number at the decoder
input. An encoder is a device, circuit, transducer, software program, algorithm or person that converts
information from one format or code to another. The purpose of encoder is standardization, speed,
secrecy, security, or saving space by shrinking size. Encoders are combinational logic circuits and they are

--- Content provided by FirstRanker.com ---

exactly opposite of decoders. They accept one or more inputs and generate a multibit output code.
Encoders perform exactly reverse operation than decoder. An encoder has M input and N output lines. Out
FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________

--- Content provided by FirstRanker.com ---

Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics

--- Content provided by FirstRanker.com ---

Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.

--- Content provided by FirstRanker.com ---

? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of

--- Content provided by FirstRanker.com ---

engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.

--- Content provided by FirstRanker.com ---

d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.

--- Content provided by FirstRanker.com ---

h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:

--- Content provided by FirstRanker.com ---

? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL

--- Content provided by FirstRanker.com ---

List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:

--- Content provided by FirstRanker.com ---

a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:

--- Content provided by FirstRanker.com ---

a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.

--- Content provided by FirstRanker.com ---

? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.

--- Content provided by FirstRanker.com ---

Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.

--- Content provided by FirstRanker.com ---

Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI

--- Content provided by FirstRanker.com ---

Devices

7.
Design and Implementation of Magnitude Comparator.
8.

--- Content provided by FirstRanker.com ---

Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.

--- Content provided by FirstRanker.com ---

11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.

--- Content provided by FirstRanker.com ---

Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate

--- Content provided by FirstRanker.com ---

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.
OR gate
The OR gate performs a logical addition commonly known as OR function. The output is

--- Content provided by FirstRanker.com ---

high when any one of the inputs is high. The output is low level when both the inputs are low.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate

--- Content provided by FirstRanker.com ---

The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.

--- Content provided by FirstRanker.com ---

EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?

--- Content provided by FirstRanker.com ---

4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.

--- Content provided by FirstRanker.com ---

9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?

--- Content provided by FirstRanker.com ---

14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C

--- Content provided by FirstRanker.com ---

2. A.(B.C) = (A.B).C

3. Distributive Law

The binary operator OR, AND is said to be distributive if,

--- Content provided by FirstRanker.com ---

1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B

--- Content provided by FirstRanker.com ---

2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B


Design

--- Content provided by FirstRanker.com ---

1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc

--- Content provided by FirstRanker.com ---

.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.



1. What is Demorgan?s law?

--- Content provided by FirstRanker.com ---

2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is

--- Content provided by FirstRanker.com ---

performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1

--- Content provided by FirstRanker.com ---

5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit

--- Content provided by FirstRanker.com ---

is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input

--- Content provided by FirstRanker.com ---

variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be

--- Content provided by FirstRanker.com ---

implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:

--- Content provided by FirstRanker.com ---

To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C

--- Content provided by FirstRanker.com ---

0
and it ripples through
the full adder to the output carry C
4
.

--- Content provided by FirstRanker.com ---

4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0

--- Content provided by FirstRanker.com ---

must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary

--- Content provided by FirstRanker.com ---

adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.

--- Content provided by FirstRanker.com ---

.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0

--- Content provided by FirstRanker.com ---

1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1

--- Content provided by FirstRanker.com ---

1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1



25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.

--- Content provided by FirstRanker.com ---

5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.

--- Content provided by FirstRanker.com ---

10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2

--- Content provided by FirstRanker.com ---

6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:



29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Observe the output and verify the truth table.

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 1 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
1 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?

--- Content provided by FirstRanker.com ---

2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?

--- Content provided by FirstRanker.com ---

7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?

--- Content provided by FirstRanker.com ---

13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The availability of large variety of codes for the same discrete elements of information results in

--- Content provided by FirstRanker.com ---

the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0

--- Content provided by FirstRanker.com ---

and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the

--- Content provided by FirstRanker.com ---

four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter



34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

G3 G2 G1 G0 B3 B2 B1 B0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x

1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

BCD code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for A:


A = X1 X2 + X3 X4 X1

--- Content provided by FirstRanker.com ---

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1

1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

Result:
Thus the code converters were designed and verified using the corresponding truth table.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.

--- Content provided by FirstRanker.com ---

1. What is binary code?
2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?

--- Content provided by FirstRanker.com ---

6. How to convert binary to gray code?
7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?

--- Content provided by FirstRanker.com ---

11. Explain the operation of EX ? OR.
12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?

--- Content provided by FirstRanker.com ---

16. What is minterm?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

--- Content provided by FirstRanker.com ---

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1

--- Content provided by FirstRanker.com ---

3 NOT gate IC 7404 1
4 Connecting wires - Required


Theory:

--- Content provided by FirstRanker.com ---

Parity checking is used for error detection in data transmission.
Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

--- Content provided by FirstRanker.com ---

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

--- Content provided by FirstRanker.com ---

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits

--- Content provided by FirstRanker.com ---

which is an odd parity number.
Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5

--- Content provided by FirstRanker.com ---

bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

--- Content provided by FirstRanker.com ---

Input Checker output Generator output
A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110

--- Content provided by FirstRanker.com ---

0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001

--- Content provided by FirstRanker.com ---

1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011

--- Content provided by FirstRanker.com ---

1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

--- Content provided by FirstRanker.com ---

3. The corresponding outputs are noted.

4. The theoretical and practical values were verified.

Result:

--- Content provided by FirstRanker.com ---

The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker

--- Content provided by FirstRanker.com ---

using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

2. Why parity bit is added to message?

3. What is parity checker?

--- Content provided by FirstRanker.com ---

4. What is odd parity?
5. What is even parity?

6. What are the gates involved for parity generator?

--- Content provided by FirstRanker.com ---

7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?

--- Content provided by FirstRanker.com ---

12. What is hamming code?
13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray

--- Content provided by FirstRanker.com ---

17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input

--- Content provided by FirstRanker.com ---

lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and

--- Content provided by FirstRanker.com ---

steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful

--- Content provided by FirstRanker.com ---

for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection

--- Content provided by FirstRanker.com ---

lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4 X 1 MULTIPLEXER

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?

--- Content provided by FirstRanker.com ---

2. What is demultiplexer?
3. What are the advantages of multiplexer?
4. What are the advantages of demultiplexer?
5. What is select signal?
6. How to choose select signal in multiplexer?

--- Content provided by FirstRanker.com ---

7. How to choose select signal in demultiplexer?
8. Write the formula used in select signal.
9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?
11. What is the application of demultiplexer?

--- Content provided by FirstRanker.com ---

12. Draw the truth table of multiplexer.
13. Draw the truth table of demultiplexer.
14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

EXP NO: 11 SHIFT REGISTER

--- Content provided by FirstRanker.com ---

Aim:

To design and implement the various shift register

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2
2. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

3. IC Trainer kit 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

A register is capable of shifting its binary information in one or both directions is
known as shift register. The logical configuration of shift register consist of a D-Flip flop
cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible
shift register is one that uses only flip flop. The output of a given flip flop is connected to the

--- Content provided by FirstRanker.com ---

input of next flip flop of the register. Each clock pulse shifts the content of register one bit position
to right.
PIN Diagram:

Logic Diagram:

--- Content provided by FirstRanker.com ---

SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth Table:

CLK Serial in Serial out
1 1 0
2 0 0

--- Content provided by FirstRanker.com ---

3 0 0
4 1 1
5 X 0
6 X 0
7 X 1

--- Content provided by FirstRanker.com ---

Logic Diagram:

Serial in parallel out:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

CLK DATA
OUTPUT
Q
A
Q

--- Content provided by FirstRanker.com ---

B
Q
C
Q
D

--- Content provided by FirstRanker.com ---

1 1 1 0 0 0
2 0 0 1 0 0
3 0 0 0 1 1
4 1 1 0 0 1

--- Content provided by FirstRanker.com ---

Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

CLK Q3 Q2 Q1 Q0 O/P
0 1 0 0 1 1
1 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2 0 0 0 0 0
3 0 0 0 0 1

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the implementation of shift registers using flip flops was completed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK
DATA INPUT OUTPUT

--- Content provided by FirstRanker.com ---

D
A D
B D
C D
D Q

--- Content provided by FirstRanker.com ---

A Q
B Q
C Q
D
1 1 0 0 1 1 0 0 1

--- Content provided by FirstRanker.com ---

2 1 0 1 0 1 0 1 0



51 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12: SYNCHRONOUS UP/DOWN COUNTER

Aim:

--- Content provided by FirstRanker.com ---

To design and implement 3 bit synchronous up/down counter

Apparatus required:

S.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. JK Flip Flop IC 7474 2
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5 XOR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6 IC Trainer Kit 1
7. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

A counter is a register capable of counting number of clock pulse arriving at its clock input.
Counter represents the number of clock pulses arrived. An up/down counter is one that is capable of
progressing in increasing order or decreasing order through a certain sequence. An up/down counter
is also called bidirectional counter. Usually up/down operation of the counter is controlled by up/down

--- Content provided by FirstRanker.com ---

signal. When this signal is high counter goes through up sequence and when up/down signal is low counter
follows reverse sequence.

K map:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

52 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Q Q

--- Content provided by FirstRanker.com ---

t+1 J K
0 0 0 X
0 1 1 X
1 0 X 1
1 1 X 0

--- Content provided by FirstRanker.com ---

State Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Characteristic Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

53 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Input
Up/Down

--- Content provided by FirstRanker.com ---

Present
State
Q
A
Q

--- Content provided by FirstRanker.com ---

B
Q
C

Next State

--- Content provided by FirstRanker.com ---

Q
A+1
Q
B+1
Q

--- Content provided by FirstRanker.com ---

C+1
A
J
A
K

--- Content provided by FirstRanker.com ---

A

B
J
B

--- Content provided by FirstRanker.com ---

K
B

C
J

--- Content provided by FirstRanker.com ---

C
K
C

0 0 0 0 1 1 1 1 X 1 X 1 X

--- Content provided by FirstRanker.com ---

0 1 1 1 1 1 0 X 0 X 0 X 1
0 1 1 0 1 0 1 X 0 X 1 1 X
0 1 0 1 1 0 0 X 0 0 X X 1
0 1 0 0 0 1 1 X 1 1 X 1 X
0 0 1 1 0 1 0 0 X X 0 X 1

--- Content provided by FirstRanker.com ---

0 0 1 0 0 0 1 0 X X 1 1 X
0 0 0 1 0 0 0 0 X 0 X X 1
1 0 0 0 0 0 1 0 X 0 X 1 X
1 0 0 1 0 1 0 0 X 1 X X 1
1 0 1 0 0 1 1 0 X X 0 1 X

--- Content provided by FirstRanker.com ---

1 0 1 1 1 0 0 1 X X 1 X 1
1 1 0 0 1 0 1 X 0 0 X 1 X
1 1 0 1 1 1 0 X 0 1 X X 1
1 1 1 0 1 1 1 X 0 X 0 1 X
1 1 1 1 0 0 0 X 1 X 1 X 1

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.
Result:
Thus the 3-bit synchronous up/down counters was implemented successfully.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the synchronous up/down counter.

--- Content provided by FirstRanker.com ---

54 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12:

SIMULATION OF COMBINATIONAL CIRCUITS USING HDL

--- Content provided by FirstRanker.com ---

Aim:

To write a verilog code for half adder, full adder and multiplexer

Tools Required:

--- Content provided by FirstRanker.com ---

Xilinx 9.2



Program:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Simulation wave for half adder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

55 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

MULTIPLEXER:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Write and draw the Digital logic system.
2. Write the Verilog code for above system.
3. Enter the Verilog code in Xilinx software.
4. Check the syntax and simulate the above Verilog code (using ModelSim or Xilinx) and verify the

--- Content provided by FirstRanker.com ---

output waveform as obtained.
5. Implement the above code in Spartan III using FPGA kit.

Result:

--- Content provided by FirstRanker.com ---

Thus the verilog code for half adder, full adder and multiplexer were simulated and verified
successfully.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to be known the verilog code for half adder,
full adder and multiplexer.

--- Content provided by FirstRanker.com ---

56 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.13:

--- Content provided by FirstRanker.com ---

SIMULATION OF SEQUENTIAL CIRCUITS USING HDL

Aim:

To write a verilog code for RS, D, JK flip flop and up counter

--- Content provided by FirstRanker.com ---

Tools required:

Xilinx 9.2

--- Content provided by FirstRanker.com ---

Program:

RS Flip Flop:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

D Flip Flop:

--- Content provided by FirstRanker.com ---

57 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

JK Flip Flop:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Up Counter:

--- Content provided by FirstRanker.com ---

58 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:

--- Content provided by FirstRanker.com ---

Thus the verilog code for RS,D,JK Filp Flop and up counter were simulated and verified
successfully.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to be known the verilog code for RS, D, JK
Filp Flop and up counter .

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

59 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

ADDITIONAL EXPERIMENTS

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

60 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Expt.No.8: ENCODER AND DECODER

--- Content provided by FirstRanker.com ---

Aim:

To study the operation of encoder and decoder circuits using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No Name of the Apparatus Range Quantity
1. Digital IC trainer 1
2. NOT Gate IC 7404 1

--- Content provided by FirstRanker.com ---

3. OR Gate IC 7432 1
4. AND Gate IC7408 1
5. Bread Board 1
6. NOT Gate IC7404 1
8. Connecting wires and probes As required

--- Content provided by FirstRanker.com ---

Theory:
Decoder
In digital electronics, a decoder can take the form of a multiple-input, multiple-output logic circuit that
converts coded inputs into coded outputs, where the input and output codes are different e.g. n-to-2n ,

--- Content provided by FirstRanker.com ---

binary-coded decimal decoders. Decoding is necessary in applications such as data multiplexing, 7
segment display and memory address decoding.
The example decoder circuit would be an AND gate because the output of an AND gate is "High" (1) only
when all its inputs are "High." Such output is called as "active High output". If instead of AND gate, the
NAND gate is connected the output will be "Low" (0) only when all its inputs are "High". Such output is

--- Content provided by FirstRanker.com ---

called as "active low output".
A slightly more complex decoder would be the n-to-2n type binary decoders. These types of decoders are
combinational circuits that convert binary information from 'n' coded inputs to a maximum of 2n unique
outputs. In case the 'n' bit coded information has unused bit combinations, the decoder may have less than
2n outputs. 2-to-4 decoder, 3-to-8 decoder or 4-to-16 decoder are other examples.

--- Content provided by FirstRanker.com ---

The input to a decoder is parallel binary number and it is used to detect the presence of a particular
binary number at the input. The output indicates presence or absence of specific number at the decoder
input. An encoder is a device, circuit, transducer, software program, algorithm or person that converts
information from one format or code to another. The purpose of encoder is standardization, speed,
secrecy, security, or saving space by shrinking size. Encoders are combinational logic circuits and they are

--- Content provided by FirstRanker.com ---

exactly opposite of decoders. They accept one or more inputs and generate a multibit output code.
Encoders perform exactly reverse operation than decoder. An encoder has M input and N output lines. Out

--- Content provided by FirstRanker.com ---

61 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

of M input lines only one is activated at a time and produces equivalent code on output N lines. If a device
output code has fewer bits than the input code has, the device is usually called an encoder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Sl.No. Inputs Outputs
D7 D6 D5 D4 D3 D2 D1 D0 A B C
1. 0 0 0 0 0 0 0 1 0 0 0
2. 0 0 0 0 0 0 1 0 0 0 1

--- Content provided by FirstRanker.com ---

3. 0 0 0 0 0 1 0 0 0 1 0
4. 0 0 0 0 1 0 0 0 0 1 1
5. 0 0 0 1 0 0 0 0 1 0 0
6. 0 0 1 0 0 0 0 0 1 0 1
7. 0 1 0 0 0 0 0 0 1 1 0

--- Content provided by FirstRanker.com ---

8. 1 0 0 0 0 0 0 0 1 1 1
Procedure:

1. Make the circuit connections as shown in the figure.

--- Content provided by FirstRanker.com ---

2. Check the corresponding truth table.



Result:

--- Content provided by FirstRanker.com ---

The design of the Encoder and Decoder circuit was done and the input and output were obtained

Outcome:
At the completion of an experiment student will able to design the encoder circuit and the decoder circuit

--- Content provided by FirstRanker.com ---

Sl.No.
Inputs Outputs

--- Content provided by FirstRanker.com ---

A B Y3 Y2 Y1 Y0
1. 0 0 0 0 0 1
2. 0 1 0 0 1 0
3. 1 0 0 1 0 0
4. 1 1 1 0 0 0

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice



1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and

--- Content provided by FirstRanker.com ---

enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s

--- Content provided by FirstRanker.com ---

needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the

--- Content provided by FirstRanker.com ---

industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism

--- Content provided by FirstRanker.com ---

To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics

--- Content provided by FirstRanker.com ---

To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.

--- Content provided by FirstRanker.com ---

f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also

--- Content provided by FirstRanker.com ---

will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.

--- Content provided by FirstRanker.com ---

? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.

--- Content provided by FirstRanker.com ---

2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker

--- Content provided by FirstRanker.com ---

c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters

--- Content provided by FirstRanker.com ---

5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.

--- Content provided by FirstRanker.com ---

? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.

--- Content provided by FirstRanker.com ---

Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.
Implementation of half adder and full adder

--- Content provided by FirstRanker.com ---

4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.

--- Content provided by FirstRanker.com ---

Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog

--- Content provided by FirstRanker.com ---

HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:
Circuit that takes the logical decision and the process are called logic gates. Each gate has one or

--- Content provided by FirstRanker.com ---

more input and only one output. OR, AND and NOT are basic gates. NAND, NOR and X-OR are known as
universal gates. Basic gates form these 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

--- Content provided by FirstRanker.com ---

low.
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.
NOT gate

--- Content provided by FirstRanker.com ---

A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.

--- Content provided by FirstRanker.com ---

NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is

--- Content provided by FirstRanker.com ---

similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

1. Connections are given as per the circuit diagram.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

At the completion of an experiment student will able to verify the truth

--- Content provided by FirstRanker.com ---

table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?

--- Content provided by FirstRanker.com ---

6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.

--- Content provided by FirstRanker.com ---

11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?

--- Content provided by FirstRanker.com ---

16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:

--- Content provided by FirstRanker.com ---

1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.

--- Content provided by FirstRanker.com ---

4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?

--- Content provided by FirstRanker.com ---

4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.

--- Content provided by FirstRanker.com ---

Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,

--- Content provided by FirstRanker.com ---

S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 1
8. 1 1 1 1 1


Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the

--- Content provided by FirstRanker.com ---

full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.

--- Content provided by FirstRanker.com ---

Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:


Sl.No.

--- Content provided by FirstRanker.com ---

Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to

--- Content provided by FirstRanker.com ---

the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through

--- Content provided by FirstRanker.com ---

the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.

--- Content provided by FirstRanker.com ---

4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:

--- Content provided by FirstRanker.com ---

The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?

--- Content provided by FirstRanker.com ---

2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.

--- Content provided by FirstRanker.com ---

7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?

--- Content provided by FirstRanker.com ---

12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two

--- Content provided by FirstRanker.com ---

numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 1 0
0 0 0 1
0 0 0 1
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

1 0 0
0 0 0 0
0 0 0 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.

--- Content provided by FirstRanker.com ---

4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.

--- Content provided by FirstRanker.com ---

9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION



31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the

--- Content provided by FirstRanker.com ---

two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a

--- Content provided by FirstRanker.com ---

circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are

--- Content provided by FirstRanker.com ---

various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:



32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:



33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G0:



Truth table:

--- Content provided by FirstRanker.com ---

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:



K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:


E3 = B3 + B2 (B0 + B1)

--- Content provided by FirstRanker.com ---

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x

1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1

1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

--- Content provided by FirstRanker.com ---

Result:
Thus the code converters were designed and verified using the corresponding truth table.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the binary to gray converter.


1. What is binary code?
2. What is gray code?

--- Content provided by FirstRanker.com ---

3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?
6. How to convert binary to gray code?
7. How to convert gray to binary code?

--- Content provided by FirstRanker.com ---

8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.
12. What is K ? Map?

--- Content provided by FirstRanker.com ---

13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

Aim:

--- Content provided by FirstRanker.com ---

To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1
3 NOT gate IC 7404 1
4 Connecting wires - Required

--- Content provided by FirstRanker.com ---

Theory:
Parity checking is used for error detection in data transmission.
Odd parity checkers:

--- Content provided by FirstRanker.com ---

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

Even parity checker:

--- Content provided by FirstRanker.com ---

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

Odd parity generators:

--- Content provided by FirstRanker.com ---

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.
Even parity generator:

--- Content provided by FirstRanker.com ---

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

Input Checker output Generator output
A B C D D odd even odd even

--- Content provided by FirstRanker.com ---

0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010

--- Content provided by FirstRanker.com ---

0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100

--- Content provided by FirstRanker.com ---

1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

--- Content provided by FirstRanker.com ---

2. The inputs are given as per the truth table.

3. The corresponding outputs are noted.

--- Content provided by FirstRanker.com ---

4. The theoretical and practical values were verified.

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

--- Content provided by FirstRanker.com ---

2. Why parity bit is added to message?

3. What is parity checker?

4. What is odd parity?

--- Content provided by FirstRanker.com ---

5. What is even parity?

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?

--- Content provided by FirstRanker.com ---

9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?
12. What is hamming code?
13. List the binary weighted code.

--- Content provided by FirstRanker.com ---

14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray
17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2

--- Content provided by FirstRanker.com ---

n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be

--- Content provided by FirstRanker.com ---

selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of

--- Content provided by FirstRanker.com ---

2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-

--- Content provided by FirstRanker.com ---

active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

4 X 1 MULTIPLEXER

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?
2. What is demultiplexer?
3. What are the advantages of multiplexer?

--- Content provided by FirstRanker.com ---

4. What are the advantages of demultiplexer?
5. What is select signal?
6. How to choose select signal in multiplexer?
7. How to choose select signal in demultiplexer?
8. Write the formula used in select signal.

--- Content provided by FirstRanker.com ---

9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?
11. What is the application of demultiplexer?
12. Draw the truth table of multiplexer.
13. Draw the truth table of demultiplexer.

--- Content provided by FirstRanker.com ---

14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

EXP NO: 11 SHIFT REGISTER

Aim:

--- Content provided by FirstRanker.com ---

To design and implement the various shift register

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2
2. OR gate IC 7432 1
3. IC Trainer kit 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

A register is capable of shifting its binary information in one or both directions is
known as shift register. The logical configuration of shift register consist of a D-Flip flop

--- Content provided by FirstRanker.com ---

cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible
shift register is one that uses only flip flop. The output of a given flip flop is connected to the
input of next flip flop of the register. Each clock pulse shifts the content of register one bit position
to right.

--- Content provided by FirstRanker.com ---

PIN Diagram:

Logic Diagram:
SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth Table:

--- Content provided by FirstRanker.com ---

CLK Serial in Serial out
1 1 0
2 0 0
3 0 0
4 1 1

--- Content provided by FirstRanker.com ---

5 X 0
6 X 0
7 X 1

--- Content provided by FirstRanker.com ---

Logic Diagram:

Serial in parallel out:

--- Content provided by FirstRanker.com ---

Truth Table:

CLK DATA
OUTPUT

--- Content provided by FirstRanker.com ---

Q
A
Q
B
Q

--- Content provided by FirstRanker.com ---

C
Q
D

1 1 1 0 0 0

--- Content provided by FirstRanker.com ---

2 0 0 1 0 0
3 0 0 0 1 1
4 1 1 0 0 1

--- Content provided by FirstRanker.com ---

Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

CLK Q3 Q2 Q1 Q0 O/P
0 1 0 0 1 1
1 0 0 0 0 0
2 0 0 0 0 0
3 0 0 0 0 1

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per circuit diagram

--- Content provided by FirstRanker.com ---

2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the implementation of shift registers using flip flops was completed successfully.
Outcome:

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK
DATA INPUT OUTPUT
D
A D

--- Content provided by FirstRanker.com ---

B D
C D
D Q
A Q
B Q

--- Content provided by FirstRanker.com ---

C Q
D
1 1 0 0 1 1 0 0 1
2 1 0 1 0 1 0 1 0

--- Content provided by FirstRanker.com ---

51 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.12: SYNCHRONOUS UP/DOWN COUNTER

--- Content provided by FirstRanker.com ---

Aim:

To design and implement 3 bit synchronous up/down counter

--- Content provided by FirstRanker.com ---

Apparatus required:

S.No Name of the Apparatus Range Quantity
1. JK Flip Flop IC 7474 2
2. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5 XOR gate IC 7486 1
6 IC Trainer Kit 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

A counter is a register capable of counting number of clock pulse arriving at its clock input.

--- Content provided by FirstRanker.com ---

Counter represents the number of clock pulses arrived. An up/down counter is one that is capable of
progressing in increasing order or decreasing order through a certain sequence. An up/down counter
is also called bidirectional counter. Usually up/down operation of the counter is controlled by up/down
signal. When this signal is high counter goes through up sequence and when up/down signal is low counter
follows reverse sequence.

--- Content provided by FirstRanker.com ---

K map:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

52 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Q Q
t+1 J K
0 0 0 X

--- Content provided by FirstRanker.com ---

0 1 1 X
1 0 X 1
1 1 X 0

State Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Characteristic Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

53 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Input
Up/Down
Present
State

--- Content provided by FirstRanker.com ---

Q
A
Q
B
Q

--- Content provided by FirstRanker.com ---

C

Next State
Q
A+1

--- Content provided by FirstRanker.com ---

Q
B+1
Q
C+1
A

--- Content provided by FirstRanker.com ---

J
A
K
A

--- Content provided by FirstRanker.com ---

B
J
B
K
B

--- Content provided by FirstRanker.com ---

C
J
C
K

--- Content provided by FirstRanker.com ---

C

0 0 0 0 1 1 1 1 X 1 X 1 X
0 1 1 1 1 1 0 X 0 X 0 X 1
0 1 1 0 1 0 1 X 0 X 1 1 X

--- Content provided by FirstRanker.com ---

0 1 0 1 1 0 0 X 0 0 X X 1
0 1 0 0 0 1 1 X 1 1 X 1 X
0 0 1 1 0 1 0 0 X X 0 X 1
0 0 1 0 0 0 1 0 X X 1 1 X
0 0 0 1 0 0 0 0 X 0 X X 1

--- Content provided by FirstRanker.com ---

1 0 0 0 0 0 1 0 X 0 X 1 X
1 0 0 1 0 1 0 0 X 1 X X 1
1 0 1 0 0 1 1 0 X X 0 1 X
1 0 1 1 1 0 0 1 X X 1 X 1
1 1 0 0 1 0 1 X 0 0 X 1 X

--- Content provided by FirstRanker.com ---

1 1 0 1 1 1 0 X 0 1 X X 1
1 1 1 0 1 1 1 X 0 X 0 1 X
1 1 1 1 0 0 0 X 1 X 1 X 1

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Observe the output and verify the truth table.
Result:
Thus the 3-bit synchronous up/down counters was implemented successfully.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the synchronous up/down counter.

--- Content provided by FirstRanker.com ---

54 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Expt.No.12:

--- Content provided by FirstRanker.com ---

SIMULATION OF COMBINATIONAL CIRCUITS USING HDL

Aim:

--- Content provided by FirstRanker.com ---

To write a verilog code for half adder, full adder and multiplexer

Tools Required:
Xilinx 9.2

--- Content provided by FirstRanker.com ---

Program:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Simulation wave for half adder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

55 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


MULTIPLEXER:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Write and draw the Digital logic system.

--- Content provided by FirstRanker.com ---

2. Write the Verilog code for above system.
3. Enter the Verilog code in Xilinx software.
4. Check the syntax and simulate the above Verilog code (using ModelSim or Xilinx) and verify the
output waveform as obtained.
5. Implement the above code in Spartan III using FPGA kit.

--- Content provided by FirstRanker.com ---

Result:

Thus the verilog code for half adder, full adder and multiplexer were simulated and verified
successfully.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to be known the verilog code for half adder,
full adder and multiplexer.

--- Content provided by FirstRanker.com ---

56 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.13:

SIMULATION OF SEQUENTIAL CIRCUITS USING HDL

--- Content provided by FirstRanker.com ---

Aim:

To write a verilog code for RS, D, JK flip flop and up counter

Tools required:

--- Content provided by FirstRanker.com ---

Xilinx 9.2

Program:

--- Content provided by FirstRanker.com ---

RS Flip Flop:

--- Content provided by FirstRanker.com ---

D Flip Flop:

--- Content provided by FirstRanker.com ---

57 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

JK Flip Flop:

--- Content provided by FirstRanker.com ---

Up Counter:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

58 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:

Thus the verilog code for RS,D,JK Filp Flop and up counter were simulated and verified

--- Content provided by FirstRanker.com ---

successfully.

Outcome:

At the completion of an experiment student will able to be known the verilog code for RS, D, JK

--- Content provided by FirstRanker.com ---

Filp Flop and up counter .

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

59 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

ADDITIONAL EXPERIMENTS

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

60 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.8: ENCODER AND DECODER

Aim:

--- Content provided by FirstRanker.com ---

To study the operation of encoder and decoder circuits using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No Name of the Apparatus Range Quantity
1. Digital IC trainer 1
2. NOT Gate IC 7404 1
3. OR Gate IC 7432 1
4. AND Gate IC7408 1

--- Content provided by FirstRanker.com ---

5. Bread Board 1
6. NOT Gate IC7404 1
8. Connecting wires and probes As required

Theory:

--- Content provided by FirstRanker.com ---

Decoder
In digital electronics, a decoder can take the form of a multiple-input, multiple-output logic circuit that
converts coded inputs into coded outputs, where the input and output codes are different e.g. n-to-2n ,
binary-coded decimal decoders. Decoding is necessary in applications such as data multiplexing, 7
segment display and memory address decoding.

--- Content provided by FirstRanker.com ---

The example decoder circuit would be an AND gate because the output of an AND gate is "High" (1) only
when all its inputs are "High." Such output is called as "active High output". If instead of AND gate, the
NAND gate is connected the output will be "Low" (0) only when all its inputs are "High". Such output is
called as "active low output".
A slightly more complex decoder would be the n-to-2n type binary decoders. These types of decoders are

--- Content provided by FirstRanker.com ---

combinational circuits that convert binary information from 'n' coded inputs to a maximum of 2n unique
outputs. In case the 'n' bit coded information has unused bit combinations, the decoder may have less than
2n outputs. 2-to-4 decoder, 3-to-8 decoder or 4-to-16 decoder are other examples.
The input to a decoder is parallel binary number and it is used to detect the presence of a particular
binary number at the input. The output indicates presence or absence of specific number at the decoder

--- Content provided by FirstRanker.com ---

input. An encoder is a device, circuit, transducer, software program, algorithm or person that converts
information from one format or code to another. The purpose of encoder is standardization, speed,
secrecy, security, or saving space by shrinking size. Encoders are combinational logic circuits and they are
exactly opposite of decoders. They accept one or more inputs and generate a multibit output code.
Encoders perform exactly reverse operation than decoder. An encoder has M input and N output lines. Out

--- Content provided by FirstRanker.com ---

61 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

of M input lines only one is activated at a time and produces equivalent code on output N lines. If a device
output code has fewer bits than the input code has, the device is usually called an encoder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Sl.No. Inputs Outputs

--- Content provided by FirstRanker.com ---

D7 D6 D5 D4 D3 D2 D1 D0 A B C
1. 0 0 0 0 0 0 0 1 0 0 0
2. 0 0 0 0 0 0 1 0 0 0 1
3. 0 0 0 0 0 1 0 0 0 1 0
4. 0 0 0 0 1 0 0 0 0 1 1

--- Content provided by FirstRanker.com ---

5. 0 0 0 1 0 0 0 0 1 0 0
6. 0 0 1 0 0 0 0 0 1 0 1
7. 0 1 0 0 0 0 0 0 1 1 0
8. 1 0 0 0 0 0 0 0 1 1 1
Procedure:

--- Content provided by FirstRanker.com ---

1. Make the circuit connections as shown in the figure.

2. Check the corresponding truth table.

--- Content provided by FirstRanker.com ---

Result:
The design of the Encoder and Decoder circuit was done and the input and output were obtained

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the encoder circuit and the decoder circuit

--- Content provided by FirstRanker.com ---

Sl.No.
Inputs Outputs
A B Y3 Y2 Y1 Y0
1. 0 0 0 0 0 1

--- Content provided by FirstRanker.com ---

2. 0 1 0 0 1 0
3. 1 0 0 1 0 0
4. 1 1 1 0 0 0

--- Content provided by FirstRanker.com ---

62 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


1. What is Encoder?

--- Content provided by FirstRanker.com ---

2. What is decoder?
3. List the application of encoder.
4. List the application of decoder.
5. Draw the truth table of encoder.
6. Draw the truth table of decoder.

--- Content provided by FirstRanker.com ---

7. What are logic gates used encoder?
8. What are logic gates used encoder?
9. What is the difference between decoder with demultiplexer?
10. What is the difference between encoder with multiplexer?
11. How to choose the select signal in encoder?

--- Content provided by FirstRanker.com ---

12. How to choose the select signal in decoder?
13. Draw the logic diagram of encoder.
14. Draw the logic diagram of encoder.
15. What is the difference between encoder with decoder?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

--- Content provided by FirstRanker.com ---

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________

--- Content provided by FirstRanker.com ---

Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL



2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

--- Content provided by FirstRanker.com ---

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics

--- Content provided by FirstRanker.com ---

Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.

--- Content provided by FirstRanker.com ---

? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.

--- Content provided by FirstRanker.com ---

VISION

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)


1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of

--- Content provided by FirstRanker.com ---

engineering enabling them to solve complex problems in order to develop real time applications.

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.

--- Content provided by FirstRanker.com ---

d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.

--- Content provided by FirstRanker.com ---

h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:

--- Content provided by FirstRanker.com ---

? Understand the various logic gates.
? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL

--- Content provided by FirstRanker.com ---

List of experiments:
1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:

--- Content provided by FirstRanker.com ---

a. 4 ? bit binary adder / subtractor
b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:

--- Content provided by FirstRanker.com ---

a. Shift ?registers
b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

--- Content provided by FirstRanker.com ---

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.

--- Content provided by FirstRanker.com ---

? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.

--- Content provided by FirstRanker.com ---

Verification of Boolean Theorems using Digital Logic Gates
2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

--- Content provided by FirstRanker.com ---

3.
Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.

--- Content provided by FirstRanker.com ---

Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI

--- Content provided by FirstRanker.com ---

Devices

7.
Design and Implementation of Magnitude Comparator.
8.

--- Content provided by FirstRanker.com ---

Design and Implementation of Application using Multiplexers / Demultiplexers.
9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.

--- Content provided by FirstRanker.com ---

11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.

--- Content provided by FirstRanker.com ---

Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

--- Content provided by FirstRanker.com ---

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate

--- Content provided by FirstRanker.com ---

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.
OR gate
The OR gate performs a logical addition commonly known as OR function. The output is

--- Content provided by FirstRanker.com ---

high when any one of the inputs is high. The output is low level when both the inputs are low.
NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate

--- Content provided by FirstRanker.com ---

The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.

--- Content provided by FirstRanker.com ---

EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.

--- Content provided by FirstRanker.com ---

Result:

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?

--- Content provided by FirstRanker.com ---

4. What is IC?
5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.

--- Content provided by FirstRanker.com ---

9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?

--- Content provided by FirstRanker.com ---

14. What is meant by etching?
15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2:

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. NAND gate IC 7400 1
6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

--- Content provided by FirstRanker.com ---

1. Commutative Law

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C

--- Content provided by FirstRanker.com ---

2. A.(B.C) = (A.B).C

3. Distributive Law

The binary operator OR, AND is said to be distributive if,

--- Content provided by FirstRanker.com ---

1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

--- Content provided by FirstRanker.com ---

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

1. A+A = A
2. A.A = A

--- Content provided by FirstRanker.com ---

6. Complementary Law

1. A+A' = 1
2. A.A' = 0

--- Content provided by FirstRanker.com ---

7. De Morgan ?s Theorem

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B

--- Content provided by FirstRanker.com ---

2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B


Design

--- Content provided by FirstRanker.com ---

1. Absorption Law

A+AB = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

--- Content provided by FirstRanker.com ---

2. A.A = A

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

--- Content provided by FirstRanker.com ---

A+B = A.B


5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc

--- Content provided by FirstRanker.com ---

.
3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the above stated Boolean laws are verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to know the basic laws with their truth table.



1. What is Demorgan?s law?

--- Content provided by FirstRanker.com ---

2. What is associative law?
3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

--- Content provided by FirstRanker.com ---

1 + 0 = 1

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is

--- Content provided by FirstRanker.com ---

performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B C S C
1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1

--- Content provided by FirstRanker.com ---

5. 1 0 0 1 0
6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7

--- Content provided by FirstRanker.com ---

th
pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

5. EX-OR gate IC 7486 1
6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit

--- Content provided by FirstRanker.com ---

is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input

--- Content provided by FirstRanker.com ---

variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be

--- Content provided by FirstRanker.com ---

implemented with two half subtractors and one OR gate.

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

--- Content provided by FirstRanker.com ---

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 1 1 1
3. 1 0 1 0
4. 1 1 0 0

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

Borrow, BORR = A?. B

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 1
3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:

--- Content provided by FirstRanker.com ---

To design and implement 4-bit adder and subtractor using IC 7483

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

--- Content provided by FirstRanker.com ---

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C

--- Content provided by FirstRanker.com ---

0
and it ripples through
the full adder to the output carry C
4
.

--- Content provided by FirstRanker.com ---

4 BIT Binary subtractor:

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0

--- Content provided by FirstRanker.com ---

must be equal to 1 when performing
subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary

--- Content provided by FirstRanker.com ---

adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.

--- Content provided by FirstRanker.com ---

.
Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design 4-bit binary adder and subtractor

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0

--- Content provided by FirstRanker.com ---

1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1

--- Content provided by FirstRanker.com ---

1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1



25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.

--- Content provided by FirstRanker.com ---

5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.

--- Content provided by FirstRanker.com ---

10. What is combinational circuit?
11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2

--- Content provided by FirstRanker.com ---

6. EX-OR gate IC 7486 1
7. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:



29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Observe the output and verify the truth table.

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
0 1 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 0
0 0 0 0
1 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?

--- Content provided by FirstRanker.com ---

2. What is most significant bit?
3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?

--- Content provided by FirstRanker.com ---

7. What is IC?
8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?

--- Content provided by FirstRanker.com ---

13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The availability of large variety of codes for the same discrete elements of information results in

--- Content provided by FirstRanker.com ---

the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0

--- Content provided by FirstRanker.com ---

and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the

--- Content provided by FirstRanker.com ---

four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter



34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

G3 G2 G1 G0 B3 B2 B1 B0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:

--- Content provided by FirstRanker.com ---

E3 = B3 + B2 (B0 + B1)

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x

1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

BCD code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for A:


A = X1 X2 + X3 X4 X1

--- Content provided by FirstRanker.com ---

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1

1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

Result:
Thus the code converters were designed and verified using the corresponding truth table.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.

--- Content provided by FirstRanker.com ---

1. What is binary code?
2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?

--- Content provided by FirstRanker.com ---

6. How to convert binary to gray code?
7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?

--- Content provided by FirstRanker.com ---

11. Explain the operation of EX ? OR.
12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?

--- Content provided by FirstRanker.com ---

16. What is minterm?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

--- Content provided by FirstRanker.com ---

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1

--- Content provided by FirstRanker.com ---

3 NOT gate IC 7404 1
4 Connecting wires - Required


Theory:

--- Content provided by FirstRanker.com ---

Parity checking is used for error detection in data transmission.
Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

--- Content provided by FirstRanker.com ---

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

--- Content provided by FirstRanker.com ---

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits

--- Content provided by FirstRanker.com ---

which is an odd parity number.
Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5

--- Content provided by FirstRanker.com ---

bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

--- Content provided by FirstRanker.com ---

Input Checker output Generator output
A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110

--- Content provided by FirstRanker.com ---

0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001

--- Content provided by FirstRanker.com ---

1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011

--- Content provided by FirstRanker.com ---

1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

--- Content provided by FirstRanker.com ---

3. The corresponding outputs are noted.

4. The theoretical and practical values were verified.

Result:

--- Content provided by FirstRanker.com ---

The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker

--- Content provided by FirstRanker.com ---

using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

2. Why parity bit is added to message?

3. What is parity checker?

--- Content provided by FirstRanker.com ---

4. What is odd parity?
5. What is even parity?

6. What are the gates involved for parity generator?

--- Content provided by FirstRanker.com ---

7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?

--- Content provided by FirstRanker.com ---

12. What is hamming code?
13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray

--- Content provided by FirstRanker.com ---

17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input

--- Content provided by FirstRanker.com ---

lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and

--- Content provided by FirstRanker.com ---

steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful

--- Content provided by FirstRanker.com ---

for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection

--- Content provided by FirstRanker.com ---

lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4 X 1 MULTIPLEXER

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?

--- Content provided by FirstRanker.com ---

2. What is demultiplexer?
3. What are the advantages of multiplexer?
4. What are the advantages of demultiplexer?
5. What is select signal?
6. How to choose select signal in multiplexer?

--- Content provided by FirstRanker.com ---

7. How to choose select signal in demultiplexer?
8. Write the formula used in select signal.
9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?
11. What is the application of demultiplexer?

--- Content provided by FirstRanker.com ---

12. Draw the truth table of multiplexer.
13. Draw the truth table of demultiplexer.
14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

EXP NO: 11 SHIFT REGISTER

--- Content provided by FirstRanker.com ---

Aim:

To design and implement the various shift register

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2
2. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

3. IC Trainer kit 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

A register is capable of shifting its binary information in one or both directions is
known as shift register. The logical configuration of shift register consist of a D-Flip flop
cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible
shift register is one that uses only flip flop. The output of a given flip flop is connected to the

--- Content provided by FirstRanker.com ---

input of next flip flop of the register. Each clock pulse shifts the content of register one bit position
to right.
PIN Diagram:

Logic Diagram:

--- Content provided by FirstRanker.com ---

SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth Table:

CLK Serial in Serial out
1 1 0
2 0 0

--- Content provided by FirstRanker.com ---

3 0 0
4 1 1
5 X 0
6 X 0
7 X 1

--- Content provided by FirstRanker.com ---

Logic Diagram:

Serial in parallel out:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

CLK DATA
OUTPUT
Q
A
Q

--- Content provided by FirstRanker.com ---

B
Q
C
Q
D

--- Content provided by FirstRanker.com ---

1 1 1 0 0 0
2 0 0 1 0 0
3 0 0 0 1 1
4 1 1 0 0 1

--- Content provided by FirstRanker.com ---

Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

CLK Q3 Q2 Q1 Q0 O/P
0 1 0 0 1 1
1 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2 0 0 0 0 0
3 0 0 0 0 1

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the implementation of shift registers using flip flops was completed successfully.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK
DATA INPUT OUTPUT

--- Content provided by FirstRanker.com ---

D
A D
B D
C D
D Q

--- Content provided by FirstRanker.com ---

A Q
B Q
C Q
D
1 1 0 0 1 1 0 0 1

--- Content provided by FirstRanker.com ---

2 1 0 1 0 1 0 1 0



51 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12: SYNCHRONOUS UP/DOWN COUNTER

Aim:

--- Content provided by FirstRanker.com ---

To design and implement 3 bit synchronous up/down counter

Apparatus required:

S.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. JK Flip Flop IC 7474 2
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5 XOR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6 IC Trainer Kit 1
7. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

A counter is a register capable of counting number of clock pulse arriving at its clock input.
Counter represents the number of clock pulses arrived. An up/down counter is one that is capable of
progressing in increasing order or decreasing order through a certain sequence. An up/down counter
is also called bidirectional counter. Usually up/down operation of the counter is controlled by up/down

--- Content provided by FirstRanker.com ---

signal. When this signal is high counter goes through up sequence and when up/down signal is low counter
follows reverse sequence.

K map:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

52 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Q Q

--- Content provided by FirstRanker.com ---

t+1 J K
0 0 0 X
0 1 1 X
1 0 X 1
1 1 X 0

--- Content provided by FirstRanker.com ---

State Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Characteristic Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

53 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Input
Up/Down

--- Content provided by FirstRanker.com ---

Present
State
Q
A
Q

--- Content provided by FirstRanker.com ---

B
Q
C

Next State

--- Content provided by FirstRanker.com ---

Q
A+1
Q
B+1
Q

--- Content provided by FirstRanker.com ---

C+1
A
J
A
K

--- Content provided by FirstRanker.com ---

A

B
J
B

--- Content provided by FirstRanker.com ---

K
B

C
J

--- Content provided by FirstRanker.com ---

C
K
C

0 0 0 0 1 1 1 1 X 1 X 1 X

--- Content provided by FirstRanker.com ---

0 1 1 1 1 1 0 X 0 X 0 X 1
0 1 1 0 1 0 1 X 0 X 1 1 X
0 1 0 1 1 0 0 X 0 0 X X 1
0 1 0 0 0 1 1 X 1 1 X 1 X
0 0 1 1 0 1 0 0 X X 0 X 1

--- Content provided by FirstRanker.com ---

0 0 1 0 0 0 1 0 X X 1 1 X
0 0 0 1 0 0 0 0 X 0 X X 1
1 0 0 0 0 0 1 0 X 0 X 1 X
1 0 0 1 0 1 0 0 X 1 X X 1
1 0 1 0 0 1 1 0 X X 0 1 X

--- Content provided by FirstRanker.com ---

1 0 1 1 1 0 0 1 X X 1 X 1
1 1 0 0 1 0 1 X 0 0 X 1 X
1 1 0 1 1 1 0 X 0 1 X X 1
1 1 1 0 1 1 1 X 0 X 0 1 X
1 1 1 1 0 0 0 X 1 X 1 X 1

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.
Result:
Thus the 3-bit synchronous up/down counters was implemented successfully.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the synchronous up/down counter.

--- Content provided by FirstRanker.com ---

54 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12:

SIMULATION OF COMBINATIONAL CIRCUITS USING HDL

--- Content provided by FirstRanker.com ---

Aim:

To write a verilog code for half adder, full adder and multiplexer

Tools Required:

--- Content provided by FirstRanker.com ---

Xilinx 9.2



Program:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Simulation wave for half adder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

55 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

MULTIPLEXER:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Write and draw the Digital logic system.
2. Write the Verilog code for above system.
3. Enter the Verilog code in Xilinx software.
4. Check the syntax and simulate the above Verilog code (using ModelSim or Xilinx) and verify the

--- Content provided by FirstRanker.com ---

output waveform as obtained.
5. Implement the above code in Spartan III using FPGA kit.

Result:

--- Content provided by FirstRanker.com ---

Thus the verilog code for half adder, full adder and multiplexer were simulated and verified
successfully.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to be known the verilog code for half adder,
full adder and multiplexer.

--- Content provided by FirstRanker.com ---

56 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.13:

--- Content provided by FirstRanker.com ---

SIMULATION OF SEQUENTIAL CIRCUITS USING HDL

Aim:

To write a verilog code for RS, D, JK flip flop and up counter

--- Content provided by FirstRanker.com ---

Tools required:

Xilinx 9.2

--- Content provided by FirstRanker.com ---

Program:

RS Flip Flop:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

D Flip Flop:

--- Content provided by FirstRanker.com ---

57 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

JK Flip Flop:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Up Counter:

--- Content provided by FirstRanker.com ---

58 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:

--- Content provided by FirstRanker.com ---

Thus the verilog code for RS,D,JK Filp Flop and up counter were simulated and verified
successfully.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to be known the verilog code for RS, D, JK
Filp Flop and up counter .

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

59 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

ADDITIONAL EXPERIMENTS

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

60 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Expt.No.8: ENCODER AND DECODER

--- Content provided by FirstRanker.com ---

Aim:

To study the operation of encoder and decoder circuits using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No Name of the Apparatus Range Quantity
1. Digital IC trainer 1
2. NOT Gate IC 7404 1

--- Content provided by FirstRanker.com ---

3. OR Gate IC 7432 1
4. AND Gate IC7408 1
5. Bread Board 1
6. NOT Gate IC7404 1
8. Connecting wires and probes As required

--- Content provided by FirstRanker.com ---

Theory:
Decoder
In digital electronics, a decoder can take the form of a multiple-input, multiple-output logic circuit that
converts coded inputs into coded outputs, where the input and output codes are different e.g. n-to-2n ,

--- Content provided by FirstRanker.com ---

binary-coded decimal decoders. Decoding is necessary in applications such as data multiplexing, 7
segment display and memory address decoding.
The example decoder circuit would be an AND gate because the output of an AND gate is "High" (1) only
when all its inputs are "High." Such output is called as "active High output". If instead of AND gate, the
NAND gate is connected the output will be "Low" (0) only when all its inputs are "High". Such output is

--- Content provided by FirstRanker.com ---

called as "active low output".
A slightly more complex decoder would be the n-to-2n type binary decoders. These types of decoders are
combinational circuits that convert binary information from 'n' coded inputs to a maximum of 2n unique
outputs. In case the 'n' bit coded information has unused bit combinations, the decoder may have less than
2n outputs. 2-to-4 decoder, 3-to-8 decoder or 4-to-16 decoder are other examples.

--- Content provided by FirstRanker.com ---

The input to a decoder is parallel binary number and it is used to detect the presence of a particular
binary number at the input. The output indicates presence or absence of specific number at the decoder
input. An encoder is a device, circuit, transducer, software program, algorithm or person that converts
information from one format or code to another. The purpose of encoder is standardization, speed,
secrecy, security, or saving space by shrinking size. Encoders are combinational logic circuits and they are

--- Content provided by FirstRanker.com ---

exactly opposite of decoders. They accept one or more inputs and generate a multibit output code.
Encoders perform exactly reverse operation than decoder. An encoder has M input and N output lines. Out

--- Content provided by FirstRanker.com ---

61 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

of M input lines only one is activated at a time and produces equivalent code on output N lines. If a device
output code has fewer bits than the input code has, the device is usually called an encoder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Sl.No. Inputs Outputs
D7 D6 D5 D4 D3 D2 D1 D0 A B C
1. 0 0 0 0 0 0 0 1 0 0 0
2. 0 0 0 0 0 0 1 0 0 0 1

--- Content provided by FirstRanker.com ---

3. 0 0 0 0 0 1 0 0 0 1 0
4. 0 0 0 0 1 0 0 0 0 1 1
5. 0 0 0 1 0 0 0 0 1 0 0
6. 0 0 1 0 0 0 0 0 1 0 1
7. 0 1 0 0 0 0 0 0 1 1 0

--- Content provided by FirstRanker.com ---

8. 1 0 0 0 0 0 0 0 1 1 1
Procedure:

1. Make the circuit connections as shown in the figure.

--- Content provided by FirstRanker.com ---

2. Check the corresponding truth table.



Result:

--- Content provided by FirstRanker.com ---

The design of the Encoder and Decoder circuit was done and the input and output were obtained

Outcome:
At the completion of an experiment student will able to design the encoder circuit and the decoder circuit

--- Content provided by FirstRanker.com ---

Sl.No.
Inputs Outputs

--- Content provided by FirstRanker.com ---

A B Y3 Y2 Y1 Y0
1. 0 0 0 0 0 1
2. 0 1 0 0 1 0
3. 1 0 0 1 0 0
4. 1 1 1 0 0 0

--- Content provided by FirstRanker.com ---

62 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is Encoder?
2. What is decoder?
3. List the application of encoder.
4. List the application of decoder.

--- Content provided by FirstRanker.com ---

5. Draw the truth table of encoder.
6. Draw the truth table of decoder.
7. What are logic gates used encoder?
8. What are logic gates used encoder?
9. What is the difference between decoder with demultiplexer?

--- Content provided by FirstRanker.com ---

10. What is the difference between encoder with multiplexer?
11. How to choose the select signal in encoder?
12. How to choose the select signal in decoder?
13. Draw the logic diagram of encoder.
14. Draw the logic diagram of encoder.

--- Content provided by FirstRanker.com ---

15. What is the difference between encoder with decoder?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

63 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2: IMPLEMENTATION OF BOOLEAN FUNCTIONS

Aim:
To design the logic circuit and verify the truth table of the given Boolean expression,

--- Content provided by FirstRanker.com ---

F (A, B, C, D) = ? (0, 1, 2, 5, 8, 9, 10)
Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Design:
Given , F (A,B,C,D) = ? (0,1,2,5,8,9,10)
Truth table:

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice



1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?

--- Content provided by FirstRanker.com ---

DEPARTMENT OF
COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and

--- Content provided by FirstRanker.com ---

enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different
levels

--- Content provided by FirstRanker.com ---

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative
Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s

--- Content provided by FirstRanker.com ---

needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental
concepts with strongly supported laboratory and prepare them to meet the global needs of the

--- Content provided by FirstRanker.com ---

industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

3. Breadth

--- Content provided by FirstRanker.com ---

To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

4. Professionalism

--- Content provided by FirstRanker.com ---

To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

5. Lifelong Learning/Ethics

--- Content provided by FirstRanker.com ---

To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.
e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.

--- Content provided by FirstRanker.com ---

f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.
i. Graduates will show the understanding of impact of engineering solutions on the society and also

--- Content provided by FirstRanker.com ---

will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


SYLLABUS

--- Content provided by FirstRanker.com ---

Objectives:
The student should be made to:
? Understand the various logic gates.
? Be familiar with various combinational circuits.

--- Content provided by FirstRanker.com ---

? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:
1. Verification of Boolean Theorems using basic gates.

--- Content provided by FirstRanker.com ---

2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor
b. Parity generator / checker

--- Content provided by FirstRanker.com ---

c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers
b. Synchronous and asynchronous counters

--- Content provided by FirstRanker.com ---

5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:
? Use Boolean simplification techniques to design a combinational hardware circuit.

--- Content provided by FirstRanker.com ---

? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Content

--- Content provided by FirstRanker.com ---

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates
2.

--- Content provided by FirstRanker.com ---

Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.
Implementation of half adder and full adder

--- Content provided by FirstRanker.com ---

4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and
MSI Devices

--- Content provided by FirstRanker.com ---

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.
9.

--- Content provided by FirstRanker.com ---

Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.
Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog

--- Content provided by FirstRanker.com ---

HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.1: STUDY OF BASIC GATES

Aim:
To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:
Circuit that takes the logical decision and the process are called logic gates. Each gate has one or

--- Content provided by FirstRanker.com ---

more input and only one output. OR, AND and NOT are basic gates. NAND, NOR and X-OR are known as
universal gates. Basic gates form these 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

--- Content provided by FirstRanker.com ---

low.
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.
NOT gate

--- Content provided by FirstRanker.com ---

A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low
and any one of the input is low .The output is low level when both inputs are high.

--- Content provided by FirstRanker.com ---

NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate
An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is

--- Content provided by FirstRanker.com ---

similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

1. Connections are given as per the circuit diagram.

--- Content provided by FirstRanker.com ---

2. For all the IC?s 7
th
pin is grounded and 14
th
pin is given +5 supply.

--- Content provided by FirstRanker.com ---

3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

At the completion of an experiment student will able to verify the truth

--- Content provided by FirstRanker.com ---

table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?
5. What are the applications of gates?

--- Content provided by FirstRanker.com ---

6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.
10. Write the truth table of NOR gate.

--- Content provided by FirstRanker.com ---

11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?
15. What are the advantages of IC?

--- Content provided by FirstRanker.com ---

16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES


Aim: To verification of Boolean theorems using logic gates

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 3

--- Content provided by FirstRanker.com ---

7. EX-OR gate IC 7486 1
8. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

2. Associative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)
2. A.(B+C) = (A.B)+(A.C)

--- Content provided by FirstRanker.com ---

4. Absorption Law

1. A+AB = A
2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.
A.B = A+B

--- Content provided by FirstRanker.com ---

Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

3. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

Procedure:

--- Content provided by FirstRanker.com ---

1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.
3. Apply the inputs to the respective input pins.

--- Content provided by FirstRanker.com ---

4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?
3. What is mean by compliment gate?

--- Content provided by FirstRanker.com ---

4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

0 + 0 = 0

--- Content provided by FirstRanker.com ---

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower
significant bit is called the sum.

--- Content provided by FirstRanker.com ---

Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

Full adder:

--- Content provided by FirstRanker.com ---

A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

From the truth table, the expression for sum and carry bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Half Adder

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,

--- Content provided by FirstRanker.com ---

S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder

--- Content provided by FirstRanker.com ---

Truth table:

Sl.No. Input Output
A B C S C
1. 0 0 0 0 0

--- Content provided by FirstRanker.com ---

2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 1

--- Content provided by FirstRanker.com ---

7. 1 1 0 0 1
8. 1 1 1 1 1


Sl.No. Input Output

--- Content provided by FirstRanker.com ---

A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0
4. 1 1 1 1

--- Content provided by FirstRanker.com ---

17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th
pin is grounded and 14

--- Content provided by FirstRanker.com ---

th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

Result:

--- Content provided by FirstRanker.com ---

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

At the completion of an experiment student will able to design the half adder circuit and the

--- Content provided by FirstRanker.com ---

full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the
subtrahend bit, hence 1 is borrowed.

--- Content provided by FirstRanker.com ---

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the
difference and borrow bits.

--- Content provided by FirstRanker.com ---

Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,
Difference, DIFF = A B

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:


Sl.No.

--- Content provided by FirstRanker.com ---

Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1
3. 0 1 0 1 1

--- Content provided by FirstRanker.com ---

4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. IC IC 7483 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be
constructed with full adders connected in cascade, with the output carry from each full adder connected to

--- Content provided by FirstRanker.com ---

the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0
and it ripples through

--- Content provided by FirstRanker.com ---

the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing
subtraction.

--- Content provided by FirstRanker.com ---

4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it
becomes subtractor.

--- Content provided by FirstRanker.com ---

23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

Logic diagram: 4-Bit Binary Subtractor:

--- Content provided by FirstRanker.com ---

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.
Result:

--- Content provided by FirstRanker.com ---

The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0
0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0

--- Content provided by FirstRanker.com ---

0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?

--- Content provided by FirstRanker.com ---

2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.
6. Draw the logic diagram of full subtrator.

--- Content provided by FirstRanker.com ---

7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?
11. What is different between combinational and sequential circuit?

--- Content provided by FirstRanker.com ---

12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

Aim:

--- Content provided by FirstRanker.com ---

To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less
than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two

--- Content provided by FirstRanker.com ---

numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 1 0
0 0 0 1
0 0 0 1
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

1 0 0
0 0 0 0
0 0 0 0
0 0 0 1
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?
3. Explain operation of AND gate.

--- Content provided by FirstRanker.com ---

4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?
8. Explain the k-map simplification of A>B.

--- Content provided by FirstRanker.com ---

9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION



31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 4-bit different code converters
(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two
systems if each uses different codes for same information. Thus, code converter is a circuit that makes the

--- Content provided by FirstRanker.com ---

two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is
designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a

--- Content provided by FirstRanker.com ---

circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-
level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are

--- Content provided by FirstRanker.com ---

various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:



32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:



33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G0:



Truth table:

--- Content provided by FirstRanker.com ---

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0

0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:



K map for B3:

--- Content provided by FirstRanker.com ---

B3=G3
K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

G3 G2 G1 G0 B3 B2 B1 B0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:


Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:


E3 = B3 + B2 (B0 + B1)

--- Content provided by FirstRanker.com ---

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

x

1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1

1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0

1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table
3. Observe the logical output and verify with the truth tables.

--- Content provided by FirstRanker.com ---

Result:
Thus the code converters were designed and verified using the corresponding truth table.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the binary to gray converter.


1. What is binary code?
2. What is gray code?

--- Content provided by FirstRanker.com ---

3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?
6. How to convert binary to gray code?
7. How to convert gray to binary code?

--- Content provided by FirstRanker.com ---

8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.
12. What is K ? Map?

--- Content provided by FirstRanker.com ---

13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

Aim:

--- Content provided by FirstRanker.com ---

To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1
3 NOT gate IC 7404 1
4 Connecting wires - Required

--- Content provided by FirstRanker.com ---

Theory:
Parity checking is used for error detection in data transmission.
Odd parity checkers:

--- Content provided by FirstRanker.com ---

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

Even parity checker:

--- Content provided by FirstRanker.com ---

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

Odd parity generators:

--- Content provided by FirstRanker.com ---

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.
Even parity generator:

--- Content provided by FirstRanker.com ---

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

Input Checker output Generator output
A B C D D odd even odd even

--- Content provided by FirstRanker.com ---

0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001
0 1 0 1 0 1 01011 01010

--- Content provided by FirstRanker.com ---

0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010
1 0 1 0 0 1 10101 10100

--- Content provided by FirstRanker.com ---

1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101
1 1 1 1 0 1 11111 11110

--- Content provided by FirstRanker.com ---

Procedure:
1. The circuit is implemented using logic gates.

--- Content provided by FirstRanker.com ---

2. The inputs are given as per the truth table.

3. The corresponding outputs are noted.

--- Content provided by FirstRanker.com ---

4. The theoretical and practical values were verified.

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and
even parity numbers are generated using the corresponding generators.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is parity bit?

--- Content provided by FirstRanker.com ---

2. Why parity bit is added to message?

3. What is parity checker?

4. What is odd parity?

--- Content provided by FirstRanker.com ---

5. What is even parity?

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.
8. Why weighted code is called as reflective codes?

--- Content provided by FirstRanker.com ---

9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?
12. What is hamming code?
13. List the binary weighted code.

--- Content provided by FirstRanker.com ---

14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray
17. What are the applications of gray code?
18. What are the applications of Excess- 3 code?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

Aim:

--- Content provided by FirstRanker.com ---

To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

Sl. No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of
selection lines. Normally, there are 2

--- Content provided by FirstRanker.com ---

n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all
output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be

--- Content provided by FirstRanker.com ---

selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A
Demultiplexer is a circuit that receives information on a single line and transmits this information on one of

--- Content provided by FirstRanker.com ---

2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an
enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-

--- Content provided by FirstRanker.com ---

active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

4 X 1 MULTIPLEXER

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?
2. What is demultiplexer?
3. What are the advantages of multiplexer?

--- Content provided by FirstRanker.com ---

4. What are the advantages of demultiplexer?
5. What is select signal?
6. How to choose select signal in multiplexer?
7. How to choose select signal in demultiplexer?
8. Write the formula used in select signal.

--- Content provided by FirstRanker.com ---

9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?
11. What is the application of demultiplexer?
12. Draw the truth table of multiplexer.
13. Draw the truth table of demultiplexer.

--- Content provided by FirstRanker.com ---

14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

EXP NO: 11 SHIFT REGISTER

Aim:

--- Content provided by FirstRanker.com ---

To design and implement the various shift register

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2
2. OR gate IC 7432 1
3. IC Trainer kit 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

A register is capable of shifting its binary information in one or both directions is
known as shift register. The logical configuration of shift register consist of a D-Flip flop

--- Content provided by FirstRanker.com ---

cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible
shift register is one that uses only flip flop. The output of a given flip flop is connected to the
input of next flip flop of the register. Each clock pulse shifts the content of register one bit position
to right.

--- Content provided by FirstRanker.com ---

PIN Diagram:

Logic Diagram:
SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth Table:

--- Content provided by FirstRanker.com ---

CLK Serial in Serial out
1 1 0
2 0 0
3 0 0
4 1 1

--- Content provided by FirstRanker.com ---

5 X 0
6 X 0
7 X 1

--- Content provided by FirstRanker.com ---

Logic Diagram:

Serial in parallel out:

--- Content provided by FirstRanker.com ---

Truth Table:

CLK DATA
OUTPUT

--- Content provided by FirstRanker.com ---

Q
A
Q
B
Q

--- Content provided by FirstRanker.com ---

C
Q
D

1 1 1 0 0 0

--- Content provided by FirstRanker.com ---

2 0 0 1 0 0
3 0 0 0 1 1
4 1 1 0 0 1

--- Content provided by FirstRanker.com ---

Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

CLK Q3 Q2 Q1 Q0 O/P
0 1 0 0 1 1
1 0 0 0 0 0
2 0 0 0 0 0
3 0 0 0 0 1

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per circuit diagram

--- Content provided by FirstRanker.com ---

2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the implementation of shift registers using flip flops was completed successfully.
Outcome:

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK
DATA INPUT OUTPUT
D
A D

--- Content provided by FirstRanker.com ---

B D
C D
D Q
A Q
B Q

--- Content provided by FirstRanker.com ---

C Q
D
1 1 0 0 1 1 0 0 1
2 1 0 1 0 1 0 1 0

--- Content provided by FirstRanker.com ---

51 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.12: SYNCHRONOUS UP/DOWN COUNTER

--- Content provided by FirstRanker.com ---

Aim:

To design and implement 3 bit synchronous up/down counter

--- Content provided by FirstRanker.com ---

Apparatus required:

S.No Name of the Apparatus Range Quantity
1. JK Flip Flop IC 7474 2
2. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5 XOR gate IC 7486 1
6 IC Trainer Kit 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

A counter is a register capable of counting number of clock pulse arriving at its clock input.

--- Content provided by FirstRanker.com ---

Counter represents the number of clock pulses arrived. An up/down counter is one that is capable of
progressing in increasing order or decreasing order through a certain sequence. An up/down counter
is also called bidirectional counter. Usually up/down operation of the counter is controlled by up/down
signal. When this signal is high counter goes through up sequence and when up/down signal is low counter
follows reverse sequence.

--- Content provided by FirstRanker.com ---

K map:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

52 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Q Q
t+1 J K
0 0 0 X

--- Content provided by FirstRanker.com ---

0 1 1 X
1 0 X 1
1 1 X 0

State Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Characteristic Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

53 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Input
Up/Down
Present
State

--- Content provided by FirstRanker.com ---

Q
A
Q
B
Q

--- Content provided by FirstRanker.com ---

C

Next State
Q
A+1

--- Content provided by FirstRanker.com ---

Q
B+1
Q
C+1
A

--- Content provided by FirstRanker.com ---

J
A
K
A

--- Content provided by FirstRanker.com ---

B
J
B
K
B

--- Content provided by FirstRanker.com ---

C
J
C
K

--- Content provided by FirstRanker.com ---

C

0 0 0 0 1 1 1 1 X 1 X 1 X
0 1 1 1 1 1 0 X 0 X 0 X 1
0 1 1 0 1 0 1 X 0 X 1 1 X

--- Content provided by FirstRanker.com ---

0 1 0 1 1 0 0 X 0 0 X X 1
0 1 0 0 0 1 1 X 1 1 X 1 X
0 0 1 1 0 1 0 0 X X 0 X 1
0 0 1 0 0 0 1 0 X X 1 1 X
0 0 0 1 0 0 0 0 X 0 X X 1

--- Content provided by FirstRanker.com ---

1 0 0 0 0 0 1 0 X 0 X 1 X
1 0 0 1 0 1 0 0 X 1 X X 1
1 0 1 0 0 1 1 0 X X 0 1 X
1 0 1 1 1 0 0 1 X X 1 X 1
1 1 0 0 1 0 1 X 0 0 X 1 X

--- Content provided by FirstRanker.com ---

1 1 0 1 1 1 0 X 0 1 X X 1
1 1 1 0 1 1 1 X 0 X 0 1 X
1 1 1 1 0 0 0 X 1 X 1 X 1

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

3. Observe the output and verify the truth table.
Result:
Thus the 3-bit synchronous up/down counters was implemented successfully.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the synchronous up/down counter.

--- Content provided by FirstRanker.com ---

54 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Expt.No.12:

--- Content provided by FirstRanker.com ---

SIMULATION OF COMBINATIONAL CIRCUITS USING HDL

Aim:

--- Content provided by FirstRanker.com ---

To write a verilog code for half adder, full adder and multiplexer

Tools Required:
Xilinx 9.2

--- Content provided by FirstRanker.com ---

Program:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Simulation wave for half adder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

55 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


MULTIPLEXER:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Write and draw the Digital logic system.

--- Content provided by FirstRanker.com ---

2. Write the Verilog code for above system.
3. Enter the Verilog code in Xilinx software.
4. Check the syntax and simulate the above Verilog code (using ModelSim or Xilinx) and verify the
output waveform as obtained.
5. Implement the above code in Spartan III using FPGA kit.

--- Content provided by FirstRanker.com ---

Result:

Thus the verilog code for half adder, full adder and multiplexer were simulated and verified
successfully.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to be known the verilog code for half adder,
full adder and multiplexer.

--- Content provided by FirstRanker.com ---

56 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.13:

SIMULATION OF SEQUENTIAL CIRCUITS USING HDL

--- Content provided by FirstRanker.com ---

Aim:

To write a verilog code for RS, D, JK flip flop and up counter

Tools required:

--- Content provided by FirstRanker.com ---

Xilinx 9.2

Program:

--- Content provided by FirstRanker.com ---

RS Flip Flop:

--- Content provided by FirstRanker.com ---

D Flip Flop:

--- Content provided by FirstRanker.com ---

57 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

JK Flip Flop:

--- Content provided by FirstRanker.com ---

Up Counter:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

58 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:

Thus the verilog code for RS,D,JK Filp Flop and up counter were simulated and verified

--- Content provided by FirstRanker.com ---

successfully.

Outcome:

At the completion of an experiment student will able to be known the verilog code for RS, D, JK

--- Content provided by FirstRanker.com ---

Filp Flop and up counter .

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

59 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

ADDITIONAL EXPERIMENTS

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

60 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.8: ENCODER AND DECODER

Aim:

--- Content provided by FirstRanker.com ---

To study the operation of encoder and decoder circuits using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No Name of the Apparatus Range Quantity
1. Digital IC trainer 1
2. NOT Gate IC 7404 1
3. OR Gate IC 7432 1
4. AND Gate IC7408 1

--- Content provided by FirstRanker.com ---

5. Bread Board 1
6. NOT Gate IC7404 1
8. Connecting wires and probes As required

Theory:

--- Content provided by FirstRanker.com ---

Decoder
In digital electronics, a decoder can take the form of a multiple-input, multiple-output logic circuit that
converts coded inputs into coded outputs, where the input and output codes are different e.g. n-to-2n ,
binary-coded decimal decoders. Decoding is necessary in applications such as data multiplexing, 7
segment display and memory address decoding.

--- Content provided by FirstRanker.com ---

The example decoder circuit would be an AND gate because the output of an AND gate is "High" (1) only
when all its inputs are "High." Such output is called as "active High output". If instead of AND gate, the
NAND gate is connected the output will be "Low" (0) only when all its inputs are "High". Such output is
called as "active low output".
A slightly more complex decoder would be the n-to-2n type binary decoders. These types of decoders are

--- Content provided by FirstRanker.com ---

combinational circuits that convert binary information from 'n' coded inputs to a maximum of 2n unique
outputs. In case the 'n' bit coded information has unused bit combinations, the decoder may have less than
2n outputs. 2-to-4 decoder, 3-to-8 decoder or 4-to-16 decoder are other examples.
The input to a decoder is parallel binary number and it is used to detect the presence of a particular
binary number at the input. The output indicates presence or absence of specific number at the decoder

--- Content provided by FirstRanker.com ---

input. An encoder is a device, circuit, transducer, software program, algorithm or person that converts
information from one format or code to another. The purpose of encoder is standardization, speed,
secrecy, security, or saving space by shrinking size. Encoders are combinational logic circuits and they are
exactly opposite of decoders. They accept one or more inputs and generate a multibit output code.
Encoders perform exactly reverse operation than decoder. An encoder has M input and N output lines. Out

--- Content provided by FirstRanker.com ---

61 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

of M input lines only one is activated at a time and produces equivalent code on output N lines. If a device
output code has fewer bits than the input code has, the device is usually called an encoder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Sl.No. Inputs Outputs

--- Content provided by FirstRanker.com ---

D7 D6 D5 D4 D3 D2 D1 D0 A B C
1. 0 0 0 0 0 0 0 1 0 0 0
2. 0 0 0 0 0 0 1 0 0 0 1
3. 0 0 0 0 0 1 0 0 0 1 0
4. 0 0 0 0 1 0 0 0 0 1 1

--- Content provided by FirstRanker.com ---

5. 0 0 0 1 0 0 0 0 1 0 0
6. 0 0 1 0 0 0 0 0 1 0 1
7. 0 1 0 0 0 0 0 0 1 1 0
8. 1 0 0 0 0 0 0 0 1 1 1
Procedure:

--- Content provided by FirstRanker.com ---

1. Make the circuit connections as shown in the figure.

2. Check the corresponding truth table.

--- Content provided by FirstRanker.com ---

Result:
The design of the Encoder and Decoder circuit was done and the input and output were obtained

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the encoder circuit and the decoder circuit

--- Content provided by FirstRanker.com ---

Sl.No.
Inputs Outputs
A B Y3 Y2 Y1 Y0
1. 0 0 0 0 0 1

--- Content provided by FirstRanker.com ---

2. 0 1 0 0 1 0
3. 1 0 0 1 0 0
4. 1 1 1 0 0 0

--- Content provided by FirstRanker.com ---

62 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


1. What is Encoder?

--- Content provided by FirstRanker.com ---

2. What is decoder?
3. List the application of encoder.
4. List the application of decoder.
5. Draw the truth table of encoder.
6. Draw the truth table of decoder.

--- Content provided by FirstRanker.com ---

7. What are logic gates used encoder?
8. What are logic gates used encoder?
9. What is the difference between decoder with demultiplexer?
10. What is the difference between encoder with multiplexer?
11. How to choose the select signal in encoder?

--- Content provided by FirstRanker.com ---

12. How to choose the select signal in decoder?
13. Draw the logic diagram of encoder.
14. Draw the logic diagram of encoder.
15. What is the difference between encoder with decoder?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

63 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Expt.No.2: IMPLEMENTATION OF BOOLEAN FUNCTIONS

--- Content provided by FirstRanker.com ---

Aim:
To design the logic circuit and verify the truth table of the given Boolean expression,
F (A, B, C, D) = ? (0, 1, 2, 5, 8, 9, 10)
Apparatus required:

--- Content provided by FirstRanker.com ---

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Design:
Given , F (A,B,C,D) = ? (0,1,2,5,8,9,10)

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

64 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Sl. No.
INPUT OUTPUT

--- Content provided by FirstRanker.com ---

A B C D F=D?B?+C?(B?+A?D)
1. 0 0 0 0 1
2. 0 0 0 1 1
3. 0 0 1 0 1
4. 0 0 1 1 0

--- Content provided by FirstRanker.com ---

5. 0 1 0 0 0
6. 0 1 0 1 1
7. 0 1 1 0 0
8. 0 1 1 1 0
9. 1 0 0 0 1

--- Content provided by FirstRanker.com ---

10. 1 0 0 1 1
11. 1 0 1 0 1
12. 1 0 1 1 0
13. 1 1 0 0 0
14. 1 1 0 1 0

--- Content provided by FirstRanker.com ---

15. 1 1 1 0 0
16. 1 1 1 1 0
The output function F has four input variables hence a four variable Karnaugh Map is used to obtain a
simplified expression for the output as shown,

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the K-Map,

F = B? C? + D? B? + A? C? D

Since we are using only two input logic gates the above expression can be re-written as,

--- Content provided by FirstRanker.com ---

F = C? (B? + A? D) + D? B?

Now the logic circuit for the above equation can be drawn.

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice

--- Content provided by FirstRanker.com ---

1 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

?



DEPARTMENT OF

--- Content provided by FirstRanker.com ---

COMPUTER SCIENCE ENGINEERING

III SEMESTER - R 2017

CS8382 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Name : _______________________________________
Register No : _______________________________________
Section : _______________________________________

--- Content provided by FirstRanker.com ---

LABORATORY MANUAL

--- Content provided by FirstRanker.com ---

2 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

is committed to provide highly disciplined, conscientious and
enterprising professionals conforming to global standards through value based quality education and
training.

--- Content provided by FirstRanker.com ---

? To provide competent technical manpower capable of meeting requirements of the industry

? To contribute to the promotion of Academic Excellence in pursuit of Technical Education at different

--- Content provided by FirstRanker.com ---

levels

? To train the students to sell his brawn and brain to the highest bidder but to never put a price tag on
heart and soul

--- Content provided by FirstRanker.com ---

DEPARTMENT OF COMPUTER SCIENCE ENGINEERING

--- Content provided by FirstRanker.com ---

To provide candidates with knowledge and skill in the field of Electrical and Electronics
Engineering and thereby produce extremely well trained employable, socially responsible and innovative

--- Content provided by FirstRanker.com ---

Electrical and Electronics Engineers.

--- Content provided by FirstRanker.com ---

? To provide the students rigorous learning experience to produce creative solutions to society?s
needs.
? To produce electrical engineers of high calibre, conscious of the universal moral values adhering to
professional ethical code.
? To provide highest quality learning environment for the students emphasizing fundamental

--- Content provided by FirstRanker.com ---

concepts with strongly supported laboratory and prepare them to meet the global needs of the
industry by continuous assessment and training.


VISION

--- Content provided by FirstRanker.com ---

MISSION

VISION

--- Content provided by FirstRanker.com ---

MISSION

--- Content provided by FirstRanker.com ---

3 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



PROGRAM EDUCATIONAL OBJECTIVES (PEOs)

--- Content provided by FirstRanker.com ---

1. Fundamentals
To provide students with a solid foundation in mathematics, science and fundamentals of
engineering enabling them to solve complex problems in order to develop real time applications.

--- Content provided by FirstRanker.com ---

2. Core Competence
To train the students to meet the needs of core industry with an attitude of learning new
technologies.

--- Content provided by FirstRanker.com ---

3. Breadth
To provide relevant training and experience to bridge the gap between theory and practice which
enable them to find solutions to problems in industry and research that contributes to the overall
development of society.

--- Content provided by FirstRanker.com ---

4. Professionalism
To inculcate professional and effective communication skills to the students to make them lead a
team and stand as a good decision maker to manage any constraint environment with good
professional ethics at all strategies.

--- Content provided by FirstRanker.com ---

5. Lifelong Learning/Ethics
To practice ethical and professional responsibilities in the organization and society with
commitment and lifelong learning needed for successful professional career.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

4 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


PROGRAM OUTCOMES (POs)

--- Content provided by FirstRanker.com ---

a. Graduates will demonstrate knowledge of mathematics, science and electrical engineering.
b. Graduates will be able to identify, formulate and solve electrical engineering problems.
c. Graduates will be able to design and conduct experiments, analyze and interpret data.
d. Graduates will be able to design a system, component or process as per needs and specifications.

--- Content provided by FirstRanker.com ---

e. Graduates will demonstrate to visualize and work on laboratory and multidisciplinary tasks.
f. Graduates will demonstrate skills to use modern engineering tools, software and equipment to
analyze problems.
g. Graduates will demonstrate knowledge of professional and ethical responsibilities.
h. Graduates will be able to communicate effectively by both verbal and written form.

--- Content provided by FirstRanker.com ---

i. Graduates will show the understanding of impact of engineering solutions on the society and also
will be aware of contemporary issues.
j. Graduates will develop confidence for self-education and ability for lifelong learning.
k. Graduate who can participate and succeed in competitive examinations.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

5 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

SYLLABUS

Objectives:
The student should be made to:
? Understand the various logic gates.

--- Content provided by FirstRanker.com ---

? Be familiar with various combinational circuits.
? Understand the various components used in the design of digital computers.
? Be exposed to sequential circuits
? Learn to use HDL
List of experiments:

--- Content provided by FirstRanker.com ---

1. Verification of Boolean Theorems using basic gates.
2. Design and implementation of combinational circuits using basic gates for arbitrary
functions, code converters.
3. Design and implementation of combinational circuits using MSI devices:
a. 4 ? bit binary adder / subtractor

--- Content provided by FirstRanker.com ---

b. Parity generator / checker
c. Magnitude Comparator
d. Application using multiplexers
4. Design and implementation of sequential circuits:
a. Shift ?registers

--- Content provided by FirstRanker.com ---

b. Synchronous and asynchronous counters
5. Coding combinational / sequential circuits using HDL.
6. Design and implementation of a simple digital system (Mini Project).

Course Outcomes:

--- Content provided by FirstRanker.com ---

? Use Boolean simplification techniques to design a combinational hardware circuit.
? Design and Implement combinational and sequential circuits.
? Analyze a given digital circuit ? combinational and sequential.
? Design the different functional units in a digital computer system.
? Design and Implement a simple digital system.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CS8381 DIGITAL SYSTEMS LABORATORY

--- Content provided by FirstRanker.com ---

6 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Content

Sl.No. Name of the Experiment Page No.
1.
Verification of Boolean Theorems using Digital Logic Gates

--- Content provided by FirstRanker.com ---

2.
Design and Implementation of Combinational Circuits using Basic Gates for Arbitrary
Functions, Code Converters

3.

--- Content provided by FirstRanker.com ---

Implementation of half adder and full adder
4.
Implementation of half subtractor and full subtractor
5.
Design and Implementation of 4-Bit Binary Adder / Subtractor using Basic Gates and

--- Content provided by FirstRanker.com ---

MSI Devices

6.
Design and Implementation of Parity Generator / Checker using Basic Gates and MSI
Devices

--- Content provided by FirstRanker.com ---

7.
Design and Implementation of Magnitude Comparator.
8.
Design and Implementation of Application using Multiplexers / Demultiplexers.

--- Content provided by FirstRanker.com ---

9.
Design and Implementation of Shift Registers.
10.
Design and Implementation of Synchronous and Asynchronous Counters.
11.

--- Content provided by FirstRanker.com ---

Simulation of Combinational Circuits using Hardware Description Language (VHDL / Verilog
HDL Software Required).

12.
Simulation of Sequential Circuits using HDL (VHDL / Verilog HDL Software Required).

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

7 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.1: STUDY OF BASIC GATES

Aim:

--- Content provided by FirstRanker.com ---

To verify the truth table of basic digital IC?s of AND, OR, NOT, NAND, NOR, EX-OR gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1
8. Connecting wires As required

Theory:

--- Content provided by FirstRanker.com ---

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 and X-OR are known as
universal gates. Basic gates form these gates.
AND gate
The AND gate performs a logical multiplication commonly known as AND function. The

--- Content provided by FirstRanker.com ---

output is high when both the inputs are high. The output is low level when any one of the inputs is
low.
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.

--- Content provided by FirstRanker.com ---

NOT gate
A NOT gate is the physical realization of the complementation operation. 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.
NAND gate
The NAND gate is a contraction of AND-NOT. The output is high when both inputs are low

--- Content provided by FirstRanker.com ---

and any one of the input is low .The output is low level when both inputs are high.
NOR gate
The NOR gate is a contraction of OR-NOT. The output is high when both inputs are low. The
output is low when one or both inputs are high.
EX-OR gate

--- Content provided by FirstRanker.com ---

An Ex-OR gate performs the following Boolean function, A B = ( A . B? ) + ( A? . B ). It is
similar to OR gate but excludes the combination of both A and B being equal to one. The exclusive
OR is a function that give an output signal ?0? when the two input signals are equal either ?0? or ?1?.

--- Content provided by FirstRanker.com ---

8 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


AND Gate Symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

OR Gate:

--- Content provided by FirstRanker.com ---

OR GATE:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

9 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NOT Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

EXOR Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

10 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

NAND Gate symbol: PIN Diagram:

--- Content provided by FirstRanker.com ---

NOR Gate:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

11 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 supply.
3. Apply the inputs and verify the truth table for all gates.


Result:

--- Content provided by FirstRanker.com ---

The truth tables of all the basic logic gates were verified.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to verify the truth
table of all basic gates

--- Content provided by FirstRanker.com ---

1. List out the basic gate.
2. Mention the universal gate.
3. How many gates presented in IC 7408?
4. What is IC?

--- Content provided by FirstRanker.com ---

5. What are the applications of gates?
6. Write the truth table of AND gate.
7. Write the truth table of OR gate.
8. Write the truth table of NOT gate.
9. Write the truth table of NAND gate.

--- Content provided by FirstRanker.com ---

10. Write the truth table of NOR gate.
11. Write the truth table of EX- OR gate.
12. What are the classifications of IC?
13. What are types of linear integrated circuit?
14. What is meant by etching?

--- Content provided by FirstRanker.com ---

15. What are the advantages of IC?
16. Write the truth table of EX- NOR gate.
Viva ? Voce

--- Content provided by FirstRanker.com ---

12 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.2:

--- Content provided by FirstRanker.com ---

VERIFICATION OF BOOLEAN THEOREMS USING LOGIC
GATES

--- Content provided by FirstRanker.com ---

Aim: To verification of Boolean theorems using logic gates

Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1

--- Content provided by FirstRanker.com ---

6. NOR gate IC 7402 3
7. EX-OR gate IC 7486 1
8. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

BASIC Boolean Laws

1. Commutative Law

--- Content provided by FirstRanker.com ---

The binary operator OR, AND is said to be commutative if,
1. A+B = B+A
2. A.B=B.A

--- Content provided by FirstRanker.com ---

2. Associative Law

The binary operator OR, AND is said to be associative if,
1. A+(B+C) = (A+B)+C
2. A.(B.C) = (A.B).C

--- Content provided by FirstRanker.com ---

3. Distributive Law

The binary operator OR, AND is said to be distributive if,
1. A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

2. A.(B+C) = (A.B)+(A.C)

4. Absorption Law

1. A+AB = A

--- Content provided by FirstRanker.com ---

2. A+AB =A+B

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

13 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



5. Idempotent Law

--- Content provided by FirstRanker.com ---

1. A+A = A
2. A.A = A

6. Complementary Law

--- Content provided by FirstRanker.com ---

1. A+A' = 1
2. A.A' = 0

7. De Morgan ?s Theorem

--- Content provided by FirstRanker.com ---

1. The complement of the sum is equal to the sum of the product of the individual
complements.
A+B = A.B
2. The complement of the product is equal to the sum of the individual complements.

--- Content provided by FirstRanker.com ---

A.B = A+B


Design
1. Absorption Law

--- Content provided by FirstRanker.com ---

A+AB = A

--- Content provided by FirstRanker.com ---

2. Involution (or) Double complement Law

--- Content provided by FirstRanker.com ---

A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

3. Idempotent Law

1. A+A = A

2. A.A = A

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

14 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

4. Demorgan ?s Law

A+B = A.B

--- Content provided by FirstRanker.com ---

5. Distributive Law
A+(B.C) = (A+B).(A+C)

--- Content provided by FirstRanker.com ---

Procedure:
1. Obtain the required IC along with the Digital trainer kit.
2. Connect zero volts to GND pin and +5 volts to V
cc
.

--- Content provided by FirstRanker.com ---

3. Apply the inputs to the respective input pins.
4. Verify the output with the truth table.


Result:

--- Content provided by FirstRanker.com ---

Thus the above stated Boolean laws are verified.
Outcome:

At the completion of an experiment student will able to know the basic laws with their truth table.

--- Content provided by FirstRanker.com ---

1. What is Demorgan?s law?
2. What is associative law?

--- Content provided by FirstRanker.com ---

3. What is mean by compliment gate?
4. Explain the basic laws in digital electronics
5. What is double complement?

Viva ? Voce

--- Content provided by FirstRanker.com ---

15 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.3: HALF ADDER AND FULL ADDER
Aim:
To design and verify the truth table of the Half Adder & Full Adder circuits

--- Content provided by FirstRanker.com ---

Apparatus required:

S. No. Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1
6. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
The most basic arithmetic operation is the addition of two binary digits. There are four
possible elementary operations, namely,

--- Content provided by FirstRanker.com ---

0 + 0 = 0

0 + 1 = 1

1 + 0 = 1

--- Content provided by FirstRanker.com ---

1 + 1 = 0 (with 1 as carry)

The first three operations produce a sum of whose length is one digit, but when the last operation is
performed the sum is two digits. The higher significant bit of this result is called a carry and lower

--- Content provided by FirstRanker.com ---

significant bit is called the sum.
Half adder:
A combinational circuit which performs the addition of two bits is called half adder. The input variables
designate the augend and the addend bit, whereas the output variables produce the sum and carry bits.

--- Content provided by FirstRanker.com ---

Full adder:
A combinational circuit which performs the arithmetic sum of three input bits is called full adder. The
three input bits include two significant bits and a previous carry bit. A full adder circuit can be implemented
with two half adders and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table, the expression for sum and carry bits of the output can be obtained as,
SUM = A?B?C + A?BC? + AB?C? + ABC

CARRY = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

16 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Half Adder
Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the truth table the expression for sum and carry bits of the output can be obtained as, Sum,
S = A B

Carry, C = A . B

--- Content provided by FirstRanker.com ---

Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Full adder
Truth table:

Sl.No. Input Output
A B C S C

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0
2. 0 0 1 1 0
3. 0 1 0 1 0
4. 0 1 1 0 1
5. 1 0 0 1 0

--- Content provided by FirstRanker.com ---

6. 1 0 1 0 1
7. 1 1 0 0 1
8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B S C
1. 0 0 0 0
2. 0 1 1 0
3. 1 0 1 0

--- Content provided by FirstRanker.com ---

4. 1 1 1 1



17 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

Sum:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

SUM = A?B?C + A?BC? + AB?C? + ABC = A B C

--- Content provided by FirstRanker.com ---

Carry:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CARRY = AB + AC + BC


Logic Diagram:

--- Content provided by FirstRanker.com ---

18 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per the circuit diagrams.
2. For all the IC?s 7
th

--- Content provided by FirstRanker.com ---

pin is grounded and 14
th
pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the half adder and full adder circuits.

--- Content provided by FirstRanker.com ---

Result:

The design of the half adder and full adder circuits was done and their truth tables were verified.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the half adder circuit and the
full adder circuit.

--- Content provided by FirstRanker.com ---

19 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.4: HALF SUBTRACTOR AND FULL SUBTRACTOR

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of the half subtractor & full subtractor circuits
Apparatus required:

Sl.No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

6. Connecting wires As required

Theory:
The subtraction of two binary digits has four possible operations. In all operations, each subtrahend bit
is subtracted from the minuend bit. In case of the second operation the minuend bit is smaller than the

--- Content provided by FirstRanker.com ---

subtrahend bit, hence 1 is borrowed.

Half subtractor:
A combinational circuit which performs the subtraction of two bits is called half subtractor. The input
variables designate the minuend and the subtrahend bit, whereas the output variables produce the

--- Content provided by FirstRanker.com ---

difference and borrow bits.
Full subtractor:
A combinational circuit which performs the subtraction of three input bits is called full subtractor. The
three input bits include two significant bits and a previous borrow bit. A full subtractor circuit can be
implemented with two half subtractors and one OR gate.

--- Content provided by FirstRanker.com ---

From the truth table the expression for difference and borrow bits of the output can be obtained
as,

Difference, DIFF= A?B?C + A?BC? + AB?C? + ABC

--- Content provided by FirstRanker.com ---

Borrow, BORR = A?BC + AB?C + ABC? +ABC

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

20 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Half subtractor

Truth table:

--- Content provided by FirstRanker.com ---

Sl.No. Input Output
A B Difference Borrow
1. 0 0 0 0
2. 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 1 0 1 0
4. 1 1 0 0


From the truth table the expression for difference and borrow bits of the output can be obtained as,

--- Content provided by FirstRanker.com ---

Difference, DIFF = A B

Borrow, BORR = A?. B

Logic diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

2. Full subtractor
Truth table:

--- Content provided by FirstRanker.com ---

Sl.No.
Input Output
A B C Difference Borrow
1. 0 0 0 0 0
2. 0 0 1 1 1

--- Content provided by FirstRanker.com ---

3. 0 1 0 1 1
4. 0 1 1 0 1
5. 1 0 0 1 0
6. 1 0 1 0 0
7. 1 1 0 0 0

--- Content provided by FirstRanker.com ---

8. 1 1 1 1 1

--- Content provided by FirstRanker.com ---

21 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Using Karnaugh maps the reduced expression for the output bits can be obtained as,

--- Content provided by FirstRanker.com ---

Difference

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Difference = A?B?C + A?BC? + AB?C? + ABC


Borrow

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Borrow = A?B + A?C + BC


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

22 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.5: 4-BIT ADDER AND SUBTRACTOR


Aim:
To design and implement 4-bit adder and subtractor using IC 7483

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. IC IC 7483 1
3. NOT gate IC 7404 1
4. EX-OR gate IC 7486 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

4 BIT Binary adder:

A binary adder is a digital circuit that produces the arithmetic sum of two binary numbers. It can be

--- Content provided by FirstRanker.com ---

constructed with full adders connected in cascade, with the output carry from each full adder connected to
the input carry of next full adder in chain. The augends bits of ?A? and the addend bits of ?B? are
designated by subscript numbers from right to left, with subscript 0 denoting the least significant bits. The
carries are connected in chain through full adder. The input carry to the adder is C
0

--- Content provided by FirstRanker.com ---

and it ripples through
the full adder to the output carry C
4
.
4 BIT Binary subtractor:

--- Content provided by FirstRanker.com ---

The circuit for subtracting A-B consists of an adder with inverters, placed between each data input
?B? and the corresponding input of full adder. The input carry C
0
must be equal to 1 when performing

--- Content provided by FirstRanker.com ---

subtraction.
4 BIT Binary adder / subtractor:

The addition and subtraction operation can be combined into one circuit with one common binary
adder. The mode input M controls the operation. When M=0, the circuit is adder circuit. When M=1, it

--- Content provided by FirstRanker.com ---

becomes subtractor.



23 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

PIN Diagram for IC 7483:

Logic Diagram: 4-Bit Binary Diagram:

--- Content provided by FirstRanker.com ---

Logic diagram: 4-Bit Binary Subtractor:

4-Bit Binary Adder /Subtractor:

--- Content provided by FirstRanker.com ---

24 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per the circuit diagrams.
2. Logical inputs were given as per circuit diagram.
3. Apply the inputs and verify the truth table for the 4-bit adder and subtractor.
.

--- Content provided by FirstRanker.com ---

Result:
The design of the 4-bit Binary adder and l subtractor circuit was done and its truth table was
verified.
Outcome:
At the completion of an experiment student will able to design 4-bit binary adder and subtractor

--- Content provided by FirstRanker.com ---

Input Data A Input Data B Addition Subtraction
A4 A3 A2 A1 B4 B3 B2 B1 C S4 S3 S2 S1 B D4 D3 D2 D1
1 0 0 0 0 0 1 0 0 1 0 1 0 1 0 1 1 0
1 0 0 0 1 0 0 0 1 0 0 0 0 1 0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 1 0 1 0 0 0 0 1 0 1 0 0 1 0 1 0
0 0 0 1 0 1 1 1 0 1 0 0 0 0 1 0 1 0
1 0 1 0 1 0 1 1 1 0 0 1 0 0 1 1 1 1
1 1 1 0 1 1 1 1 1 1 0 1 0 0 1 1 1 1
1 0 1 0 1 1 0 1 1 0 1 1 1 0 1 1 0 1

--- Content provided by FirstRanker.com ---

25 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

1. What is expression for difference and borrow?
2. Write the truth table for half adder.
3. Write the truth table for full adder.
4. Write the truth table for half subtrator.
5. Write the truth table for full subtrator.

--- Content provided by FirstRanker.com ---

6. Draw the logic diagram of full subtrator.
7. What is adder?
8. List out the application of adders.
9. Draw the full adder using two half adder circuits.
10. What is combinational circuit?

--- Content provided by FirstRanker.com ---

11. What is different between combinational and sequential circuit?
12. What are the gates involved for binary adder?
13. List the properties of Ex-Nor gate?
14. What is expression for sum and carry?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

26 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.6: MAGNITUDE COMPARATOR

--- Content provided by FirstRanker.com ---

Aim:
To design, construct and study the performance of 2 bit magnitude comparator
Apparatus required:
Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1

--- Content provided by FirstRanker.com ---

2. AND gate IC 7408 1
3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required

Theory:

The comparison of two numbers is an operator that determines one number is greater than, less

--- Content provided by FirstRanker.com ---

than (or) equal to the other number. A magnitude comparator is a combinational circuit that compares two
numbers A and B and determines their relative magnitude. The outcome of the comparator is specified by
three binary variables that indicate whether A>B, A=B (or) A
Truth table:

--- Content provided by FirstRanker.com ---

27 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K-map

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

28 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Logic Diagram:

--- Content provided by FirstRanker.com ---

Pin Diagram for IC 7485:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

29 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

8 Bit Magnitude Comparator:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections are given as per circuit diagram.
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

--- Content provided by FirstRanker.com ---

Result:

Thus the 2-bit and 8-bit magnitude comparator was designed and verified using the logic gates.

--- Content provided by FirstRanker.com ---

Outcome:

At the completion of an experiment student will able to design the 2-bit and 8-bit magnitude
comparator using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

A B A>B A=B A0 0 0 0
0 0 0 0
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
0 1 0
0 0 0 1
0 0 0 1
0 0 0 0

--- Content provided by FirstRanker.com ---

0 0 0 0
1 0 0
0 0 0 0
0 0 0 0
0 0 0 1

--- Content provided by FirstRanker.com ---

0 0 0 1
0 0 1
Viva ? Voce

--- Content provided by FirstRanker.com ---

30 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is magnitude comparator?
2. What is most significant bit?

--- Content provided by FirstRanker.com ---

3. Explain operation of AND gate.
4. Explain truth table of a comparator.
5. Explain magnitude comparator7485 IC.
6. What is 8-bit input Magnitude Comparator?
7. What is IC?

--- Content provided by FirstRanker.com ---

8. Explain the k-map simplification of A>B.
9. Explain the k-map simplification of A=B.
10. Explain the k-map simplification of A11. Draw the logic diagram of 1-bit magnitude comparator.
12. What is the truth table of 1-bit magnitude comparator?
13. What is the use of magnitude comparator?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Expt.No.7: CODE CONVERSION

--- Content provided by FirstRanker.com ---

31 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Aim:
To design, construct and study the performance of 4-bit different code converters

--- Content provided by FirstRanker.com ---

(i) Binary to gray code converter
(ii) Gray to binary code converter
(iii) BCD to excess-3 code converter
(iv) Excess-3 to BCD code converter

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. Magnitude comparator IC 7485 2
6. EX-OR gate IC 7486 1
7. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:

The availability of large variety of codes for the same discrete elements of information results in
the use of different codes by different systems. A conversion circuit must be inserted between the two

--- Content provided by FirstRanker.com ---

systems if each uses different codes for same information. Thus, code converter is a circuit that makes the
two systems compatible even though each uses different binary code. The bit combination assigned to
binary code to gray code. Since each code uses four bits to represent a decimal digit. There are four inputs
and four outputs. Gray code is a non-weighted code. The input variable are designated as B3, B2, B1, B0
and the output variables are designated as C3, C2, C1, Co. from the truth table, combinational circuit is

--- Content provided by FirstRanker.com ---

designed. The Boolean functions are obtained from K-Map for each output variable. A code converter is a
circuit that makes the two systems compatible even though each uses a different binary code. To convert
from binary code to Excess-3 code, the input lines must supply the bit combination of elements as
specified by code and the output lines generate the corresponding bit combination of code. Each one of the
four maps represents one of the four outputs of the circuit as a function of the four input variables. A two-

--- Content provided by FirstRanker.com ---

level logic diagram may be obtained directly from the Boolean expressions derived by the maps. These are
various other possibilities for a logic diagram that implements this circuit. Now the OR gate whose output is
C+D has been used to implement partially each of three outputs.

--- Content provided by FirstRanker.com ---

Logic diagram:

--- Content provided by FirstRanker.com ---

32 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


(i) Binary to gray code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for G3:

--- Content provided by FirstRanker.com ---

G3 = B3
K map for G2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

K map for G1:

--- Content provided by FirstRanker.com ---

33 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for G0:

--- Content provided by FirstRanker.com ---

Truth table:


0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1

0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

--- Content provided by FirstRanker.com ---

(ii) Gray to binary code converter

--- Content provided by FirstRanker.com ---

34 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for B3:



B3=G3

--- Content provided by FirstRanker.com ---

K map for B2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

35 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

G3 G2 G1 G0 B3 B2 B1 B0

0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1
0

--- Content provided by FirstRanker.com ---

0
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0
1

--- Content provided by FirstRanker.com ---

1
1
1

0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1

K map for B1:

--- Content provided by FirstRanker.com ---

K map for B0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

36 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

(iii) BCD to excess-3 code converter

Logic Diagram:

--- Content provided by FirstRanker.com ---

K map for E3:


E3 = B3 + B2 (B0 + B1)

--- Content provided by FirstRanker.com ---

K map for E2:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

37 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for E1:

--- Content provided by FirstRanker.com ---

K map for E0:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

(iv) Excess-3 to
B3 B2 B1 B0 G3 G2 G1 G0

0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
1
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

1
1

0
0

--- Content provided by FirstRanker.com ---

1
1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
1
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1

0
0
0

--- Content provided by FirstRanker.com ---

0
0
1
1
1

--- Content provided by FirstRanker.com ---

1
1
x
x
x

--- Content provided by FirstRanker.com ---

x
x
x

0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0
0
0
1
x

--- Content provided by FirstRanker.com ---

x
x
x
x
x

--- Content provided by FirstRanker.com ---

1
0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
x
x
x
x

--- Content provided by FirstRanker.com ---

x
x

1
0

--- Content provided by FirstRanker.com ---

1
0
1
0
1

--- Content provided by FirstRanker.com ---

0
1
0
x
x

--- Content provided by FirstRanker.com ---

x
x
x
x

--- Content provided by FirstRanker.com ---

38 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

BCD code converter

--- Content provided by FirstRanker.com ---

Logic Diagram:


K map for A:

--- Content provided by FirstRanker.com ---

A = X1 X2 + X3 X4 X1

K map for B:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

39 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

K map for C:

--- Content provided by FirstRanker.com ---

K map for D:

--- Content provided by FirstRanker.com ---

Truth table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

B3 B2 B1 B0 G3 G2 G1 G0

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

0
1
1
1
1

--- Content provided by FirstRanker.com ---

1

0
1
1

--- Content provided by FirstRanker.com ---

1
1
0
0
0

--- Content provided by FirstRanker.com ---

0
1

1
0

--- Content provided by FirstRanker.com ---

0
1
1
0
0

--- Content provided by FirstRanker.com ---

1
1
0

1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1
0

--- Content provided by FirstRanker.com ---

0
0
0
0
0

--- Content provided by FirstRanker.com ---

0
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0
0
0

--- Content provided by FirstRanker.com ---

1
1
1
1
0

--- Content provided by FirstRanker.com ---

0

0
0
1

--- Content provided by FirstRanker.com ---

1
0
0
1
1

--- Content provided by FirstRanker.com ---

0
0

0
1

--- Content provided by FirstRanker.com ---

0
1
0
1
0

--- Content provided by FirstRanker.com ---

1
0
1

--- Content provided by FirstRanker.com ---

40 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Procedure:
1. Connections were given as per circuit diagram.
2. Logical inputs were given as per truth table

--- Content provided by FirstRanker.com ---

3. Observe the logical output and verify with the truth tables.

Result:
Thus the code converters were designed and verified using the corresponding truth table.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the binary to gray converter.


1. What is binary code?

--- Content provided by FirstRanker.com ---

2. What is gray code?
3. What are the advantages of gray code?
4. What is unit distance code?
5. What is sequential code?
6. How to convert binary to gray code?

--- Content provided by FirstRanker.com ---

7. How to convert gray to binary code?
8. What is reflective code?
9. What are the advantages of EX ? 3 code?
10. Which code is used to arithmetic operation in digital circuits?
11. Explain the operation of EX ? OR.

--- Content provided by FirstRanker.com ---

12. What is K ? Map?
13. Draw the truth table of EX- OR gate.
14. What is SOP?
15. What is POS?
16. What is minterm?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

41 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.8: PARITY GENERATORS AND CHECKERS

--- Content provided by FirstRanker.com ---

Aim:
To implement the odd and even parity checkers using the logic gates and also to generate the odd parity
and even parity numbers using the generators

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Component Type Quantity
1 Trainer Kit - 1
2 EX-OR IC7486 1
3 NOT gate IC 7404 1

--- Content provided by FirstRanker.com ---

4 Connecting wires - Required


Theory:
Parity checking is used for error detection in data transmission.

--- Content provided by FirstRanker.com ---

Odd parity checkers:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
odd.

--- Content provided by FirstRanker.com ---

Even parity checker:

It counts the number of 1?s in the given input and produces a 1 in the output when the number of 1?s is
even.

--- Content provided by FirstRanker.com ---

Odd parity generators:

It generates an odd parity number. The odd parity checker circuit is used with the inverted output and also
the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5 bits
which is an odd parity number.

--- Content provided by FirstRanker.com ---

Even parity generator:

It generates an even parity number. The even parity checker circuit is used with the inverted output and
also the input bits. So when the input is a 4-bit number then the output of the generator circuit will have 5
bits which is an even parity number.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

42 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth table:

Input Checker output Generator output

--- Content provided by FirstRanker.com ---

A B C D D odd even odd even
0 0 0 1 1 0 00010 00011
0 0 1 0 1 0 00100 00101
0 0 1 1 0 1 00111 00110
0 1 0 0 1 0 01000 01001

--- Content provided by FirstRanker.com ---

0 1 0 1 0 1 01011 01010
0 1 1 0 0 1 01101 01100
0 1 1 1 1 0 01110 01111
1 0 0 0 1 0 10000 10001
1 0 0 1 0 1 10011 10010

--- Content provided by FirstRanker.com ---

1 0 1 0 0 1 10101 10100
1 0 1 1 1 0 10110 10111
1 1 0 0 0 1 11001 11000
1 1 0 1 1 0 11010 11011
1 1 1 0 1 0 11100 11101

--- Content provided by FirstRanker.com ---

1 1 1 1 0 1 11111 11110



Procedure:

--- Content provided by FirstRanker.com ---

1. The circuit is implemented using logic gates.

2. The inputs are given as per the truth table.

3. The corresponding outputs are noted.

--- Content provided by FirstRanker.com ---

4. The theoretical and practical values were verified.

Result:
The odd and even parity checkers are implemented using the logic gates and the odd parity and

--- Content provided by FirstRanker.com ---

even parity numbers are generated using the corresponding generators.

Outcome:
At the completion of an experiment student will able to verify the odd and even parity checker
using logic gates.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

43 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



1. What is parity bit?

--- Content provided by FirstRanker.com ---

2. Why parity bit is added to message?

3. What is parity checker?

--- Content provided by FirstRanker.com ---

4. What is odd parity?
5. What is even parity?

6. What are the gates involved for parity generator?
7. List the procedures to convert gray code into binary.

--- Content provided by FirstRanker.com ---

8. Why weighted code is called as reflective codes?
9. What is a sequential code?
10. What is error deducting code?
11. What is ASCII code?
12. What is hamming code?

--- Content provided by FirstRanker.com ---

13. List the binary weighted code.
14. List the binary non weighted code.
15. Write the hamming code equation
16. List the procedures to convert binary code into gray
17. What are the applications of gray code?

--- Content provided by FirstRanker.com ---

18. What are the applications of Excess- 3 code?
Viva ? Voce

--- Content provided by FirstRanker.com ---

44 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.9: MULTIPLEXER AND DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

Aim:
To design and verify the truth table of a 4X1 multiplexer & 1X4 demultiplexer
Apparatus required:

Sl. No Name of the Apparatus Range Quantity

--- Content provided by FirstRanker.com ---

1. Digital IC trainer kit 1
2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5. Connecting wires As required

--- Content provided by FirstRanker.com ---

Theory:
Multiplexing means transmitting a large number of information units over a smaller number of channels or
lines. A digital multiplexer is a combinational circuit that selects binary information from one of many input
lines and directs it to a single output line. The selection of particular input line is controlled by a set of

--- Content provided by FirstRanker.com ---

selection lines. Normally, there are 2
n
input lines and n selection lines whose bit combinations determines
which input is selected. A multiplexer is called a data selector, since it selects one of many inputs and
steers the binary information to the output line. A Strobe is also provided to allow the designer to disable all

--- Content provided by FirstRanker.com ---

output data until a specified time. Then, by allowing the STROBE to go low, the proper lead can be
selected. This feature is very useful where data might be changing the same time DATA SELECT leads
change. It is a very useful Medium Scale Integration (MSI) function and has a multitude of applications. It is
used for connecting two or more sources to a single destination among the computer units and it is useful
for constructing a common bus system. A decoder with an enable input can function as a demultiplexer. A

--- Content provided by FirstRanker.com ---

Demultiplexer is a circuit that receives information on a single line and transmits this information on one of
2
n
possible output lines. The selection of specific output line is controlled by the bit values of n selection
lines. The decoder and demultiplexer operations are obtained from the same circuit; a decoder with an

--- Content provided by FirstRanker.com ---

enable input is referred to as a decoder / de-multiplexer. The Strobe lead can be used to active or de-
active the entire IC, allowing time for the address lines to change the information is fed to the output.
Demultiplexers are useful anytime information from one source must be fed several places.

--- Content provided by FirstRanker.com ---

45 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

4 X 1 MULTIPLEXER

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

46 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1X4 DEMULTIPLEXER

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CIRCUIT DIAGRAM:

--- Content provided by FirstRanker.com ---

47 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:
The design of the 4x1 Multiplexer and 1x4 Demultiplexer circuits was done and their truth tables
were verified.

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the multiplexer and the
demultiplexer

--- Content provided by FirstRanker.com ---

1. What is multiplexer?
2. What is demultiplexer?

--- Content provided by FirstRanker.com ---

3. What are the advantages of multiplexer?
4. What are the advantages of demultiplexer?
5. What is select signal?
6. How to choose select signal in multiplexer?
7. How to choose select signal in demultiplexer?

--- Content provided by FirstRanker.com ---

8. Write the formula used in select signal.
9. What is the difference between the multiplexer and demultiplexer?
10. What is the application of multiplexer?
11. What is the application of demultiplexer?
12. Draw the truth table of multiplexer.

--- Content provided by FirstRanker.com ---

13. Draw the truth table of demultiplexer.
14. How many select signals are needed in 8*1 multiplexer?
15. How many select signals are needed in 8*1 demultiplexer?

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

48 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

EXP NO: 11 SHIFT REGISTER

--- Content provided by FirstRanker.com ---

Aim:

To design and implement the various shift register

Apparatus required:

--- Content provided by FirstRanker.com ---

Sl. No Name of the Apparatus Range Quantity
1. D flip flop IC 7474 2
2. OR gate IC 7432 1
3. IC Trainer kit 1

--- Content provided by FirstRanker.com ---

5. Connecting wires As required

Theory:

A register is capable of shifting its binary information in one or both directions is

--- Content provided by FirstRanker.com ---

known as shift register. The logical configuration of shift register consist of a D-Flip flop
cascaded with output of one flip flop connected to input of next flip flop. All flip flops receive
common clock pulses which causes the shift in the output of the flip flop.The simplest possible
shift register is one that uses only flip flop. The output of a given flip flop is connected to the
input of next flip flop of the register. Each clock pulse shifts the content of register one bit position

--- Content provided by FirstRanker.com ---

to right.
PIN Diagram:

Logic Diagram:
SERIAL IN SERIAL OUT

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

49 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Truth Table:

--- Content provided by FirstRanker.com ---

CLK Serial in Serial out
1 1 0
2 0 0
3 0 0

--- Content provided by FirstRanker.com ---

4 1 1
5 X 0
6 X 0
7 X 1

--- Content provided by FirstRanker.com ---

Logic Diagram:

Serial in parallel out:

--- Content provided by FirstRanker.com ---

Truth Table:

CLK DATA

--- Content provided by FirstRanker.com ---

OUTPUT
Q
A
Q
B

--- Content provided by FirstRanker.com ---

Q
C
Q
D

--- Content provided by FirstRanker.com ---

1 1 1 0 0 0
2 0 0 1 0 0
3 0 0 0 1 1
4 1 1 0 0 1

--- Content provided by FirstRanker.com ---

Parallel in Serial Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

50 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

CLK Q3 Q2 Q1 Q0 O/P
0 1 0 0 1 1
1 0 0 0 0 0
2 0 0 0 0 0

--- Content provided by FirstRanker.com ---

3 0 0 0 0 1

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Parallel in Parallel Out:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

PARALLEL IN PARALLEL OUT:

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per circuit diagram
2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.

Result:

--- Content provided by FirstRanker.com ---

Thus the implementation of shift registers using flip flops was completed successfully.
Outcome:

At the completion of an experiment student will able to design the various types of shift register.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

CLK
DATA INPUT OUTPUT
D

--- Content provided by FirstRanker.com ---

A D
B D
C D
D Q
A Q

--- Content provided by FirstRanker.com ---

B Q
C Q
D
1 1 0 0 1 1 0 0 1
2 1 0 1 0 1 0 1 0

--- Content provided by FirstRanker.com ---

51 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12: SYNCHRONOUS UP/DOWN COUNTER

Aim:

To design and implement 3 bit synchronous up/down counter

--- Content provided by FirstRanker.com ---

Apparatus required:

S.No Name of the Apparatus Range Quantity
1. JK Flip Flop IC 7474 2

--- Content provided by FirstRanker.com ---

2. OR gate IC 7432 1
3. NOT gate IC 7404 1
4. AND gate ( three input ) IC 7411 1
5 XOR gate IC 7486 1
6 IC Trainer Kit 1

--- Content provided by FirstRanker.com ---

7. Connecting wires As required


Theory:

--- Content provided by FirstRanker.com ---

A counter is a register capable of counting number of clock pulse arriving at its clock input.
Counter represents the number of clock pulses arrived. An up/down counter is one that is capable of
progressing in increasing order or decreasing order through a certain sequence. An up/down counter
is also called bidirectional counter. Usually up/down operation of the counter is controlled by up/down
signal. When this signal is high counter goes through up sequence and when up/down signal is low counter

--- Content provided by FirstRanker.com ---

follows reverse sequence.

K map:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

52 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Q Q
t+1 J K

--- Content provided by FirstRanker.com ---

0 0 0 X
0 1 1 X
1 0 X 1
1 1 X 0

--- Content provided by FirstRanker.com ---

State Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Characteristic Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Logic Diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

53 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Input
Up/Down
Present

--- Content provided by FirstRanker.com ---

State
Q
A
Q
B

--- Content provided by FirstRanker.com ---

Q
C

Next State
Q

--- Content provided by FirstRanker.com ---

A+1
Q
B+1
Q
C+1

--- Content provided by FirstRanker.com ---

A
J
A
K
A

--- Content provided by FirstRanker.com ---

B
J
B
K

--- Content provided by FirstRanker.com ---

B

C
J
C

--- Content provided by FirstRanker.com ---

K
C

0 0 0 0 1 1 1 1 X 1 X 1 X
0 1 1 1 1 1 0 X 0 X 0 X 1

--- Content provided by FirstRanker.com ---

0 1 1 0 1 0 1 X 0 X 1 1 X
0 1 0 1 1 0 0 X 0 0 X X 1
0 1 0 0 0 1 1 X 1 1 X 1 X
0 0 1 1 0 1 0 0 X X 0 X 1
0 0 1 0 0 0 1 0 X X 1 1 X

--- Content provided by FirstRanker.com ---

0 0 0 1 0 0 0 0 X 0 X X 1
1 0 0 0 0 0 1 0 X 0 X 1 X
1 0 0 1 0 1 0 0 X 1 X X 1
1 0 1 0 0 1 1 0 X X 0 1 X
1 0 1 1 1 0 0 1 X X 1 X 1

--- Content provided by FirstRanker.com ---

1 1 0 0 1 0 1 X 0 0 X 1 X
1 1 0 1 1 1 0 X 0 1 X X 1
1 1 1 0 1 1 1 X 0 X 0 1 X
1 1 1 1 0 0 0 X 1 X 1 X 1

--- Content provided by FirstRanker.com ---

Truth Table:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

1. Connections are given as per circuit diagram.

--- Content provided by FirstRanker.com ---

2. Logical inputs are given as per circuit diagram.
3. Observe the output and verify the truth table.
Result:
Thus the 3-bit synchronous up/down counters was implemented successfully.
Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to design the synchronous up/down counter.

--- Content provided by FirstRanker.com ---

54 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.12:

SIMULATION OF COMBINATIONAL CIRCUITS USING HDL

Aim:

--- Content provided by FirstRanker.com ---

To write a verilog code for half adder, full adder and multiplexer

Tools Required:
Xilinx 9.2

--- Content provided by FirstRanker.com ---

Program:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Simulation wave for half adder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

55 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


MULTIPLEXER:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Procedure:

--- Content provided by FirstRanker.com ---

1. Write and draw the Digital logic system.
2. Write the Verilog code for above system.
3. Enter the Verilog code in Xilinx software.
4. Check the syntax and simulate the above Verilog code (using ModelSim or Xilinx) and verify the
output waveform as obtained.

--- Content provided by FirstRanker.com ---

5. Implement the above code in Spartan III using FPGA kit.

Result:

Thus the verilog code for half adder, full adder and multiplexer were simulated and verified

--- Content provided by FirstRanker.com ---

successfully.

Outcome:

At the completion of an experiment student will able to be known the verilog code for half adder,

--- Content provided by FirstRanker.com ---

full adder and multiplexer.

--- Content provided by FirstRanker.com ---

56 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

Expt.No.13:

SIMULATION OF SEQUENTIAL CIRCUITS USING HDL

--- Content provided by FirstRanker.com ---

Aim:

To write a verilog code for RS, D, JK flip flop and up counter

--- Content provided by FirstRanker.com ---

Tools required:

Xilinx 9.2

Program:

--- Content provided by FirstRanker.com ---

RS Flip Flop:

--- Content provided by FirstRanker.com ---

D Flip Flop:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

57 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

JK Flip Flop:

--- Content provided by FirstRanker.com ---

Up Counter:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

58 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Result:

--- Content provided by FirstRanker.com ---

Thus the verilog code for RS,D,JK Filp Flop and up counter were simulated and verified
successfully.

Outcome:

--- Content provided by FirstRanker.com ---

At the completion of an experiment student will able to be known the verilog code for RS, D, JK
Filp Flop and up counter .

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

59 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

ADDITIONAL EXPERIMENTS

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

60 Format No.FirstRanker/stud/LM/34/issue:00/revision:00


Expt.No.8: ENCODER AND DECODER

--- Content provided by FirstRanker.com ---

Aim:

To study the operation of encoder and decoder circuits using logic gates

Apparatus required:

--- Content provided by FirstRanker.com ---

S. No Name of the Apparatus Range Quantity
1. Digital IC trainer 1
2. NOT Gate IC 7404 1
3. OR Gate IC 7432 1

--- Content provided by FirstRanker.com ---

4. AND Gate IC7408 1
5. Bread Board 1
6. NOT Gate IC7404 1
8. Connecting wires and probes As required

--- Content provided by FirstRanker.com ---

Theory:
Decoder
In digital electronics, a decoder can take the form of a multiple-input, multiple-output logic circuit that
converts coded inputs into coded outputs, where the input and output codes are different e.g. n-to-2n ,
binary-coded decimal decoders. Decoding is necessary in applications such as data multiplexing, 7

--- Content provided by FirstRanker.com ---

segment display and memory address decoding.
The example decoder circuit would be an AND gate because the output of an AND gate is "High" (1) only
when all its inputs are "High." Such output is called as "active High output". If instead of AND gate, the
NAND gate is connected the output will be "Low" (0) only when all its inputs are "High". Such output is
called as "active low output".

--- Content provided by FirstRanker.com ---

A slightly more complex decoder would be the n-to-2n type binary decoders. These types of decoders are
combinational circuits that convert binary information from 'n' coded inputs to a maximum of 2n unique
outputs. In case the 'n' bit coded information has unused bit combinations, the decoder may have less than
2n outputs. 2-to-4 decoder, 3-to-8 decoder or 4-to-16 decoder are other examples.
The input to a decoder is parallel binary number and it is used to detect the presence of a particular

--- Content provided by FirstRanker.com ---

binary number at the input. The output indicates presence or absence of specific number at the decoder
input. An encoder is a device, circuit, transducer, software program, algorithm or person that converts
information from one format or code to another. The purpose of encoder is standardization, speed,
secrecy, security, or saving space by shrinking size. Encoders are combinational logic circuits and they are
exactly opposite of decoders. They accept one or more inputs and generate a multibit output code.

--- Content provided by FirstRanker.com ---

Encoders perform exactly reverse operation than decoder. An encoder has M input and N output lines. Out



61 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

of M input lines only one is activated at a time and produces equivalent code on output N lines. If a device
output code has fewer bits than the input code has, the device is usually called an encoder

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Sl.No. Inputs Outputs
D7 D6 D5 D4 D3 D2 D1 D0 A B C
1. 0 0 0 0 0 0 0 1 0 0 0
2. 0 0 0 0 0 0 1 0 0 0 1
3. 0 0 0 0 0 1 0 0 0 1 0

--- Content provided by FirstRanker.com ---

4. 0 0 0 0 1 0 0 0 0 1 1
5. 0 0 0 1 0 0 0 0 1 0 0
6. 0 0 1 0 0 0 0 0 1 0 1
7. 0 1 0 0 0 0 0 0 1 1 0
8. 1 0 0 0 0 0 0 0 1 1 1

--- Content provided by FirstRanker.com ---

Procedure:

1. Make the circuit connections as shown in the figure.

2. Check the corresponding truth table.

--- Content provided by FirstRanker.com ---

Result:
The design of the Encoder and Decoder circuit was done and the input and output were obtained

--- Content provided by FirstRanker.com ---

Outcome:
At the completion of an experiment student will able to design the encoder circuit and the decoder circuit

--- Content provided by FirstRanker.com ---

Sl.No.
Inputs Outputs
A B Y3 Y2 Y1 Y0

--- Content provided by FirstRanker.com ---

1. 0 0 0 0 0 1
2. 0 1 0 0 1 0
3. 1 0 0 1 0 0
4. 1 1 1 0 0 0

--- Content provided by FirstRanker.com ---

62 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

1. What is Encoder?
2. What is decoder?
3. List the application of encoder.
4. List the application of decoder.
5. Draw the truth table of encoder.

--- Content provided by FirstRanker.com ---

6. Draw the truth table of decoder.
7. What are logic gates used encoder?
8. What are logic gates used encoder?
9. What is the difference between decoder with demultiplexer?
10. What is the difference between encoder with multiplexer?

--- Content provided by FirstRanker.com ---

11. How to choose the select signal in encoder?
12. How to choose the select signal in decoder?
13. Draw the logic diagram of encoder.
14. Draw the logic diagram of encoder.
15. What is the difference between encoder with decoder?

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Viva ? Voce

--- Content provided by FirstRanker.com ---

63 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Expt.No.2: IMPLEMENTATION OF BOOLEAN FUNCTIONS

Aim:
To design the logic circuit and verify the truth table of the given Boolean expression,
F (A, B, C, D) = ? (0, 1, 2, 5, 8, 9, 10)

--- Content provided by FirstRanker.com ---

Apparatus required:

Sl.No Name of the Apparatus Range Quantity
1. Digital IC trainer kit 1
2. AND gate IC 7408 1

--- Content provided by FirstRanker.com ---

3. OR gate IC 7432 1
4. NOT gate IC 7404 1
5. NAND gate IC 7400 1
6. NOR gate IC 7402 1
7. EX-OR gate IC 7486 1

--- Content provided by FirstRanker.com ---

8. Connecting wires As required


Circuit diagram:

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

Design:

--- Content provided by FirstRanker.com ---

Given , F (A,B,C,D) = ? (0,1,2,5,8,9,10)
Truth table:

--- Content provided by FirstRanker.com ---

64 Format No.FirstRanker/stud/LM/34/issue:00/revision:00

--- Content provided by FirstRanker.com ---

Sl. No.

--- Content provided by FirstRanker.com ---

INPUT OUTPUT
A B C D F=D?B?+C?(B?+A?D)
1. 0 0 0 0 1
2. 0 0 0 1 1
3. 0 0 1 0 1

--- Content provided by FirstRanker.com ---

4. 0 0 1 1 0
5. 0 1 0 0 0
6. 0 1 0 1 1
7. 0 1 1 0 0
8. 0 1 1 1 0

--- Content provided by FirstRanker.com ---

9. 1 0 0 0 1
10. 1 0 0 1 1
11. 1 0 1 0 1
12. 1 0 1 1 0
13. 1 1 0 0 0

--- Content provided by FirstRanker.com ---

14. 1 1 0 1 0
15. 1 1 1 0 0
16. 1 1 1 1 0
The output function F has four input variables hence a four variable Karnaugh Map is used to obtain a
simplified expression for the output as shown,

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

From the K-Map,

F = B? C? + D? B? + A? C? D

--- Content provided by FirstRanker.com ---

Since we are using only two input logic gates the above expression can be re-written as,
F = C? (B? + A? D) + D? B?

Now the logic circuit for the above equation can be drawn.

--- Content provided by FirstRanker.com ---

--- Content provided by FirstRanker.com ---

65 Format No.FirstRanker/stud/LM/34/issue:00/revision:00



Procedure:

--- Content provided by FirstRanker.com ---

1. Connections are given as per the circuit diagram.
2. For all the IC?s 7
th
pin is grounded and 14
th

--- Content provided by FirstRanker.com ---

pin is given +5 V supply.
3. Apply the inputs and verify the truth table for the given Boolean expression.

--- Content provided by FirstRanker.com ---

Result:
The truth table of the given Boolean expression was verified.
Outcome:
At the completion of an experiment student will able to design the Boolean expression.

--- Content provided by FirstRanker.com ---

FirstRanker.com - FirstRanker's Choice