CSE 231 – Midterm

March 19th, 2019 (SP 19)

INSTRUCTIONS:
The exam is closed-book. No calculator or other electronic devices are allowed, apart from a watch. You have 70
minutes to complete the quiz. You should clearly and concisely show all relevant work. There are 5 questions in
this test, and the total number of points is 50 points. Answer everything neatly in your examination book. Write
your name, section number, and student ID neatly on the exam book provided.
Problem I – CO1 5+5 =10 points
Obtain the truth table for the following functions, and express each function in Sum of Minterms and Product
of Maxterms form.

a) (𝒃 + 𝒄𝒅)(𝒄 + 𝒃𝒅)
b) (𝒄′ + 𝒅)(𝒃 + 𝒄′ )
Problem II – CO2 5+5 =10 points

Write down the following functions in their Sum of Minterms canonical form. Then using K-maps, simplify them
to obtain their Product of Sums standard form.
a) 𝑭(𝒙, 𝒚, 𝒛) = ∑(𝟎, 𝟏, 𝟐, 𝟓)
b) 𝑮(𝑨, 𝑩, 𝑪, 𝑫) = ∏(𝟏, 𝟑, 𝟓, 𝟕, 𝟗, 𝟏𝟑, 𝟏𝟓)

Problem III – CO2 5+5 =10 points

For the Boolean function given below:

𝑭(𝑨, 𝑩, 𝑪, 𝑫) = ∏(𝟎, 𝟏, 𝟐, 𝟑, 𝟓, 𝟕, 𝟖, 𝟗, 𝟏𝟎, 𝟏𝟏)

a) Find all the prime implicants of this function, and state which of them are essential.
b) Find the complement F’ of this function, and then design a two-level NOR gate circuit that implements
it.

Problem IV – CO3 5+5 =10 points

Implement the following Boolean functions with a 8x1 multiplexer and external gates.
a) 𝐹(𝑎, 𝑏, 𝑐, 𝑑) = ∑(0,1,5,8,9,10)
b) 𝐺(𝑤, 𝑥, 𝑦, 𝑧) = ∑(1,2,4,7,8,9,10,11,13,15)

Problem IV – CO3 4+3+3 =10 points

You are to design a circuit that counts the total number of 1’s present in 3 inputs A, B, and C. Its output is a two-
bit number X1X0 representing that count in binary.
a) Write the truth table for this circuit
b) Find the minimized logic equations for the outputs X1 and X0 using K-maps if necessary
c) Implement this circuit by only using 2-to-4 Decoders and 2-input logic gates.