Computer Science 150 - Fall 1991 - Katz - Midterm 1

Computer Science 150 - Fall 1991 - Katz - Midterm 1 - CS...

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

View Full Document Right Arrow Icon
CS 150 - Midterm 1 (Fall 1991) UNIVERSITY OF CALIFORNIA College of Engineering Department of Electrical Engineering and Computer Sciences Computer Science Division Computer Science 150 Fall 1991 - First Midterm Examination Professor R. H. Katz In taking this examination, you agree that all work recorded herein is your own. A student caught in the act of cheating will be given a grade of F on this examination and a letter will be written to his or her file. All work is to be done on the attached sheets and under no circumstances are blue books or loose sheets to be used. Write your name at the top of every sheet. Read the questions carefully. If something appears ambiguous, write down your assumptions. The points have been assigned according to the formula that 1 point = 1 exam minute, so pace yourself accordingly. Page 1 Question 1: Tri-State and Open Collector Gates [10 points] The 2:1 multiplexor function that has two data inputs A and B, a select control input S, and a single positive-logic output Z that operates according to the following truth table: (i) Draw a schematic that implements this function using only the following gates as building blocks [5 points]: file:///C|/Documents%20and%20Settings/Jason%20Raft. ..20-%20Fall%201991%20-%20Katz%20-%20Midterm%201.htm (1 of 7)1/27/2007 5:37:09 PM
Background image of page 1

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

View Full DocumentRight Arrow Icon
CS 150 - Midterm 1 (Fall 1991) (ii) Implement the same function using only the following building blocks [5 points]: Page 2 Question 2: Word Problems [15 points] A logic network has four inputs; Input0, Input1, Input2, Input3, and two outputs Output0, Output1: At least one of the inputs is always asserted high. If a give input line has a logic one applied to it, then the ouput signals will encode its indes in binary. For example, if input Input2 is asserted, then the output
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.

Page1 / 7

Computer Science 150 - Fall 1991 - Katz - Midterm 1 - CS...

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