CSCI345 Exam II - Sample

Part I: MCQ
Question 1 [10 points]: Select the appropriate answer for each question.

1. The complement of 𝑋. (𝑋̅𝑌̅ + 𝑋𝑌) is

a. 𝑋̅ + (𝑋 + 𝑌). (𝑋̅ + 𝑌̅)

b. 𝑋̅ + (𝑋 + 𝑌̅). (𝑋̅ + 𝑌̅)
c. 𝑋̅ + ̅̅̅̅̅̅̅̅̅̅
(𝑋 + 𝑌). (𝑋̅ + 𝑌̅)
d. 𝑋̅ + (𝑋). (𝑋̅ + 𝑌̅)

2. What is the simplest form to represent the function F(a, b, c ) = ∑ 𝑚 ( 1, 2, 4, 7)

a. F= a’ + c’ + c b
b. F= a’ ⨁ b’
c. F= a’ b’ c + a’ b c’ + a b’ c’ + a b c
d. F= a ⨁ b ⨁ c

Page 1 of 8
CSCI345 Exam II - Sample

3. What type of logic circuit is represented by the figure shown below?

a) XOR
b) XNOR
c) AND
d) XAND

4. The following function 𝑓 = 𝐴  (𝐴  𝐵) can be minimized as:

a. A
b. B
c. A’
d. AB’

Page 2 of 8
CSCI345 Exam II - Sample

Part II: Implementation of Digital Circuits with NAND, NOR, XOR and XNOR
Question 1 [25 points]: Consider the following truth table where A, B, C and D are considered as
inputs and F is the output:
A B C D F
0 0 0 0 0
0 0 0 1 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 1
0 1 1 1 1
1 0 0 0 0
1 0 0 1 0
1 0 1 0 1
1 0 1 1 1
1 1 0 0 0
1 1 0 1 0
1 1 1 0 1
1 1 1 1 1

a- Express the function F in terms of S.O.P.

F = A’BCD’ + A’BCD + AB’CD’ + AB’CD + ABCD’ + ABCD

b- Verify that F can be minimized to F = BC + AC

- It could be verified by comparing the truth table of F = BC + AC to the above table
- Or by using identities
- Or by using K-map.

Page 3 of 8
CSCI345 Exam II - Sample

c- Realize the simplified function using NAND gates only.

𝐵𝐶 + 𝐴𝐶 = ̅̅̅̅̅̅̅̅
𝐹 = ̿̿̿̿̿̿̿̿̿̿̿ ̅̅̅̅ ̅̅̅̅
𝐵𝐶 𝐴𝐶

Or by realizing the function using logic gates (AND, NOT and OR),
Then replacing the OR gate by an inverted inputs NAND gate, then pushing the bubbles
from the NAND inputs to the AND’s output.

Page 4 of 8
CSCI345 Exam II - Sample

Question 2 [20 points]: Having the following function:

𝐹(𝐴, 𝐵, 𝐶, 𝐷) = ∑ 𝑚(1,2,3,6,7,8,9,12,13,15)
1) Minimize F using k-map

F = A’C + AC’ + A’B’D + ABD

2) Draw the minimized logic circuit of F with digital logic gates.

Page 5 of 8
CSCI345 Exam II - Sample

Part III: Combinational Logic Design

Question 1 [25 points]: Given a Boolean function ‘F’ of 4 Boolean variables A, B, C & D.
The output of ‘F’ is 1 when the number of 1’s in the input is greater than the number of 0’s,
otherwise, F outputs 0.
Example: F = 1 when ABCD = 1011 because there are 3 ones and only 1 zero, and 3 > 1.

a- Write the corresponding truth table

A B C D F d
0 0 0 0 0 d0=0
0 0 0 1 0
0 0 1 0 0 d1=0
0 0 1 1 0
0 1 0 0 0 d2 = 0
0 1 0 1 0
0 1 1 0 0 d3=D
0 1 1 1 1
1 0 0 0 0 d4 = 0
1 0 0 1 0
1 0 1 0 0 d5=D
1 0 1 1 1
1 1 0 0 0 d6=D
1 1 0 1 1
1 1 1 0 1 d7=1
1 1 1 1 1

b- Write the Sum-of-Products expression for the output

F = A’BCD + AB’CD + ABC’D + ABCD’ + ABCD

Page 6 of 8
CSCI345 Exam II - Sample

c- Implement the circuit using a 8 to 1 Multiplexer.

Page 7 of 8
CSCI345 Exam II - Sample

Question 2 [20 points]: Consider the following truth table where X, Y and Z are considered as
inputs and A, B and C are the outputs:

a- Write the Sum-of-Products expression for the outputs.

Simplified expressions for outputs are provided as:

A = YZ + XZ + XY
B = X’Y’Z + X’YZ’ + XY’Z’ + XYZ = X xor Y xor Z
C = Z’

b- Implement the circuit using a 3 to 8 decoder.

Page 8 of 8