Fall2001Test 2b1

Fall2001Test 2b1 - Problem 3(20 Points Give a truth table...

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

View Full Document Right Arrow Icon
ECE 2030 Test 2 Fall 2001 Dr. Heck This is a closed book, closed notes test. No calculators are allowed. You have 50 minutes to complete the test. Please show all of your work. Please abide by the Georgia Tech academic honor code. Violations will be handled in the appropriate manner. Name: _________________________________ Problem Possible Points Score 1 18 2 20 3 20 4 20 5 22 Total 100
Background image of page 1

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

View Full DocumentRight Arrow Icon
Problem 1 (18 Points): a) Add the following 6-bit unsigned numbers and determine if there is an error. 1 0 0 0 1 0 0 1 1 0 1 1 1 1 1 0 0 0 1 1 1 1 1 1 1 1 0 0 1 0 1 1 0 1 Error?: b) Add the following 6-bit signed numbers and determine if there is an error. 0 0 1 1 1 0 0 1 1 0 0 1 1 0 1 1 0 0 0 1 1 1 1 0 1 0 1 0 1 1 0 1 1 0 0 1 Error?:
Background image of page 2
Problem 2 (20 Points) a) A priority encoder has inputs D 0 - D 3 and outputs A 0 , A 1 and V (V=1 if the input is valid). The priority is D 0 >D 1 >D 2 >D 3. Fill in the truth table for the encoder and derive simplified expressions for the outputs. D 3 D 2 D 1 D 0 A 1 A 0 V b) Design a 2 to 1 MUX using only NAND and NOT gates (do not use transmission gates). A 2 to 1 MUX S F B
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
Background image of page 5

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

View Full DocumentRight Arrow Icon
Background image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Problem 3 (20 Points): Give a truth table that shows all the stable operating states for this circuit. S Q Q R Consider the following sequence for S and R. SR = 01, SR = 00, SR = 11, SR = 10, SR = 00 Fill in the corresponding output for Q into the table. SR 01 00 11 10 00 Q Problem 4 (20 Points): Complete the timing diagram for the following circuit. Assume that all initial stored bits are zero. WE IN OUT φ 2 φ 1 IN φ 2 OUT φ 1 L L 2to1 MUX WE Problem 5 (22 Points): A state machine has the following truth table where A is the input. A S 2 S 1 S NS 2 NS 1 NS 0 1 0 0 0 0 1 0 1 0 0 1 1 0 0 1 0 1 0 0 0 0 1 0 1 1 1 1 1 1 1 0 0 1 0 1 1 1 0 1 1 0 0 1 1 1 0 0 0 1 1 1 1 1 0 1 1 0 X X X 0 1 0 a) Draw the state transition diagram. b) Use a decoder to design the combinational logic. c) Show the schematic of the entire state machine including the decoder....
View Full Document

Page1 / 6

Fall2001Test 2b1 - Problem 3(20 Points Give a truth table...

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

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