CS 2513 Lab 2

CS 2511 Computer Organization I Recitation Spring '05

Lab 3

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

Due : 02/14 (CS2511.001)
02/16 (CS2511.002)

Objectives

Learn XOR gate, half-adder and full-adder circuits.
Learn how to design binary adders and subtracters.

Resources

Units 1.4 and 4.7 from the textbook.
Contact the TA if you have any questions.

Problem Description

Modify the 4-bit adder in Figure 4.3 in textbook to add or subtract two 4-bit 2's-complement numbers. A separate control will indicate add or subtract operation to be performed. Also, design an overflow dection circuit whose output should be 1 if there is an overflow. Design this circuit in Logicworks5 using Adder-4, 74_86 (IC: SN74LS86), and other gates if necessary. You only need to submit the printout of the circuit (You should label inputs and outputs). (The sample circuit picture can be downloaded here)

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.