CSC203 - Digital Logic Design - Past Questions
CSC203 - Digital Logic Design - Past Questions
MATRIC NO
DEPARTMENT OF COMPUTER SCIENCE
FIRST SEMESTER EXAMINATION 2014/2015 SESSION
COURSE CODE/TITLE: CSC203 / DIGITAL LOGIC DESIGN
INSTRUCTIONS – ANSWER ALL QUESTIONS IN “SECTION A” AND ANY TWO IN
“SECTION B”
TIME ALLOWED – 21/2HOURS
SECTION A
a. Write short notes on the following terms. Describe with the aid of diagram(s) where and if applicable.
(i). Logic gates (ii). Flip-flops (iii). Propagation delays (iv). Race condition
b. Differentiate between combinational and sequential circuits.
c. With the aid of explicit diagrams and simplified characteristic tables, describe (very briefly) each of the
following latches:
(i). S-R (with NAND and NOR gates) (ii). D (iii). J-K
d. State and prove the Consensus theorem
e. The sequential circuit in the figure below consists of two D flip-flops A and B, two inputs x and y; and the
other output y.
0 1 1 0 0 1 1 1
1 1 0 0 0 1 0 0
0 0 1 0 1 1 0 1
h g f e D c b a
SECTION B
1a. A logic circuit has two 2-bit natural binary inputs A and B. A is given by A 1 and A0 where A1 is the most
significant bit. Similarly for B. The circuit has three (3) outputs X, Y and Z. The relationship between A
and B, and X, Y, Z is as follows:
X Y Z
A>B 1 0 0
A<B 0 1 0
A=B 0 0 1
2a. The dean, the department chair, the teaching assistant, and the dorm social chair each use the
auditorium from time to time. Unfortunately, they occasionally conflict, leading to disasters such as the
one that occurred when the dean’s fund-raising meeting with crusty trustees happened at the same time
as the dorm’s black light, twinkles and drinks party. You have been called to design a room reservation
system. The system has four inputs, A 3, …, A0 and four outputs Y3, … Y0. These signals can also be
written as A3:0 and Y3:0. Each user asserts his input when he requests the auditorium for the next day.
The system asserts at most one output, granting the auditorium to the highest priority user. The dean,
who is paying for the system, demands highest priority (3). The department chair, teaching assistant,
and dorm social chair have decreasing priority.
b. Differentiate (with the aid of annotated diagrams) between Mealy and Moore machines.
3a. Write the truth table and the Boolean expression for the logic circuit shown in the figure below:
b. Consider the function F (A, B, C, D) = (0, 1, 2, 3, 5, 7, 8, 10, 12, 13, 15), use Quine-McCluskey method
to write out all its essential prime implicants only.
THE FEDERAL UNIVERSITY OF TECHNOLOGY, AKURE, MATRIC NO: CSC/ /
DEPARTMENT OF COMPUTER SCIENCE
FIRST SEMESTER 2015/2016 SESSION EXAMINATION
COURSE CODE/TITLE: CSC203 / DIGITAL LOGIC DESIGN
INSTRUCTION – ATTEMPT ALL QUESTIONS
TIME ALLOWED – 2¼ HOURS
1. Consider the following logic function. F (A, B, C, D) = ∑(0, 4, 5, 10, 11, 13, 14, 15)
a. Find two different minimum circuits which implement F using AND and OR gates.
Identify two hazards in each circuit.
b. Find an AND-OR circuit for F which has no hazards.
c. Find an OR-AND circuit for F which has no hazards.
3. a. A circuit has four inputs P, Q, R, and S, representing the natural binary number 0000 =
0, to 1111 = 15. P is the most significant bit. The circuit has one output X, which is true if
the input to the circuit represented is a prime number and false otherwise (A prime
number is a number which is only divisible by 1 and by itself. Note that zero (0000)
and one (0001) are not considered as prime numbers).
i. Design a true table for this circuit and hence obtain an expression for X in terms
of P, Q, R, S.
ii. Design a circuit diagram to implement this function using NOR gate only.
b. Draw the logic diagram and the truth table of a full adder using AND, XOR and OR
gates.
c. Convert the hexadecimal number 2ED16 to binary and to decimal
4. Write short notes on the following terms. Describe with the aid of diagram(s) where
and if applicable.
a. (i). Logic gates (ii). Flip-flops (iii). Propagation delays (iv). Race condition
b. With the aid of explicit diagrams and simplified characteristic tables, briefly describe
the S-R latches (with NAND and NOR gates)
c. Differentiate between Combinational and Sequential logic circuits.
THE FEDERAL UNIVERSITY OF TECHNOLOGY, AKURE,
DEPARTMENT OF COMPUTER SCIENCE
FIRST SEMESTER EXAMINATION 2016/2017 SESSION
COURSE CODE/TITLE: CSC203 / DIGITAL LOGIC DESIGN
INSTRUCTIONS – ATTEMPT ALL QUESTIONS
TIME ALLOWED – 2½ HOURS
1a. Write short notes on the following terms. Describe with the aid of diagram(s) where and if applicable.
(i). Logic gates (ii). Flip-flops (iii). Propagation delays (iv). Toggling (v). Race condition
b. (i). With the aid of explicit diagrams and simplified characteristic tables, describe the S-R latches with
NAND and NOR gates.
(ii). Assume a microprocessor register 8 bits wide, convert the signed decimal -4 to a 2’s complement
number.
(iii). What would the pulse train at the output of the XOR gate shown below look like?
0 1 1 0 0 1 1 1
1 1 0 0 0 1 0 0
0 0 1 0 1 1 0 1
h g f e d c b a
2a. The sequential circuit in the figure below consists of two D flip-flops A and B, two inputs x and y; and the
other output y.
3a. A logic circuit has two 2-bit natural binary inputs A and B. A is given by A 1 and A0 where A1 is the
most significant bit. Similarly, for B. The circuit has three (3) outputs X, Y and Z. The relationship
between A and B, and X, Y, Z is as follows:
X Y Z
A>B 1 0 0
A<B 0 1 0
A=B 0 0 1
b. Write the truth table and the Boolean expression for the logic circuit shown in the figure below:
4a. Using the Quine-McCluskey, method find all prime implicants of F(A, B, C, D) = ∑(1, 3, 5, 6, 8, 9, 12, 14,
15) + ∑d(4, 10, 13). Identify all essential prime implicants and find all minimum sum-of-products
expression. [Note: ‘d’ is Don’t care condition].
b. Draw the logic diagram of a full adder using AND, XOR, and OR gates and the corresponding truth table.
5a. A seven-segment display decoder takes a 4-bit data input, D3:0, and produces seven outputs to control
light-emitting diodes to display a digit from 0 to 9. The seven outputs are often called segments a
through g, or Sa-Sg, as defined in the figure below. Write a truth table for the out-puts, and use K-maps
to find Boolean equations for outputs Sa and Sg. Assume that illegal input values (10 - 15) produce a
blank readout.
1. A geothermal electricity generation facility uses a computer to monitor the temperature and pressure of
four liquid storage tanks, as shown in the figure below. Whenever a temperature or a pressure exceeds the
danger limit, an internal tank sensor applies a 1 to its corresponding output to the computer. If all conditions
are OK, then all outputs are 0.
P P P P
T T T T
PD T D PC T C PB T B PA T A
Computer
monitoring system
circuit connections for temperature and pressure monitors at a geothermal electricity generation facility
PD TD PC TC PB TB PA TA
M L P = pressure sensor
S S T = temperature sensor
B B
2. A seven-segment display decoder takes a 4-bit data input, D3:0, and produces seven outputs to control
light-emitting diodes to display a digit from 0 to 9. The seven outputs are often called segments a
through g, or Sa-Sg, as exemplified in the figures below.
7-segment
display
4 D decoder S 7
a
f b
g
e c
d
3. a. Design a circuit with four inputs D,C,B,A that are natural 8421-binary encoded with D the most
significant bit. The output F is true if the month represented by the input (0,0,0,0 = January, 1011 =
December) is a vacation month. I can have a vacation at Christmas, Easter, July, my birthday
(September), or my wife’s birthday (May). (Hint: Easter occurs in either March or April).
b. Differentiate between Latches and Flip-flops
c. Propagation delay and toggling operations
d. State and prove the Redundancy theorem of Boolean Algebra.
e. Draw the truth table for a three-input gray code.
4. The sequential circuit in the figure below consists of two D flip-flops A and B, an input x and
an output y.
0 1 1 0 0 1 1 1
1 1 0 0 0 1 0 0
0 0 1 0 1 1 0 1
h g f e D c b A
e. Consider the function F (A, B, C, D) = (0, 1, 2, 3, 5, 7, 8, 10, 12, 13, 15), use Quine-
McCluskey method to write out all its essential prime implicants only.
THE FEDERAL UNIVERSITY OF TECHNOLOGY, AKURE
SCHOOL OF COMPUTING
DEPARTMENT OF COMPUTER SCIENCE
FIRST SEMESTER 2019/2020 SESSION EXAMINATION
COURSE CODE/TITLE: CSC203 / DIGITAL LOGIC DESIGN
INSTRUCTION – ATTEMPT ANY THREE QUESTIONS AND QUESTION ONE
TIME ALLOWED – 2 HOURS 20 MINUTES
5. A geothermal electricity generation facility uses a computer to monitor the temperature and
pressure of four liquid storage tanks, as shown in the figure below. Whenever a temperature or a
pressure exceeds the danger limit, an internal tank sensor applies a 1 to its corresponding output
to the computer. If all conditions are OK, then all outputs are 0.
P P P P
T T T T
PD T D PC T C PB T B PA T A
Computer
monitoring system
circuit connections for temperature and pressure monitors at a geothermal electricity generation facility
PD TD PC TC PB TB PA TA
M L P = pressure sensor
S S T = temperature sensor
B B
6. A seven-segment display decoder takes a 4-bit data input, D3:0, and produces seven outputs
to control light-emitting diodes to display a digit from 0 to 9. The seven outputs are often
called segments a through g, or Sa-Sg, as
exemplified in the figures below.
7-segment
display
4 D decoder S 7
a
f b
g
e c
d
7. a. Design a circuit with four inputs D, C, B, A that are natural 8421-binary encoded with D the most
significant bit. The output F is true if the month represented by the input (0,0,0,0 = January, 1011 =
December) is a vacation month. I can have a vacation at Christmas, Easter, July, my birthday
(September), or my wife’s birthday (May). (Hint: Easter occurs in either March or April).
b. Differentiate between Latches and Flip-flops
c. Propagation delay and toggling operations
f. State and prove the Consensus Theorem of Boolean Algebra.
8. The sequential circuit in the figure below consists of two D flip-flops A and B, an input x and
an output y.
9. a. Write the truth table and the Boolean expression for the logic circuit shown in the figure
below:
b. Consider the function F (A, B, C, D) = (0, 1, 2, 3, 5, 7, 8, 10, 12, 13, 15), use Quine-
McCluskey method to write out all its essential prime implicants only.
c. Differentiate (with the aid of annotated diagrams) between Mealy and Moore
machines.
d. Convert the hexadecimal number 80916 to its equivalent in 5211 number system