Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
The instructions and problems for exam two of the computer engineering class ece 2030 held in spring 2001. The exam covers topics such as binary and octal to decimal conversion, arithmetic operations using two's complement and unsigned representations, designing transparent latches, registers, toggle cells, and counters. Students are not allowed to use calculators or notes during the exam.
Typology: Exams
1 / 5
This page cannot be seen from the preview
Don't miss anything!
4 problems, 5 pages Exam Two 21 March 2001
Instructions: This is a closed book, closed note exam. Calculators are not permitted. If you have a question, raise your hand and I will come to you. Please work the exam in pencil and do not separate the pages of the exam. For maximum credit, show your work. Good Luck!
Your Name ( please print ) ________________________________________________
1 2 3 4 total
4 problems, 5 pages Exam Two 21 March 2001
Problem 1 (3 parts, 30 points) Numbers and Arithmetic
Part A (9 points) Convert some binary values (and powers of two) into decimal notation:
binary notation decimal notation
100100110
236
Part B (9 points) Convert the following octal values into hexadecimal notation:
octal notation hexadecimal notation
654
77111
Part C (12 points) For each problem below, (a) compute the operations using the rules of addition, (b) indicate whether an error occurs assuming all numbers are expressed using a four bit two’s complement representation, and (c) indicate whether an error occurs assuming all numbers are expressed using a four bit unsigned representation.
addition result signed error? unsigned error?
4 problems, 5 pages Exam Two 21 March 2001
Problem 3 (3 parts, 30 points) Counters
Part A (10 points) Design a toggle cell using transparent latches, 2-input XOR gates, and 2-input basic gates (AND, OR, NAND, NOR, and NOT). Include a toggle enable TE, active low clear CLR, and a two-phase non-overlapping clock PHI1 and PHI2. Label the output OUT.
Part B (10 points) Now use copies your toggle cells (in icon form) to build a divide by eight counter. This design should include an active high external count enable CE and an active high external clear CLR. You do not need to draw in the clock signals. Assume all toggle cells are connected to the two-phase clock. Label all of your outputs signals.
4 problems, 5 pages Exam Two 21 March 2001
Part C (10 points) Now use copies of your toggle cell (in icon form) to build a divide by three counter. This design should include an active high external count enable CE and an active high external clear CLR. Your design should clear if (A) the external clear CLR is high, or (B) the maximum output count is reached and the count enable is high. You do not need to draw in the clock signals.
Problem 4 (4 parts, 12 points) Multiple Choice
Consider four different 32-bit representations: (A) an unsigned integer representation, (B) a twos complement integer representation, (C) a twos complement fixed point representation with sixteen bits on each side of the fixed point, and (D) a floating-point representation with a 23 bit mantissa and an 8 bit exponent. For each quantity below, circle which representation (A, B, C, or D) most accurately represents the quantity (i.e., which representation can represent the value with the smallest error).
