CS 2513 Lab 3

CS 2511 Computer Organization I Recitation Spring '05

Lab 4

Assigned : 02/21 (CS2511.001)
02/23 (CS2511.002)

Due : 02/28 (CS2511.001)
03/02(CS2511.002)

Objectives

Learn minterm, maxterm expansion, and simplification of Boolean expressions using Karnaugh maps.
Learn to use Karnaugh maps to find minimum sum expressions and AND-OR gate circuits.

Resources

Units 4 and 5 from the textbook.
Contact the TA if you have any questions.

Problem Description

A switching circuit has two control inputs (C1 and C2), two data inputs (X1 and X2), and one output (Z).
The circuit performs logic operations on the two data inputs, as shown in this table:

C1	C2	Function Performed by Circuit
0	0	X1X2
0	1	X1 Å X2
1	0	X1' + X2
1	1	X1 º X2

Do the following.

Give the truth table (3 pts)
Give the canonical sum expression and the corresponding shorthand notation (Minterm). (2 pts)
Give a minimum sum expression obtained using k-maps and the corresponding gate-level circuit (drawn in LogicWorks5). (5 pts)
Give the canonical product expression and the corresponding shorthand notation (Maxterm). (2 pts)
Give a minimum product expression using k-maps. (2 pts)
If the control input 11 cannot occur, give the new truth table using don't cares as much as possible. (1 pt)
For the new design, give a minimum sum expression and the corresponding gate-level circuit (drawn in LogicWorks5). (5 pts)

Hand-in Requirements (Deliverables)

Staple all your hand-ins as required in problem description to form a single packet. Write your name, course and recitation section number (CS2511.001 or CS2511.002) on the front.