Massachusetts Institute of Technology

Department of Electrical Engineering and Computer Science

6.111 - Introductory Digital Systems Laboratory

Problem Set 1
Issued: February 7, 2007 Due: February 20, 2007

Boolean Algebra Practice Problems (do not turn in):
Simplify each expression by algebraic manipulation. Try to recognize when it is
appropriate to transform to the dual, simplify, and re-transform (e.g. no. 6). Try doing the
problems before looking at the solutions which are at the end of this problem set.

1) ___________________________ = + 0 a
2) = 0 a ____________________________
3) = + a a ___________________________
4) ___________________________ = + a a
5) __________________________ = + ab a
6) = + b a a __________________________
7) = + ) ( b a a _________________________
8) = + b a ab _________________________
9) = + + ) )( ( b a b a ____________________
10) __________________ = + + + ...) ( c b a a
For (11),(12), (13), c b a c b a f + + = ) , , (
11) ______________________ = ) , , ( ab b a f
12) = ) , , ( b a b a f _____________________
13) = ] ) ( , , [ ab b a f _____________________
14) = + y y y _________________________
15) = + y x xy ________________________
16) = + x y x _________________________
17) = + + + y z y x w ) ( _________________
18) = + + ) )( ( y x y x ___________________
19) = + + )] ( [ wx w w ___________________
20) = + )] ( [ xy x x ______________________
21) = + ) ( x x _________________________
22) = + ) ( x x _________________________
23) = + ) ( yz x w w _____________________
24) = ) (wxyz w ______________________
25) = + + zy y x xz ____________________
26) = + + + ) )( )( ( y z y x z x ______________
27) = + + z xy y x _____________________


Problem 1: Karnaugh Maps and Minimal Expressions
For each of the following Boolean expressions, give:
i) The truth table,
ii) The Karnaugh map,
iii) The minimal sum of products expression. (Show groupings)
iv) The minimal product of sums expression. (Show groupings)

1) ) ( ) ( d c a b c d b a + +
2) ) )( ( x y z x w + +
6.111 Spring 2007 Problem Set 1 2
Problem 2: Karnaugh Maps with Dont Cares

Karnaugh Maps are useful for finding minimal implementations of Boolean expressions
with only a few variables. However, they can be a little tricky when don't cares (X) are
involved. Using the following K-Maps:



i) Find the minimal sum of products expression. Show your groupings.
ii) Find the minimal product of sums expression. Show your groupings.
iii) Are your solutions unique? If not, list and show the other minimal expressions.
iv) Does the MPS =MSP?


Problem 3: DeMorgans Theorem
Use DeMorgan's Theorems to simplify the following expressions:

1) ) ( ) ( c b d a + +
2) ) ( ) ( d c c b a +
3) d c c b d a + + +


Problem 4: Transistor/Gate Level Synthesis
1) Construct a transistor level circuit with inputs A, B, and C, and output F of the
following function using NMOS and PMOS devices: C B A F + =
2) Construct a gate level circuit of the same function with inputs A, B, and C, and
output F only using NAND gates.

6.111 Spring 2007 Problem Set 1 3
Problem 5: Setup and Hold Times for D Flip-Flop (Flip-flops will be covered in
lecture 4)
1) Let a D latch be implemented using a mux and realized as follows:



You may assume the following:
a) and G G are complements and have zero skew, i.e. when Gis 1, G is
exactly 0, and vice versa.
b) Assume the switches are ideal, with no delay. E.g. when G is 0, the
switch is open.
c) The propagation delay of the inverters is t
inv
(assume that the
contamination delay or minimum delay is equal to the propagation delay).

What is the setup and hold time of this latch?

2) What memory element is created when two muxes are cascaded as in the
figure below? Assume that CLK and CLK are complements with zero skew.




3) What is the setup time, hold time, and clock to Q delay of the above memory
element?


6.111 Spring 2007 Problem Set 1 4
Solutions to the Boolean Algebra Practice Problems

1) a a = + 0
2) 0 0= a
3) 1 = + a a
4) a a a = +
5) a b a ab a = + = + ) 1 (
6) b a b a a a b a a + = + + = + ) )( (
7) ab ab a a b a a = + = + ) (
8) b a a b b a ab = + = + ) (
9) a b b a b a b a a b b a b b a a a b a b a = + + = + + = + + + = + + ) 1 ( ) )( (
10) a ac ab a ac ab aa c b a a = + + + = + + + = + + + ... ... ...) (
11) b a ab b a ab b a f + = + + = ) , , (
12) 1 ) , , ( = + + = + + = a b a b a b a b a b a f
13) 1 ) ( ] ) ( , , [ = + + + = + + = b a b a ab b a ab b a f
14) y y y y = +
15) x y y x y x xy = + = + ) (
16) x y x x y x = + = + ) 1 (
17) y y z y x w = + + + ) (
18) x y x y x = + + ) )( (
19) w wx w w = + + )] ( [
20) x xy x x = + )] ( [
21) x x x = + ) (
22) 0 ) ( = + x x
23) w yz x w yz x w w = + = + ) 1 ( ) (
24) w z y x w w wxyz w = + + + = ) ( ) (
25) y x xz zy y x xz + = + +
26) z x xy y x z x y z y x z x + = + + = + + + ) )( ( ) )( )( (
27) z y x z xy y x + + = + +