CS 2513 Lab 2

CS 2511 Computer Organization I Recitation Spring '05

Lab 2

Assigned : 01/31 (CS2511.001)
02/02 (CS2511.002)

Due : 02/07 (CS2511.001)
02/09 (CS2511.002)

Objectives

Learn Boolean expression simplification.
Learn the correspondence between Boolean expression and digital circuits.

Resources

Units 2 and 3 from the textbook.
Contact the TA if you have any questions.

Problem Description

Solve the problems in the textbook: 2.18 a and b, 3.14a and b, and 3.18a and b. For each problem, you are required to submit:

original circuit expression and simplified expression (handwriting with simplification steps)
the corresponding gate-level circuit (draw the circuit in LogicWorks5 and print it), including both original circuit and simplified circuit.
Truth tables (handwriting) to verify the equality of your simplification. You can use switches for inputs and probes to observe the values for both original circuit and the simplified circuit.

Hand-in Requirements (Deliverables)

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