APS COLLEGE OF ENGINEERING
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
Vision
Mould the raw youngstar into responsible citizens and competent professionals to take up
challenges at international level & to build a strong Tech
Mission
1. To provide an excellent infrastructure and conducive ambience in the
institute
2. To impart quality technical education combined with ethical values
3. To inculcate attitude for research and developmental activities
4. To have a legacy for development of next level engineers and technologies
Syllabus
Digital Design and Computer Organization Semester 3
Course Code BCS302 CIE Marks 50
Teaching Hours/Week (L:T:P: S) 3:0:2:0 SEE Marks 50
Total Hours of Pedagogy 40 hours Theory + 20 Hours of Practicals Total Marks
100 Credits 04 Exam Hours 3
Examination nature (SEE) Theory
PRACTICAL COMPONENT OF IPCC
1. Given a 4-variable logic expression, simplify it using appropriate technique and simulate
the same using basic gates.
2. Design a 4 bit full adder and subtractor and simulate the same using basic gates.
3. Design Verilog HDL to implement simple circuits using structural, Data flow
and Behavioural model.
4. Design Verilog HDL to implement Binary Adder-Subtractor – Half and Full Adder, Half and
Full Subtractor.
5. Design Verilog HDL to implement Decimal adder.
6. Design Verilog program to implement Different types of multiplexer like 2:1, 4:1 and 8:1.
7. Design Verilog program to implement types of De-Multiplexer.
8. Design Verilog program for implementing various types of Flip-Flops such as SR, JK and D.
Course outcomes (Course Skill Set):
At the end of the course, the student will be able to:
CO1: Apply the K–Map techniques to simplify various Boolean expressions.
CO2: Design different types of combinational and sequential circuits along with Verilog
programs.
CO3: Describe the fundamentals of machine instructions, addressing modes and Processor
performance.
CO4: Explain the approaches involved in achieving communication between processor and
I/O devices.
CO5:Analyze internal Organization of Memory and Impact of cache/Pipelining on Processor
Performance.
Assessment Details (both CIE and SEE)
The weightage of Continuous Internal Evaluation (CIE) is 50% and for Semester End Exam (SEE) is 50%.
The minimum passing mark for the CIE is 40% of the maximum marks (20 marks out of 50) and for the
SEE minimum passing mark is 35% of the maximum marks (18 out of 50 marks). A student shall be
deemed to have satisfied the academic requirements and earned the credits allotted to each subject/
course if the student secures a minimum of 40% (40 marks out of 100) in the sum total of the CIE
(Continuous Internal Evaluation) and SEE (Semester End Examination) taken together.
CIE for the theory component of the IPCC (maximum marks 50)
● IPCC means practical portion integrated with the theory of the course.
● CIE marks for the theory component are 25 marks and that for the practical
component is 25 marks.
● 25 marks for the theory component are split into 15 marks for two Internal Assessment
Tests (Two Tests, each of 15 Marks with 01-hour duration, are to be conducted) and 10 marks for
other assessment methods mentioned in 22OB4.2. The first test at the end of 40-50% coverage of
the syllabus and the second test after covering 85-90% of the syllabus.
● Scaled-down marks of the sum of two tests and other assessment methods will be CIE marks
for the theory component of IPCC (that is for 25 marks).
● The student has to secure 40% of 25 marks to qualify in the CIE of the theory component
of IPCC. CIE for the practical component of the IPCC
● 15 marks for the conduction of the experiment and preparation of laboratory record, and
10 marks for the test to be conducted after the completion of all the laboratory sessions.
● On completion of every experiment/program in the laboratory, the students shall be
evaluated including viva-voce and marks shall be awarded on the same day.
● The CIE marks awarded in the case of the Practical component shall be based on the
continuous evaluation of the laboratory report. Each experiment report can be evaluated for 10
marks. Marks of all experiments’ write-ups are added and scaled down to 15 marks.
● The laboratory test (duration 02/03 hours) after completion of all the experiments
shall be conducted for 50 marks and scaled down to 10 marks.
● Scaled-down marks of write-up evaluations and tests added will be CIE marks for the
laboratory component of IPCC for 25 marks.
● The student has to secure 40% of 25 marks to qualify in the CIE of the practical
component of the IPCC.
SEE for IPCC
Theory SEE will be conducted by University as per the scheduled timetable, with common question
papers for the course (duration 03 hours)
1. The question paper will have ten questions. Each question is set for 20 marks.
2. There will be 2 questions from each module. Each of the two questions under a module
(with a maximum of 3 sub-questions), should have a mix of topics under that module.
3. The students have to answer 5 full questions, selecting one full question from each module.
4. Marks scored by the student shall be proportionally scaled down to 50 Marks
The theory portion of the IPCC shall be for both CIE and SEE, whereas the practical portion will
have a CIE component only. Questions mentioned in the SEE paper may include questions from
the practical component.
CONTENTS
Sl. No. Name of Experiments Page No.
Given a 4-variable logic expression, simplify it using appropriate
1 technique and simulate the same using basic gates.
1
Design a 4-bit full adder and subtractor and simulate the same using
2 basic gates.
3
Design Verilog HDL to implement simple circuits using structural,
3 Data flow and Behavioural model.
14
Design Verilog HDL to implement Binary Adder-Subtractor – Half and
4 Full Adder, Half and Full Subtractor.
17
5 Design Verilog HDL to implement Decimal adder. 25
Design Verilog program to implement Different types of multiplexer
6 like 2:1, 4:1 and 8:1.
26
7 Design Verilog program to implement types of De-Multiplexer. 32
Design Verilog program for implementing various types of Flip-Flops
8 such as SR, JK and D.
39
Steps To Be Followed for Executing
9 The Verilog Programs Using Xilinx Software
46
10 Viva Questions 62
1. Given a 4-variable logic expression, simplify it using
appropriate technique and simulate the same using basic gates.
We can minimize Boolean expressions of 3, 4 variables very easily using K-map without
using any Boolean algebra theorems. K-map can take two forms Sum of Product (SOP) and
Product of Sum (POS) according to the need of problem. K-map is table like representation but
it gives more information than TRUTH TABLE. We fill grid of K-map with 0’s and 1’s then solves
it by making groups.
Components Required:
1. NOT Gate 7404—2 Nos
2. AND Gate 7408 ---2 Nos
3. OR Gate 7432--- 2 Nos
4. Digital trainer kit
5. Patch Chords
F(ABCD)= ∑ m (1,3,4,6,8,9,11,13,15) + d (0,2,14)
F(ABCD)= A’D’ + B’C’+B’D+AD OR F(ABCD)= A’D’ + B’C’+A’B’+AD
Truth Table to be Verified: -
module p1verilog(a,b,c,d,y);
input a;
input b;
input c;
input
d;
output y;
reg y;
always @ (a, b,c,d)
begin
y= (~a & ~d) | (~b & ~c) | (~b & d) | (a & d);
end
endmodul
e OUTPUT:
2. Design a 4-bit full adder and subtractor and simulate the same
using basic gates.
Full adder
BOOLEAN EXPRESSIONS:
sum= A ⊕ B ⊕ C
carry=A B + B C + A C
TRUTH TABLE:
INPUTS OUTPUTS
A B C sum carry
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1
Full adder: -
Step 1
module p2updated(a,b,sum,carry,c);
input [3:0] a;
input [3:0] b;
output [3:0]
sum; output
carry;
input c;
wire
c1,c2,c3;
fa FA0(sum[0],c1,a[0],b[0],c);
fa FA1(sum[1],c2,a[1],b[1],c1);
fa FA2(sum[2],c3,a[2],b[2],c2);
fa FA3(sum[3],carry,a[3],b[3],c3);
endmodule
Step 2 (create the file fa.v under the main module p2updated.v)
i) right click on main module p2updated.v
ii)select new source ->Verilog module ->enter file name as fa.v
iii) fa.v sub module gets created under the main module as seen in the process window
iv) type the code in the sub module fa.v and save.
v) compile both the main module p2updated.v and sub module fa.v
module fa(sum,carry,a,b,cin);
output sum;
output
carry; input
a; input b;
input cin;
wire w1,w2,w3,w4,w5,w6,w7,w8,w9,w10;
not G1(w1,a);
not G2(w2,b);
not G3(w3,cin);
and G4(w4,a,b,cin);
and
G5(w5,w1,w2,cin);
and G6(w6,w1,b,w3);
and G7(w7,a,w2,w3);
and G8(w8,a,b);
and G9(w9,b,cin);
and G10(w10,a,cin);
or G11(sum,w4,w5,w6,w7);
or G12(carry,w8,w9,w10);
endmodule
Step1 output
Step2 output
BOOLEAN EXPRESSIONS:
Full
subtractor
diff=A⨁B⨁C
borr= A B + B C + A C
TRUTH TABLE
INPUTS OUTPUTS
A B C diff borr
0 0 0 0 0
0 0 1 1 1
0 1 0 1 1
0 1 1 0 1
1 0 0 1 0
1 0 1 0 0
1 1 0 0 0
1 1 1 1 1
Full subtractor: -
Changes to be made for full subtractor
Step1
module ps(diff,B4,a,b,B0);
input [3:0] a;
input [3:0] b;
input B0;
output [3:0]
diff; output B4;
wire B1,B2,B3;
fs FS0(diff[0],B1,a[0],b[0],B0);
fs FS1(diff[1],B2,a[1],b[1],B1);
fs FS2(diff[2],B3,a[2],b[2],B2);
fs FS3(diff[3],B4,a[3],b[3],B3);
endmodule
step2
module fs(diff,borr,a,b,cin);
input a;
input b;
input cin;
output diff;
output
borr;
wire w1,w2,w3,w4,w5,w6,w7,w8,w9,w10;
not G1(w1,a);
not G2(w2,b);
not G3(w3,cin);
and G4(w4,a,b,cin);
and
G5(w5,w1,w2,cin);
and G6(w6,w1,b,w3);
and G7(w7,a,w2,w3);
and G8(w8,w1,b);
and G9(w9,b,cin);
and G10(w10,w1,cin);
or G11(diff,w4,w5,w6,w7);
or G12(borr,w8,w9,w10);
endmodule
Output:-
3. Design Verilog HDL to implement simple circuits using structural, Data
flow and Behavioural model.
Structural Model
module p3structural(a,b,c,d,e,y);
input a;
input b;
input c;
input d;
input e;
output y;
wire
Y1,Y2;
and G1(Y1,a,b);
and G2(Y2,c,d,e);
or G3(Y,Y1,Y2);
endmodule OUTPUT: -
Data Flow Model
module
p31(a,b,c,d,e,y);
input a;
input b;
input c;
input d;
input e;
output
y;
wire Y1,Y2;
assign Y1=a & b;
assign Y2= c&d&e;
assign y= Y1|Y2;
endmodule
OUTPUT: -
Behavioral Model
module
p3behavioral(a,b,c,d,e,y); input
a;
input b;
input c;
input d;
input e;
output
y;
reg y;
always @(a,b,c,d,e)
begin
y= (a & b) | (c & d &e);
end
endmodule
OUTPUT: -
4. Design Verilog HDL to implement Binary Adder-Subtractor – Half and
Full Adder, Half and Full Subtractor.
Half adder: -
BOOLEAN EXPRESSIONS:
sum=A ⊕ B
cout=A B
TRUTH TABLE
INPUTS OUTPUTS
A B sum cout
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1
module p4addsub(a,b,sum,cout);
input a;
input b;
output
sum;
output
cout;
reg sum, cout;
always @(a,b)
begin
sum = a ^ b;
cout = a & b;
end
endmodule
OUTPUT: -
Half Subtractor
BOOLEAN
EXPRESSIONS:
Diff = A ⊕
B Borr = A¯
TRUTH TABLE
INPUTS OUTPUTS
A B Diff Borr
0 0 0 0
0 1 1 1
1 0 1 0
1 1 0 0
module p4hs(a,b,Diff,Borr);
input a;
input b;
output Diff;
output Borr;
reg Diff, Borr;
always @(a,b)
begin
Diff = a ^ b;
Borr = (~ a) &
b; end
endmodule
OUTPUT: -
Full Adder
BOOLEAN EXPRESSIONS
Sum= A ⊕ B ⊕ Cin
Cout=A B + B Cin + A Cin
TRUTH TABLE
INPUTS OUTPUTS
A B Cin sum cout
0 0 0 0 0
0 0 1 1 0
0 1 0 1 0
0 1 1 0 1
1 0 0 1 0
1 0 1 0 1
1 1 0 0 1
1 1 1 1 1
module p4fa(a,b,cin,sum,cout);
input a;
input b;
input cin;
output
sum;
output
cout;
reg sum, cout;
always @(a,b,cin)
begin
sum = a^b^cin;
cout= (a & b) | (b & cin) | (a & cin)
; end
endmodule
OUTPUT: -
Full Subtractor
BOOLEAN EXPRESSIONS
Diff=A⊕B⊕C
borr= A¯ B + B C + A¯ C
TRUTH TABLE
INPUTS OUTPUTS
A B C diff borr
0 0 0 0 0
0 0 1 1 1
0 1 0 1 1
0 1 1 0 1
1 0 0 1 0
1 0 1 0 0
1 1 0 0 0
1 1 1 1 1
module p4fs(a,b,c,diff,borr);
input a;
input b;
input c;
output diff;
output borr;
reg diff, borr;
always @(a,b,c)
begin
diff = a^b^c;
borr= (~a & b) | (b & c) | (~a & c) ;
end
endmodule
OUTPUT: -
5.Design Verilog HDL to implement Decimal adder.
This Verilog module, "DecimalAdder," takes two 4-bit decimal inputs A and B and produces a
4-bit sum (Sum) and a carry-out (CarryOut) output. The logic inside the "always" block
performs decimal addition with carry propagation, and it also handles the case when the
result is greater than 9. In such cases, it adds 6 to the result and updates the carry
accordingly.
module p5deci(a,b,sum,cout);
input [3:0] a;
input [3:0] b;
output [3:0]
sum; output
cout;
reg [3:0] sum;
reg cout;
always@ (a,b)
begin
{cout,sum} = a+b;
if(a>9 || b>9 || sum>9)
begin
{cout,sum} = sum+6;
end
end
endmodul
e
OUTPUT: -
6. Design Verilog program to implement Different types of multiplexer
like 2:1, 4:1 and 8:1.
2:1 Mux
module p621(y,d0,d1,A);
output y;
input d0;
input d1;
input A;
reg y;
always @ (d0,d1,A)
begin
y=((~A & d0)|(A & d1));
end
endmodule
output: -
4:1 Mux
module p641(y,d0,d1,d2,d3,a0,a1);
output y;
input d0;
input d1;
input d2;
input d3;
input a0;
input a1;
reg y;
always @
(d0,d1,d2,d3,a0,a1) begin
y= (~a0 & ~a1 & d0) | (~a0 & a1 & d1) | (a0 & ~a1 & d2) | (a0 & a1 & d3);
end
endmodule
OUTPUT: -
8:1 Mux
module p681(y,d0,d1,d2,d3,d4,d5,d6,d7,a0,a1,a2);
output y;
input d0;
input d1;
input d2;
input d3;
input d4;
input d5;
input d6;
input d7;
input a0;
input a1;
input a2;
reg y;
always @ (d0,d1,d2,d3,d4,d5,d6,d7,a0,a1,a2)
begin
y= (~a0 & ~a1 & ~a2 & d0 ) |
(~a0 & ~a1 & a2 & d1) |
(~a0 & a1 & a2 & d2) |
( ~a0 & a1 & a2 & d3) |
(a0 & ~a1 & ~a2 & d4) |
(a0 & ~a1 & a2 & d5) |
(a0 & a1 & ~a2 & d6) |
(a0 & a1 & a2 & d7) ;
end
endmodul
e OUTPUT: -
7. Design Verilog program to implement types of De-Multiplexer.
1:2 Demultiplexer
module P712(D,Y0,Y1,A);
input D;
output
Y0;
output
Y1; input
A;
reg Y0,Y1;
always @ (A,D)
begin
Y0=(~A & D);
Y1=(A & D);
end
endmodul
e
OUTPUT: -
1:4 Demultiplexer
module P714(D,A0,A1,Y0,Y1,Y2,Y3);
input D;
input A0;
input A1;
output
Y0;
output
Y1;
output
Y2;
output
Y3;
reg Y0,Y1,Y2,Y3;
always @ (A0,A1,D)
begin
Y0=(~A0 & ~A1 & D);
Y1=(~A0 & A1 & D);
Y2=(A0 & ~A1 & D);
Y3=(A0 & A1 & D);
end
endmodul
e
OUTPUT: -
1:8 Demultiplexer
module P718(D,A0,A1,A2,Y0,Y1,Y2,Y3,Y4,Y5,Y6,Y7);
input D;
input A0;
input A1;
input A2;
output
Y0;
output
Y1;
output Y2;
output Y3;
output Y4;
output Y5;
output Y6;
output Y7;
reg Y0,Y1,Y2,Y3,Y4,Y5,Y6,Y7;
always @ (A0,A1,A2,D)
begin
Y0=(~A0 & ~A1 & ~A2 &
D); Y1=(~A0 & ~A1 & A2 &
D); Y2=(~A0 & A1 & ~A2 &
D); Y3=(~A0 & A1 & A2 &
D); Y4=(A0 & ~A1 & ~A2 &
D); Y5=(A0 & ~A1 & A2 &
D); Y6=(A0 & A1 & ~A2 &
D); Y7=(A0 & A1 & A2 & D);
end
endmodul
e
OUTPUT: -
8. Design Verilog program for implementing various types of Flip-Flops
such as SR, JK and D.
SR FLIP-FLOP
module p8sr(s,r,clk,rst,q,qbar);
input s;
input r;
input clk;
input rst;
output q;
output
qbar;
reg q,qbar;
always@(posedge clk)
begin
if(rst)
q<=1'b0
else if (s==1'b0 && r==1'b0) q<=q;
else if (s==1'b0 && r==1'b1) q<=1'b0;
else if (s==1'b1 && r==1'b0) q<=1'b1;
else if (s==1'b1 && r==1'b1) q<=1'bx;
assign qbar=~q;
end
endmodul
OUTPUT: -
JK FLIP-FLOP
module p8jk(j,k,clk,rst,q,qbar);
input j;
input k;
input clk;
input rst;
output q;
output qbar;
reg q,qbar;
always@(posedge clk)
begin
if(rst)
q<=1'b0
else if (j==1'b0 && k==1'b0) q<=q;
else if (j==1'b0 && k==1'b1) q<=1'b0;
else if (j==1'b1 && k==1'b0) q<=1'b1;
else if (j==1'b1 && k==1'b1) q<= ~q;
assign qbar = ~q;
end
endmodul
e
OUTPUT: -
D FLIP-FLOP
module
p8dff(d,clk,q);
input d;
input
clk;
output q;
reg q;
always @(posedge clk)
begin
q<=d
; end
endmodule
OUTPUT: -
STEPS TO BE FOLLOWED FOR EXECUTING
THE VERILOG PROGRAMS USING XILINX SOFTWARE
1. click on the project navigator.
2. go to the file and select new project.
3. enter the project name and click next.
4. select device family cool runner XPLA3 CPL (by default) click next.
5. click on new source.
6. select verilog module, give the file name and click next.
7. enter the appropriate variables under port name and mention direction
as input or output as per the program.
8. type the program
9. save the program.
10. click on synthesize -XST
11. after completing synthesize process click on the launch modelsim simulator.
12. editing the values for the variable can be done by selecting edit and force.
13. enter the values according the program.
14. the value for the input and output variable will be displayed along with
the graph shown below.
VIVA QUESTIONS
1. Define a logic gate.
2. What are basic gates?
3. Why NAND and NOR gates are called as universal gates?
4. State De morgans theorem
5. Give examples for SOP and POS
6. Explain how transistor can be used as NOT gate
7. Realize logic gates using NAND and NOR gates only
8. List the applications of EX-OR and EX~NOR gates
9. What is a half adder?
10. What is a full adder?
11. Differentiate between combinational and sequential circuits. Give examples
12. Give the applications of combinational and sequential circuits
13. Define flip flop
14. What is an excitation table?
15. What is race around condition?
16. How do you eliminate race around condition?
17. What is minterm an d max term?
18. Define multiplexer/ data selector
19. What is a demultiplexer?
20. Give the applications of mux and demux
21. What is a encoder and decoder?
22. Compare mux and encoder
23. Compare demux and decoder
24. What is a priority encoder?
25. What are counters? Give their applications.
