CS 3351 - CSE DPCO Lab Record
CS 3351 - CSE DPCO Lab Record
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -2-
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -3-
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
SEMESTER - III
REGULATION-
2021
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -4-
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
Vision
To carve the youth as dynamic competent, valued and knowledgeable Technocrats
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -5-
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
Mission
M1: Inculcate academic excellence in engineering education to create talented
professionals M2: Promote research in basic sciences and applied engineering among
faculty and
students tofulfill the societal expectations.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -6-
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
REGISTER NO :
NAME :
VI SEMESTER
Vision
To develop highly competent engineers in the field of Electronics and Communication
Engineering to meet the global standards in education, research and innovation with
professional ethics
Mission
M1: Provide quality education to the students in core and allied fields by implementing
advanced pedagogies.
M2: Create ardor among faculty as well as students to achieve excellence in emerging
research areas
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -8-
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
M3: Imbibe industry relevant skills to the students through industry interaction thereby
bridging the campus to corporate gap.
M4: To endow the students with broad intellectual spectra pertaining to the sustainable
evelopment goals.
M5: To instill the thirst of lifelong learning among students to excel in their field of
interest
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -9-
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
REGISTER NO :
NAME :
VI SEMESTER
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 12
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
REGISTER NO :
NAME :
VI SEMESTER
REGISTER NO :
NAME :
VI SEMESTER
REGISTER NO :
NAME :
VI SEMESTER
solutions in societal and environmental contexts and demonstrate theknowledge, and need
for sustainable development.
PO8: Ethics: Ability to have ethical principles, responsibilities and norms of the engineering
practice.
PO9: Individual and team work: The professional must visualize and function effectively as
an individual and as member or leader in diverse teams and in multidisciplinary settings.
PO10: Communications: Communicate effectively on complex engineering activities with
engineering community and able to comprehend effective reports, design documentation,
make effective presentations and give clear instructions.
PO11: Project management and finance: Demonstrate engineering knowledge and
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 16
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
PSO1 : Design and develop Electronic circuits assimilating Futuristic technologies of Signal Processing,
Communication, VLSI and Embedded Systems using Modern Hardware and software tools to cater the
expectation of solving real time problems.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 17
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
PSO2: Instill the professional skill sets with ethical principles and tools for Networking, Communication
and integrated circuits to provide Solutions for societal benefits.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 18
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 19
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
Regulation 2021
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 20
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351.3 State the fundamentals of computer systems and analyze the execution of an
instruction
CS3351.4 Analyze different types of control design and identify hazards
CS3351.5 Identify the characteristics of various memory systems and I/O communication
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 21
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
Course PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
Code
CS3351.1 3 2 3 2 3 0 0 0 2 2 2 2
CS3351.2 1 1 3 2 3 0 0 0 2 2 2 2
CS3351.3 1 2 3 3 3 0 0 0 2 2 2 2
CS3351.4 1 2 3 3 3 0 0 0 2 2 2 2
CS3351.5 3 2 3 3 3 0 0 0 2 2 2 2
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 22
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351 3 2 3 3 3 0 0 0 2 2 2 2
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 23
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351 3 1
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 24
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
REGISTER NO :
NAME :
VI SEMESTER
2. Design and implementation of combinational circuits using gates for arbitrary functions.
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 27
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
INDEX
EXPT. PAGE
NAME OF THE EXPERIMENT
NO NO
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 28
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 29
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 30
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 31
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
11.
Design and implementation of parity generator / checker using
basic gates
12. Implementation 3-bit synchronous up/downcounter
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 32
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
AIM:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 33
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
LEARNING OBJECTIVE:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 34
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
APPARATUS REQUIRED:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 35
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 36
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
THOERY:
Logic gates are the basic elements that make up a digital system. The gate is a digital
circuit with one or more inputs, but only one output. By connecting the different gates in
different ways, we can build circuits that perform arithmetic and other functions.
The operation of a logic gate can be easily understood with the help of “truth table”.
A truth table is a table that shows all the input-output possibilities of a logic circuit ie., the
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 37
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
truth table indicates the outputs for different possibilities of the inputs.
The types of gates available are the AND, OR, NOT, NAND, NOR, exclusive-OR
and the exclusive-NOR. Except for the exclusive-NOR gate they are available in monolithic
integrated form.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 38
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
AND gate:
The AND gates has two or more inputs. It performs a logical multiplication. The
output is HIGH (1), when both the inputs are 1; otherwise the output from the gate is LOW
(0). The output from the AND gate is written as A.B.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 39
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
OR gate:
The OR gates has two or more inputs. It performs a logical addition. The output is
HIGH (1), if any of the inputs are 1; the output is LOW (0) if and only if all the inputs are 0.
The output from the AND gate is written as A+B.
NOT gate:
The NOT gate has only one input. It performs a basic logic function called
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 40
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
inversion. The output is HIGH (1), when the input is 0; the output is LOW (0) when the
input is 1. The output from the NOT gate is written as A’.
NAND gate:
The NAND gate is a contraction of AND-NOT. It has two or more inputs. The output
is HIGH (1), when any of the inputs are 0; the output is LOW (0), if and only if all the inputs
are 1. The output from the AND gate is written as (A.B)’. It is a universal gate.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 41
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
NOR gate:
The NOR gate is a contraction of OR-NOT. It has two or more inputs. The output is
HIGH (1), when all inputs are 0; the output is LOW (0), when any of the inputs are 1. The
output from the AND gate is written as (A+B)’. It is a universal gate.
EX-OR gate:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 42
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
The EX-OR gate has two or more inputs. The output is HIGH (1), when odd number
of inputs is 1. The output from the AND gate is written as (AB).
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 43
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
AND gate:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 44
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 45
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
OR gate:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 46
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 47
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
NOT gate:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 48
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 49
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 50
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 51
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 52
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
NOR gate:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 53
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
EX-OR gate:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 54
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 55
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
PROCEDURE:
1. Check the components for their working.
2. Insert the appropriate IC into the IC base.
3. Make connections as shown in the circuit diagram.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 56
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
4. Provide the input data via the input switches and observe the output on output LEDs
RESULT:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 57
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 58
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 59
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 60
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 61
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
1. Commutative Law
2. Associative Law
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 62
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 63
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
3. Distributive Law
REGISTER NO :
NAME :
VI SEMESTER
1. A+AB = A
2. A+AB =A+B
5. Idempotent Law
1. A+A = A
2. A.A = A
6. Complementary
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 65
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
Law 1. A+A' =
1
2. A.A' = 0
7. De Morgan’s Theorem
The complement of the sum is equal to the sum of the product of the individual
complements
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 66
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
A+B = A . B
The complement of the product is equal to the sum of the individual complements.
A.B = A + B
Logic Circuit :
1. Commutative Law
A+B = B+A
L.H.S R.H.S
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 67
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
Truth Table:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 68
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
ii A.B=B.A
L.H.S R.H.S
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 69
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
Truth Table:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 70
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
2. Associative Law
i) A+(B+C) = (A+B)+C
L.H.S R.H.S
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 71
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
Inputs Output
Inputs Output
A B C (A+B) F=(A+B)+C
A B C (B+C) F=A+(B+C)
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 72
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 73
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 74
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
3. Distributive Law
i) A+(B.C) = (A+B).(A+C)
L.H.S R.H.S
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 75
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 76
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
Inputs
Output
A B C (B.C) F=A+(B.C)
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 77
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
Inputs Output
A B C (A+B) (A+C) F=(A+B).(A+C)
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 78
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
ii)A.(B+C) = (A.B)+(A.C)
L.H.S R.H.S
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 79
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
REGISTER NO :
NAME :
VI SEMESTER
4. Absorption Law
i)A+AB = A ii)A.A+B = AB
L.H.S L.H.S
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 81
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 82
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
5. Idempotent Law
i)A+A = A ii)A.A = A
REGISTER NO :
NAME :
VI SEMESTER
6. Complementary Law
1. A+A' = 1 2. A.A' = 0
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 84
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 85
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
7. De Morgan’s Theorem
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 86
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 87
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
1.5 PROCEDURE:
1. Check the components for their working.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 88
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
1.6 RESULT:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 89
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 90
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
EX.NO :2
DATE:
DESIGN AND IMPLEMENTATION OF COMBINATIONAL CIRCUI
ARBITRARY FUNCTIONS
2.1 AIM: To Implement a Boolean function using NAND & NOR gates
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 91
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 92
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
REGISTER NO :
NAME :
VI SEMESTER
2.4. IMPLEMENTATION
Implement the Boolean function by using a logic gate.
F=∑(0,1,2,5,7)
Design :
Step: 1 Obtain Truth Table
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 94
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 95
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
Truth Table
Inputs Output
A B C F
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 96
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 97
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
3- Variable k-map
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 98
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
F=
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY - 99
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
2.5 PROCEDURE:
Check the components for their working.
Insert the appropriate IC into the IC base.
Make connections as shown in the circuit diagram.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
Provide the input data via the input switches and observe the output on output LEDs
Verify the Truth Table
2.6 RESULT:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
3.1 AIM:
To Design and implement the 4-bit adder/ subtractor and BCD adder using IC 7483.
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
3.4 THEORY:
REGISTER NO :
NAME :
VI SEMESTER
When M=0, the operation is B 0= B. The full adders receive the value of B and the
input carry is 0, and the circuit performs the addition operation, A+ B.
When M=1, the operation is B 1= B‟ and C0=1. The B inputs are all complemented
and a 1 is added through the input carry. Thus the circuit performs the subtraction operation,
i.e., A+ (2‟s complement of B) = A- B.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
3.5 IMPLEMENTATION
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
PIN DIAGRAM:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
TRUTH TABLE:
REGISTER NO :
NAME :
VI SEMESTER
0 0 0 1 0 1 1 1
1 0 1 0 1 0 1 1
1 1 1 0 1 1 1 1
1 0 1 0 1 1 0 1
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
BCD ADDER:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
LOGIC DIAGRAM:
4- Bit BCD Adder:
The digital system handles the decimal number in the form of binary coded decimal
numbers (BCD). A BCD adder is a circuit that adds two BCD bits and produces a sum digit
also in BCD.
In examining the contents of the table, it is apparent that when the binary sum is equal
to or less than (1001)2, the corresponding BCD number is identical, and therefore no
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
conversion is needed. When the binary sum is greater than 9 (1001) 2, we obtain a non-valid
BCD representation. The addition of binary 6 (0110) 2 to the binary sum converts it to the
correct BCD representation and also produces an output carry as required.
The logic circuit to detect sum greater than 9 can be determined by simplifying the
Boolean expression of the given truth table.
The two decimal digits, together with the input carry, are first added in the top 4-bit
binary adder to provide the binary sum. When the output carry is equal to zero, nothing is
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
added to the binary sum. When it is equal to one, binary (0110)2 is added to the binary sum
through the bottom 4-bit adder. The output carry generated from the bottom adder can be
ignored, since it supplies information already available at the output carry terminal. The
output carry from one stage must be connected to the input carry of the next higher-order
stage.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
TRUTH TABLE
REGISTER NO :
NAME :
VI SEMESTER
0 0 0 1 0
0 0 0 1 1
0 0 1 0 0
0 0 1 0 1
0 0 1 1 0
0 0 1 1 1
0 1 0 0 0
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
0 1 0 0 1
0 1 0 1 0
0 1 0 1 1
0 1 1 0 0
0 1 1 0 1
0 1 1 1 0
0 1 1 1 1
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
1 0 0 0 0
1 0 0 0 1
1 0 0 1 0
1 0 0 1 1
3.7 PROCEDURE:
REGISTER NO :
NAME :
VI SEMESTER
3.8 RESULT:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
EX.NO : 4
DATE:
IMPLEMENTATION OF CODE CONVERTORS
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
4.1 AIM:
To design and implement 4-bit
1. Binary to Gray code Converter
2. Gray to Binary code Converter
3. BCD to Excess-3 code Converter
4. Excess-3 code to BCD Converter
REGISTER NO :
NAME :
VI SEMESTER
REGISTER NO :
NAME :
VI SEMESTER
4.4 THEORY:
An 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
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
TRICHY -
ENGINEERING
REGISTER NO :
NAME :
VI SEMESTER
between the two systems if each uses different codes for the same information. Thus, code
converter is a circuit that makes the two systems compatible even though each uses different
binary code.
The input variable are designed as B 3,B2,B1,B0 and the output variables are designed as
G3,G2,G1,G0. From the truth table, combinational circuit is designed. The Boolean functions are
obtained from K-Map for each output variable.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
4.5 IMPLEMENTATION
BINARY TO GRAY CODE CONVERTER:
TRUTH TABLE:
K- Map Simplification:
CS3351- Digital Principles and Computer Organization Lab / III SEM / CSE / R2021
-
Logic Diagram:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
K-Map Simplification:
Logic Diagram:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
K-Map Simplification:
UJJ
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
Logic Diagram:
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 various other possibilities for a logic diagram that implements
this circuit.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
K-Map Simplification:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
Logic Diagram:
4.6 PROCEDURE:
1. Connections are given as per the logic diagram.
2. Logic inputs are given as per the truth table.
3. Observe the logic output and verify with the truth tables.
4.7 RESULT:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
EX.NO : 5
DATE:
IMPLEMENTATION OF ENCODER AND DECODER
5.1 AIM:
To design and implementation encoder and decoder
5.4 THEORY:
Encoder:
An encoder is a digital circuit that performs inverse operation of a decoder. An
encoder has 2n input lines and „n‟ output lines. In encoder the output lines generates the
binary code corresponding to the input value. In octal to binary encoder it has eight inputs,
one for each octal digit and three output that generates the corresponding binary code. In
encoder it is assumed that only one input has a value of one at any given time otherwise the
circuit is meaningless. It has an ambiguila that when all inputs are zero the outputs are zero.
The zero outputs can also be generated when D0=1.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
Decoder:
A decoder is a multiple output logic circuit which converts input into coded output
where input and output codes are different. The input code generally has few bits than the
output code. Each input code word produces a different output code word i.e., there is one to
one mapping can be expressed in truth table. In block diagram of decoder circuit the encoded
information is present as n input producing 2 n possible outputs. The 2n output values are from
0 through out 2n-1.
5.5 IMPLEMENTATION
Logic Diagram ( 2-to-4- Line Decoder with Enable Input):
Truth Table:
INPUTS OUTPUTS
E A B D3 D1 D2 D3
1 x x
0 0 0
0 0 1
0 1 0
0 1 1
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
ENCODER:
Logic Diagram:
Truth Table:
INPUTS OUTPUTS
Y1 Y2 Y3 Y4 Y5 Y6 Y7 A B C
1 0 0 0 0 0 0
0 1 0 0 0 0 0
0 0 1 0 0 0 0
0 0 0 1 0 0 0
0 0 0 0 1 0 0
0 0 0 0 0 1 0
0 0 0 0 0 0 1
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
No Inputs Outputs
D C B A 0 1 2 3 4 5 6 7 8 9
0 0 0 0 0
1 0 0 0 1
2 0 0 1 0
3 0 0 1 1
4 0 1 0 0
5 0 1 0 1
6 0 1 1 0
7 0 1 1 1
8 1 0 0 0
9 1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
Invali
d
1 1 0 1
1 1 1 0
1 1 1 1
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
5.6 PROCEDURE:
1.Connections are given as per the logic diagram.
2.Logic inputs are given as per the truth table.
3.Observe the logic output and verify with the truth tables.
5.8 RESULT:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
EX.NO : 6
DATE:
IMPLEMENTATION OF FUNCTIONS USING
MULTIPLEXER
6.1 AIM:
To design and implement functions using multiplexer
6.4 THEORY:
Multiplexer:
Multiplexer means transmitting a large number of information units over a small
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 a particular input line is controlled by a set of selection lines. Normally there are
2n input line and „n‟ selection lines whose bit combination determine which input is selected.
It is called as data selector, because the output depends on the input data bit that is selected.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
Demultiplexer:
The function of Demultiplexer is in contrast to multiplexer function. It takes
information from one line and distributes it to a given number of output lines. For this reason,
the demultiplexer is also known as a data distributor. Decoder can also be used as
Demultiplexer.
In the 1:4 demultiplexer circuit, the data input line goes to all of the AND gates. The
data select lines enable only one gate at a time and the data on the data input line will pass
through the selected gate to the associated data output line.
6.5 IMPLEMENTATIO
N MULTIPLEXER:
BLOCK DIAGRAM:
Function table:
S1 S0 Inputs Output
0 0 D0 S1’ S0’ D0
0 1 D1 S1’ S0 D1
1 0 D2 S1 S0’ D2
1 1 D3 S1 S0 D3
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
Logic Diagram:
Truth table:
Inputs Output
S1 S0 D0 D1 D2 D3 Y
0 0 0 0 0 0
0 0 1 0 0 0
0 1 0 0 0 0
0 1 0 1 0 0
1 0 0 0 0 0
1 0 0 0 1 0
1 1 0 0 0 0
1 1 0 0 0 1
1: 4 DEMULTIPLEXER:
Block Diagram
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
Function Table:
S1 S0 Inputs Output
0 0 X S1’ S0’ D0
0 1 X S1’ S0 D1
1 0 X S1 S0’ D2
1 1 X S1 S0 D3
Logic Diagram:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
Truth Table:
INPUT OUTPUT
S1 S0 I/P D0 D1 D2 D3
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
Solution:
There are 3 variables in the given expression, hence 2n = 23 = 8 : 1 multiplexer. So, the mux has 8
input lines, 3 selection lines, and one output.
The inputs, corresponding to the minterms (2, 3, 6, 7) are connected to logic 1 and the remaining
terms to logic 0(grounded). The given input variables are connected as three selection lines.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
Inputs Output
A B C F
0 0 0
0 0 1
0 1 0
0 1 1
1 0 0
1 0 1
1 1 0
1 1 1
6.6 PROCEDURE:
Connections are given as per the logic diagram.
Logic inputs are given as per the truth table.
Observe the logic output and verify with the truth tables.
6.7 RESULT:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
EX.NO : 7
DATE:
IMPLEMENTATION OF SYNCHRONOUS COUNTER
7.1 AIM:
To construct and verify 4 bit ripple counter, MOD-10 and MOD-12 ripple counter.
7.4 THEORY:
A counter is a register capable of counting number of clock pulse arriving at its clock
input. Counter represents the number of clock pulse arrived. A specified sequence of states
appears as counter output. This is the main difference between a register and a counter. There
are two types of counter, synchronous and asynchronous. In synchronous common clock is
given to all flip flop and in asynchronous, first flip flop is clocked by external pulse and then
each successive flip flop is clocked by Q or Q‟ output of pervious stage.
A ripple counter is a cascaded arrangement of flip-flops where the output of one flip-
flop drives the clock input of the following flip-flop. The number of flip-flops in the cascaded
arrangement depends upon the number of different logic states that it goes through before it
repeats the sequence, a parameter known as the modulus of the counter.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
In a ripple counter, also called an asynchronous counter or a serial counter, the clock
input is applied only to the first flip-flop, also called the input flip-flop, in the cascaded
arrangement. The clock input to any subsequent flip-flop comes from the output of its
immediately preceding flip-flop. For instance, the output of the first flip-flop acts as the clock
input to the second flip-flop, the output of the second flip-flop feeds the clock input of the
third flip-flop and so on.
7.5 IMPLEMENTATION
Inputs Outputs
Preset Clear Clock J K Q Q’
0 1 X X X 1 0
1 0 X X X 0 1
0 0 X X X 1 1
1 1 0 0 No Change
1 1 0 1 0 1
1 1 1 0 1 0
1 1 1 1 Toggle
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
TRUTH TABLE:
CLK QA QB QC QD
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
TRUTH TABLE:
CLK QA QB QC QD
0
1
2
3
4
5
6
7
8
9
10
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
TRUTH TABLE:
CLK QA QB QC QD
0
1
2
3
4
5
6
7
8
9
10
11
12
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
Logic Diagram
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
Up/down counter
Control Outputs
inputs Control Outputs
Up / inputs
CLK QA QB QC QD
Down CLK Up / QA QB QC QD
0 Initial state Down
17 1
1 0
18 1
2 0
19 1
3 0
20 1
4 0
21 1
5 0
22 1
6 0
23 1
7 0
24 1
8 0
25 1
9 0
26 1
10 0
27 1
11 0
28 1
12 0
29 1
13 0
30 1
14 0
31 1
15 0
32 1
16 0
7.6 PROCEDURE:
1. Connections are given as per the logic diagram.
2.Logic inputs are given as per the logic diagram.
3.Observe the logic output and verify with the truth tables.
7.7 RESULT:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
EX.NO : 8
DATE:
IMPLEMENTATION OF SHIFT REGISTER
8.1 AIM:
8.4 THEORY:
A register is capable of shifting its binary information in one or both directions is
known as shift register. A 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 to right.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
SHIFT REGISTER:
PIN DIAGRAM: (D-Flip-Flop)
Function Table:
Inputs Outputs
Preset Clear Clock D Q Q’
0 1 X X 1 0
1 0 X X 0 1
0 0 X X 1 1
1 1 0 0 1
1 1 1 1 0
1 1 0 X No Change
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
TRUTH TABLE:
CLK Serial IN Serial OUT
1 1
2 1
3 1
4 1
5 0
6 0
7 0
8 0
TRUTH TABLE:
OUTPUT
CLK DATA
Q3 Q2 Q1 Q0
1 1
2 0
3 0
4 1
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
TRUTH TABLE:
INPUTS OUTPUT
S/ L’ CLK
A B C D Q
0 0 1 0 0 1
1 1 1 0 0 1
1 2 1 0 0 1
1 3 1 0 0 1
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
8.6 PROCEDURE:
8.7 RESULT
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
EX.NO : 10
DATE:
DESIGN AND IMPLEMENTATION OF MAGNITUDE
COMPARATOR
AIM:
To design and implement
(i) 2-bit magnitude comparator using logic gates.
(ii) 8-bit magnitude comparator using IC 7485.
APPARATUS REQUIRED:
THEORY:
TRUTH TABLE:
Inputs Outputs
A1 A0 B1 B0 A>B A=B A<B
0 0 0 0
0 0 0 1
0 0 1 0
0 0 1 1
0 1 0 0
0 1 0 1
0 1 1 0
0 1 1 1
1 0 0 0
1 0 0 1
1 0 1 0
1 0 1 1
1 1 0 0
1 1 0 1
1 1 1 0
1 1 1 1
DESIGN:
A = A1A0
B = B1 B0
Xi = AiBi + Ai′Bi′
Xi = (Ai Bi)′ for i = 0,1
(A = B) = X1 X0
(A>B) = A1B1′ +X1A0B0′
(A<B) = A1′B1 +X1A0′B0
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
To satisfy the equality condition of two numbers A and B, it is necessary that all
Xi must be equal to logic 1. This indicates the AND operation of all Xi variables. In other
words, we can write the Boolean expression for two equal 2-bit numbers.
(A = B) = X1 X0.
The binary variable (A=B) is equal to 1 only if all pairs of digits of the two numbers are
equal.
LOGIC DIAGRAM:
The symbols (A>B) and (A<B) are binary output variables that are equal to 1 when A>B or
A<B, respectively.
Truth Table:
PROCEDURE:
1. Connections are given as per the logic diagram.
2. Logic inputs are given as per the truth table.
3. Observe the logic output and verify with the truth tables.
RESULT:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
EX.NO : 11
DATE:
DESIGN AND IMPLEMENTATION OF 16-BIT
ODD/EVEN PARITY GENERATOR AND CHECKER
AIM:
To design and implement 16 bit odd /even parity checker generator using IC 74180.
APPARATUS REQUIRED:
THEORY:
A Parity is a very useful tool in information processing in digital computers to
indicate any presence of error in binary information. External noise and loss of signal
strength causes loss of data bit information while transporting data from one device to other
device, located inside the computer or externally. To indicate any occurrence of error, an
extra bit is included with the message according to the total number of 1s in a set of data,
which is called parity.
If the extra bit is considered 0 if the total number of 1s is even and 1 for odd
quantities of 1s in a set of data, then it is called even parity. On the other hand, if the extra bit
is 1 for even quantities of 1s and 0 for an odd number of 1s, then it is called odd parity.
The message including the parity is transmitted and then checked at the receiving end
for errors. An error is detected if the checked parity does not correspond with the one
transmitted. The circuit that generates the parity bit in the transmitter is called a parity
generator and the circuit that checks the parity in the receiver is called a parity checker.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
FUNCTION TABLE:
INPUTS OUTPUTS
Number of Data Inputs
(D0 - D7) PE PO ∑E ∑O
EVEN 1 0
ODD 1 0
EVEN 0 1
ODD 0 1
X 1 1
X 0 0
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
TRUTH TABLE:
D7 D6 D5 D4 D3 D2 D1 D0 D7 D6 D5 D4 D3 D2 D1 D0 PE PO ∑E ∑O
1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 1 0
1 1 0 0 0 0 0 0 1 1 0 0 0 0 0 0 0 1
1 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 1
TRUTH TABLE:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
The parity checker circuit produces a check bit and is very similar to the parity
generator circuit. If the check bit is 1, then it is assumed that the received data is incorrect.
The check bit will be 0 if the received data is correct. The table shows the truth table for the
even parity checker.
In even parity, the added parity bit will make the total number 1‟s even amount. In
odd parity, the added parity bit will make the total number 1‟s odd amount. The parity
checker circuit checks for possible errors in the transmission. If the information is passed in
even parity, the bits required must have an even number of 1‟s. An error occur during
transmission, if the received bits have an odd number of 1‟s indicating that one bit has
changed in value during transmission.
PROCEDURE:
1. Connections are given as per the logic diagram.
2. Logic inputs are given as per the truth table.
3. Observe the logic output and verify with the truth tables
RESULT:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
EX.NO : 12
DATE:
DESIGN AND IMPLEMENTATION OF 3-BIT
SYNCHRONOUS COUNTER
AIM:
To design and implement 3 bit synchronous up/down counter using JK flip-flop.
APPARATUS REQUIRED:
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 is also called bi-directional counter. Usually up/down operation of the
counter is controlled by up/down signal. When this signal high counter goes through up
sequence and when up/down signal is low counter follows reverse sequence.
The counter counts upwards when UP control are logic „1‟ and DOWN control is
logic „0‟. In this case the clock input of each flip-flop other than the LSB flip-flop is fed from
the normal output of the immediately preceding flip-flop. The counter counts downwards
when the UP controls input are logic „0‟ and DOWN control is logic „1‟. In this case, the
clock input of each flip-flop other than the LSB flip-flop is fed from the complemented
output of the immediately preceding flip-flop.
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
TRUTH TABLE:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
K-MAP SIMPLIFICATION:
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /
-
LOGIC DIAGRAM:
PROCEDURE:
RESULT
CS3351- Digital Principles and Computer Organization Lab / III SEM / AI&DS /