CS223 – DIGITAL DESIGN

STUDY QUESTIONS # 1

Q1. Find the simplest sum-of-products representation of the following Boolean equation, show
your work step-by-step.
� + 𝑪𝑪 + 𝑫𝑫
𝑭𝑭(𝑨𝑨, 𝑩𝑩, 𝑪𝑪, 𝑫𝑫) = (𝑨𝑨 + 𝑩𝑩 � + 𝑫𝑫
� ). (𝑨𝑨 + 𝑩𝑩 + 𝑪𝑪 � ). (𝑨𝑨
� + 𝑩𝑩 � + 𝑫𝑫). (𝑨𝑨
� + 𝑪𝑪 � + 𝑩𝑩 + 𝑪𝑪 + 𝑫𝑫
� ). (𝑨𝑨
� + 𝑩𝑩 � + 𝑫𝑫
� + 𝑪𝑪 �)
Q2. Find the simplest product-of-sums representation of the following Boolean equation, show
your work step-by-step.
� . 𝑩𝑩. 𝑫𝑫) + (𝑨𝑨. 𝑩𝑩. 𝑫𝑫
𝑭𝑭(𝑨𝑨, 𝑩𝑩, 𝑪𝑪, 𝑫𝑫) = (𝑨𝑨 � ) + (𝑩𝑩 �. 𝑫𝑫)
� . 𝑪𝑪
Q3. Given the Boolean function 𝑭𝑭(𝑨𝑨, 𝑩𝑩, 𝑪𝑪, 𝑫𝑫) = ∑(𝟎𝟎, 𝟓𝟓, 𝟖𝟖, 𝟏𝟏𝟏𝟏, 𝟏𝟏𝟏𝟏, 𝟏𝟏𝟏𝟏, 𝟏𝟏𝟏𝟏, 𝟏𝟏𝟏𝟏)
(a) Find a minimal Boolean equation for the function by using Karnaugh map method only
(don’t use Boolean algebra).
(b) Draw a circuit diagram implementing the function 𝐅𝐅 using only NAND gates (the
complements of input variables are not available).
(c) Implement the function 𝐅𝐅 by using a 8:1 multiplexer only. Do not use any other logic gate.

Q4. Simplify the following equations using the theorems of Boolean algebra.

(a) 𝒀𝒀 = �𝑨𝑨 + 𝑩𝑩� (𝑩𝑩 ∙ 𝑪𝑪)

(b) 𝒀𝒀 = 𝑨𝑨𝑨𝑨𝑪𝑪𝑫𝑫 + 𝑨𝑨𝑨𝑨 + 𝑨𝑨𝑩𝑩 + 𝑨𝑨𝑨𝑨𝑨𝑨 + 𝑩𝑩𝑪𝑪

Q5. Write the following Boolean equations in product-of-sums (POS) canonical form.

(a) 𝒀𝒀(𝑨𝑨, 𝑩𝑩, 𝑪𝑪, 𝑫𝑫) = 𝑨𝑨 𝑩𝑩 + 𝑩𝑩𝑩𝑩 + 𝑩𝑩 𝑪𝑪 𝑫𝑫

(b) 𝒀𝒀(𝑨𝑨, 𝑩𝑩, 𝑪𝑪) = 𝑨𝑨𝑩𝑩 𝑪𝑪 + 𝑨𝑨 𝑩𝑩 𝑪𝑪 + 𝑨𝑨 𝑩𝑩 𝑪𝑪 + 𝑨𝑨 𝑩𝑩 𝑪𝑪

Q6. Simplify the following equation using the Karnaugh map method.

𝒀𝒀(𝑨𝑨, 𝑩𝑩, 𝑪𝑪, 𝑫𝑫) = 𝑨𝑨 𝑩𝑩 + 𝑩𝑩 𝑪𝑪 + 𝑨𝑨 𝑩𝑩 𝑪𝑪 𝑫𝑫 + 𝑨𝑨 𝑩𝑩 𝑪𝑪

Q7. You are given the following circuit and the Boolean function 𝑭𝑭 defined by the truth table.

A B C F
0 0 0 1 D
0 0 1 1 C Y
0 1 0 1
0 1 1 0 A
1 0 0 1
A
1 0 1 0 F
B B
1 1 0 1
C C
1 1 1 1

Find a minimal Boolean equation for the output of the circuit 𝒀𝒀(𝑨𝑨, 𝑩𝑩, 𝑪𝑪, 𝑫𝑫).

CS223-Digital Design 1 2022 Spring – Alper SARIKAN

Q8. Design a Finite State Machine (FSM) which has a one-bit input 𝑼𝑼 and three-bit output 𝑪𝑪. If
𝑼𝑼 = 𝟏𝟏, the circuit will count up two-by-two and if 𝑼𝑼 = 𝟎𝟎, the circuit will count down one-by-
one. The circuit will count up as follows: 0, 2, 4, 6, 0, 2, 4, 6, ... or 1, 3, 5, 7, 1, 3, 5, 7, ... and it
will count down as follows: 0, 7, 6, 5, 4, 3, 2, 1, 0, 7, 6, 5, 4, ... On reset, its output will be 𝟎𝟎𝟎𝟎𝟎𝟎.
(a) Sketch the state transition diagram.
(b) Write the state transition and output tables with binary encodings.
(c) Write the Boolean equations for the next-state and output logic.
(d) Sketch the circuit schematic for the FSM.

Q9. Design a Finite State Machine (FSM) with one input and one output. The circuit should read
one-bit data at every rising edge of the clock. According to the data input, the circuit will
produce the following output. On reset, its output will be 𝟏𝟏𝟏𝟏𝟏𝟏.
If the input bit sequence is 𝟏𝟏𝟏𝟏 then the output will be 𝟎𝟎𝟎𝟎𝟎𝟎.
If the input bit sequence is 𝟎𝟎𝟎𝟎 then the output will be 𝟎𝟎𝟎𝟎𝟎𝟎.
If the input bit sequence is 𝟏𝟏𝟏𝟏𝟏𝟏 then the output will be 𝟎𝟎𝟎𝟎𝟎𝟎.
If the input bit sequence is 𝟎𝟎𝟎𝟎𝟎𝟎 then the output will be 𝟎𝟎𝟎𝟎𝟎𝟎.
Otherwise, the output will be 𝟏𝟏𝟏𝟏𝟏𝟏.
(a) Sketch the state transition diagram.
(b) Write the state transition and output tables with binary encodings.
(c) Write the Boolean equations for the next-state and output logic.
(d) Sketch the circuit schematic for the FSM.

Q10. Design the following circuit that checks whether the input (𝒂𝒂𝟑𝟑 𝒂𝒂𝟐𝟐 𝒂𝒂𝟏𝟏 𝒂𝒂𝟎𝟎 ) is a prime number
or not (a prime number is a natural number which is greater than one and cannot be written as
the product of two smaller numbers). If the input is a prime number then the output (𝑭𝑭) will be
1.

a3
Prime
a2 F
Number
a1
Detector
a0

(a) Implement the prime number detector circuit by using NAND gates only.
(b) Implement the prime number detector circuit by using NOR gates only.

CS223-Digital Design 2 2022 Spring – Alper SARIKAN