Computer Science 150 - Fall 1997 - Fearing - Midterm 1

Computer Science 150 - Fall 1997 - Fearing - Midterm 1 -...

Info iconThis preview shows pages 1–3. Sign up to view the full content.

View Full Document Right Arrow Icon
1 of 5 Problem 1 (25 points) Combinatorial Logic [10 pts.] a) You are given the Boolean function . Complete the truth table for . Hint: Simplify . [8 pts.] b) In this problem you will design a combinational circuit which takes an 8 bit number A[7:0] and cal- culates . For example, if the input , then . The circuit is built from 1 bit modules as shown below. Complete the truth table for the module: [2 pts.] c) Draw a logic diagram for functions and Borrow Out. [5 pts.] d) Show how the 1-bit modules would be interconnected to create an 8-bit subtract 1 circuit. A Borrow In Y Borrow Out 00 01 10 11 fABC ,, () ABC BC AC AB = ABC 000 001 010 011 100 101 110 111 YA 1 = A 00001100 2 = Y 00001011 2 = Y Y n A n BI BO A (1 bit module) Borrow In Borrow Out Y
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 of 5 Problem 2 (25 points) Timing Complete the time diagram for the figure below, assuming unit delays for all gates and inverters (transport delay only), and no delay in the wires. (The dashed lines in the diagram represent missing sections of the timing dia- gram.) Complete the table below with the voltage levels at the specified location in the timing diagram, i.e.,
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 05/17/2009 for the course CS 150 taught by Professor Staff during the Spring '08 term at Berkeley.

Page1 / 5

Computer Science 150 - Fall 1997 - Fearing - Midterm 1 -...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online