0% found this document useful (0 votes)
62 views1 page

Assignment 2

This document provides instructions for Assignment 2, which asks students to analyze a circuit diagram to determine if it implements a full adder. Students are to prepare a truth table showing the status of each transistor and outputs for all input combinations. The assignment is due on March 7th, 2005 at the beginning of lecture and solutions must be neat and easy to read.

Uploaded by

api-3864016
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
62 views1 page

Assignment 2

This document provides instructions for Assignment 2, which asks students to analyze a circuit diagram to determine if it implements a full adder. Students are to prepare a truth table showing the status of each transistor and outputs for all input combinations. The assignment is due on March 7th, 2005 at the beginning of lecture and solutions must be neat and easy to read.

Uploaded by

api-3864016
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Assignment 2

Fall 2004 / 2005

1. The circuit below is supposed to implement a full adder. Prepare a truth table that shows the
status of each transistor and the values for the outputs for each combination of input values.

SUM

CARRY

According to your truth table, is it really a full adder?

Make sure your solution is neatly prepared and easy to follow and read.

Due date: Monday March 7th, 2005 at the beginning of the lecture.

VLSI Design Dr. Bassel Soudan 1

You might also like