



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 a midterm exam in the ece 190 course during spring 2011. The exam covers various topics such as binary representation, digital logic, memory, and c language. Students are required to solve problems related to adding binary numbers, converting numbers to different representations, understanding logic gates, building memory units, and writing c expressions.
Typology: Exams
1 / 5
This page cannot be seen from the preview
Don't miss anything!




Spring 2011 Tuesday, February 1 5 , 2011 Name: NetID: (TA USE ONLY): Computer Station: ______________________
Problem 1 (10 points): Binary representation Part A (2 points): What is the 8-bit result of adding the following pairs of 8-bit numbers together? a ) 11100111 + 01110001 = _________________________ Assuming 8-bit 2’s complement representation, is there overflow? (circle one) yes no Assuming an unsigned representation, is there overflow? (circle one) yes no b ) 01110111 + 00010110 = _________________________ Assuming 8-bit 2’s complement representation, is there overflow? (circle one) yes no Assuming an unsigned representation, is there overflow? (circle one) yes no Part B (2 points): Base 3 representation of numbers is called “ternary”, and uses only digits 0 through 2. Give the following equivalent numbers for ternary 2011 in each binary, decimal, and hexadecimal representation: Binary: _____________________ Decimal: _____________________ Hexadecimal: _____________________ Part C (1 point): How is the number 16.750 represented in the floating point data type? Answer: _________________________________________________ Part D ( 2 points): In homework #1 you calculated the accuracy of the floating point representation of e. How accurate is floating point notation when the smallest possible number is represented using this notation? Answer: 2 N , where N =___________________________________ Part E ( 3 points): Using binary integer arithmetic, what 32-bit pattern can be subtracted from this floating point representation to effectively divide it by 2? 0 01111111 01010101010101010101010 Answer: _________________________________________________
Problem 3 ( 10 points): Memory A multi-level cell (MLC) is a memory cell that has more than 2 states, allowing it to store more bits of information in the same space. In this problem, you will be working with 4-state MLCs that each store 2 bits of information. Given four 4 - state MLCs, build a 4x2-bit memory unit using only a decoder and MUXes: If you need to merge two 1-bit wires into a single 2-bit wire, or to split one 2 - bit wire into two 1-bit wires, you can use the following notation where [0] and [1] indicate # of the 1-bit wire: merge split
Problem 4 - (5 points): C language Part A (1 points): Assume variables x , y , and z are already declared. Write a C expression to evaluate ! !
Do not switch the order of operands. Answer: ___________________________________________________ Part B (2 points): Fill in missing expressions to implement the following formula: ! =
if ( _________________________________________ ) f = x; else if ( ____________________________________ ) f = - x; else f = 0 ; Part C (1 points): Write the output produced by the following code segment: int x = 5; do { printf(“%d“, x++); } while (x < 10 ) Answer: ____________________________________________ Part D (1 points): Using only declared variables, write missing arguments in printf function call that correspond to the provided format conversion specifications. int day; float temp; char grade; printf(“%d %c %f\n”, ________________________________________ );