For grader use ONLY

A B C D deduct total
20 27 5 71 123

Midterm
Fall 2022 · National Yang Ming Chiao Tung University – November 8, 2022

Name ________________________________

Your student ID number ____________________

Note: Write your name and student ID. There are 123 points in 120 minutes. Pace yourself, and good luck!

A. True/False. [2 point each = 20 points total] 3

Indicate whether the sentence or statement is true or false. You will get 2 points for the correct answer, and
will be deducted 1 point with a wrong answer. So, I suggest you not to do a random guess.

√ F 160 is the hexadecimal number immediately after the hexadecimal number 159.
1) ____
√ 2) ____ The following Boolean equation is true: ABC+(A’+B’+C)(D+E)=ABC+(A’+B’)(D+E).

√
系 *< * ε E
3) ____ The step of designing NAND-NAND circuit is firstly, Draw a two-levelO OR-AND circuit
implement the function, and use the NAND to replace all the gates.
≈ 4) ____ If XY=XZ, then we can conclude Y=Z. frxse,Ysc 0 ,
s
1

q
5) ____ An expression formed by ORing the minterms of a function is the sum-of-products (SOP) form.
6) ____ For a multiple-variable Boolean function, a minterm is a term where one or more true or
complement variables are ANDed.
r 7) ____ To obtain a minimum multiple-output circuit, we should utilize the common terms among
individual output functions ←
whenever a common term exists.
8
√ 8) ____ DeMorgan's theorem gives the following equality:(Q’ & TP = Q + T’, where Q and T are Boolean
expressions.

: {
9) ____ The output of a two-input EXCLUSIVE OR gate is 1 only when the two inputs are different.
10) ____ Both static and dynamic hazards will not occur if every logic gate has zero delay.
Page 2

B. Multiple Choice. [3 pts. each = pts. 27 total] 9

For each of the following choose the single best answer. You will get zero point if you put down more than
one answer.
b 5 2 8 24 1

A
①
1. ______ Which of the following decimal values represents the BCD code (011001010010.00010110) BCD?
A. (652.16)10 B. (1618.13)10 C. (652.13)10 D. (1618.06)10 6

d:iii
8 qx
θ

∅ B
2. ______ The 4-bits binary code 1000 can represent ___. ?
A . [-0] in 2’s complement e B. [-0] in sign and magnitude
C. [-0] in 1’s complement D. none of the above
\ 7

B
3. ______ Consider a function F(A,B,C,D)=m(0,1,2,3,5,7,8,10,11,12,14). How many prime implicants

[
exist in F?
意R A. 4 B. 5 C. 6 D. 7
c
4. ______ Consider the same function F(A,B,C,D)=m(0,1,2,3,5,7,8,10,11,12,14). How many essential
prime implicants exist in F?
A. 1 B. 2 C. 3 D. 4

℃
5. ______ Which of the following addition results is overflowed if each signed number is represented in 4
bits?.
A. Add (-3) and (-4) in 2’s complement 7

芹
B. Add (-6) and (-5) and (7) in 2’s complement
e
C. Add (-7) and (-3) and (1) in 2’s complement
D. Add (5) and (3) and (-4) in 2’s complement
4
D
6. ______ Which equation can represent the logic relation among the three Boolean variables (A, B, and F)
shown in the following waveform?

0
l
1 o ”
e

66B

A、F=A·B B、F=A+B C、F= A  B D、F= A  B ←

駁
℃
7. ______ Given the Boolean function f(A,B,C)= m(1, 4) + d(______)， how many don’t care terms in
d(______) can make f(A,B,C)= A  C ?
A 4 B 3 C 2 D 1 ACix 8'c

8. ______ Assuming that F1= m(3, 5, 7), F2= m(1,3, 5, 6), F3= m(1,3, 5, 6,7), which of the following
descriptions is correct? s s
口
。。
。山
。
Page 3

A. F1=F2F3 B. F1’=F2F3 C. F1and F3 are dual D. F3= F1+F2

e
9. ______ Which of the following minterm or maxterm can make the function F(A,B,C,D)=
& Mi (A⊙C⊙D)(A  B  D) equal to 0, where  and ⊙ represents an XOR and XNOR operation.
A. M0 ,m14 B. M0, m15 C. m14 m15 D. m14, M2
Mzn .
| ,
i

C. Boolean Algebra. [5 total]

1. Prove the following equation using algebraic derivation (do not use K-map). [5 pts.]
√
A’CD’E+A’B’D’+ABCE+ABD=A’B’D’+ABD+BCD’E

D. Problem set. [71pts. total]

D 1. [10 pts.] Convert the 4 bits Binary code to 8 bits BCD code. We let BCD code 5~7 bit to be 0, you should
design 0~4 bit (5 bits BCD code output) to do this design. (Use logic gate to design)
hint:

√ 2. [11 pts.] For F1(a,b,c,d)=m(2,3,5,6,7,8,10) and F2(a,b,c,d)= m(0,1,2,3,5,7,8,10)

(a)Find a minimum two-level, multiple-output AND-OR gate circuit to realize F1 and F2 [8 pts.]
(b) Find a minimum two-level, multiple-output NAND-NAND gate circuit to realize F1 and F2 [3 pts.]

X
3. [12 pts.] Following are the midterm expression of a multiple-output circuit. Realize the multiple-output circuit
with the minimum gate count using only 2-input NAND gates and inverts. 我 能 sx (化BC s 成 (Bc ) +λ[
B
① ≈ ①
θ
F1(a,b,c)=m(0,1,2,7) BE
; 化與
F2(a,b,c)=m(0,1,2,4) 1
, '

C 'E{ ☆* ) 入 λ[ 微 c
①
e
F3(a,b,c)=m(2,4,6,7) Ber t AES 入 ABC
;

品 θ

. ①
,

√ 4. [14 pts.] Use multiplexers to realize the following functions and draw the corresponding circuits.
(a). Design an 8-to-1 multiplexer using only 4-to-1 multiplexers. [7 pts.]
(b). Use only one 4-to-1 multiplexer to realize the function f(a,b,c,d)= m(1,5,6,8,9,12)+ d(13,14) [7 pts.]
。
身
Page 4

√ 5. [24 pts.] Given the following circuit,

A Q
C
t R
B u Y
D

S
D
C v

(a). What is the Boolean function of the circuit output Y? [3 pts.]

(b). List all minterms of the Boolean function Y (A, B, C, D). Please use mi to represent a minterm. [3pts.]

(c). Given the signals of A, B, C, D in the following timing chart, draw the signals of Q, R, S, Y in the timing
chart. The delays for NOT gate, AND gate, and OR gate are 2ns, 3ns, and 3ns, respectively. (you may need
to draw the signals of t, u,v first to find out the answer) [6 pts.]

A
ns
0 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16
Page 5

(d) Assuming that only one input signal can change each time, the given circuit may generate a static-1 hazard
at the output Y when some specific pairs of input values are supplied. For example, if we supply(0, 1, 0,
1)followed by (0, 0, 0, 1), then a static-1 hazard will occur at the output Y. Here, we use (VA, VB, VC, VD)
to represent the input values of signals A, B, C, and D. Write down all possible pairs of input values which
can cause a static-1 hazard at output Y (order of the two input values does matters!). (0, 1, 0, 1) →(0, 0, 0,
1) is one of the answers for sure. [6 pts.]

(e) Add some gates to the original circuit to eliminate all above static-1 hazards. You don’t need to draw the
new circuit. Just write down the corresponding Boolean expression of Y. [6 pts.]