## Department of Electrical and Computer Engineering

### The University of Texas at Austin

EE 306, Fall 2015
Problem Set 1
Due: 9 September, before class
Yale N. Patt, Instructor
TAs: Esha Choukse, Ali Fakhrzadehgan, Steven Flolid, Nico Garofano, Sabee Grewal, William Hoenig,
Adeesh Jain, Kamyar Mirzazad, Matthew Normyle, Stephen Pruett, Siavash Zangeneh, Zheng Zhao

Instructions:
You are encouraged to work on the problem set in groups and turn in one problem set for the entire group. Remember to put all your names on the solution sheet. Also, remember to put the name of the TA and the time for the discussion section you would like the problem set turned back to you. Show your work.

1. Please turn in the Student Information Sheet with a recognizable photograph on the same day you turn in this problem set.

2. (Adapted from problem 1.5 in the textbook)
Say we had a "black box," which takes two numbers as input and outputs their sum. See Figure 1.7a in the Textbook. Say we had another box capable of multiplying two numbers together. See figure 1.7b. We can connect these boxes together to calculate p * (m + n). See Figure 1.7c. Assume we have an unlimited number of these boxes. Show how to connect them together to calculate:
1. ax+b
2. The average of the four input numbers w, x, y, and z
3. a2 + 2ab + b2 (can you do it with one add box and one multiply box?)
4. a6 (can you do it using only 3 multiply boxes?)

3. (1.14)
Suppose we wish to put a set of names in alphabetical order. We call the act of doing so sorting. One algorithm that can accomplish that is called the bubble sort. We could then program our bubble sort algorithm in C, and compile the C program to execute on an x86 ISA. The x86 ISA can be implemented with an Intel Core microarchitecture. Let us call the sequence "Bubble Sort, C program, x86 ISA, Core microarchitecture" one transformation process.
Assume we have available four sorting algorithms and can program in C, C++, Pascal, Fortran, and COBOL. We have available compilers that can translate from each of theses to either x86 or SPARC, and we have available three different microarchitectures for x86 and three different microarchitectures for SPARC.
1. How many transformation processes are possible?
2. Write three examples of transformation processes.
3. How many transformation processes are possible if instead of three different microarchitectures for x86 and three different microarchitectures for SPARC, there were two for x86 and four for SPARC.

4. (2.3)
1. Assume that there are about 400 students in your class. If every student is to be assigned a unique bit pattern, what is the minimum number of bits required to do this?
2. How many more students can be admitted to the class without requiring additional bits for each student's unique bit pattern?

Without changing their values, convert the following 2's complement binary numbers into 8-bit 2's complement numbers.
1. 010110
2. 1101
3. 1111111000
4. 01

Compute the following. Assume each operand is a 2's complement binary number.
1. 01 + 1011
2. 11 + 01010101
3. 0101 + 110
4. 01 + 10

7. Convert the following 8-bit 2's complement binary numbers into decimal numbers.
1. 01010101
2. 10001101
3. 10000000
4. 11111111

8. Express the value 0.3 in the 32-bit floating point format that we discussed in class today. Feel free to only show fraction bits [22:15], rather than all the fraction bits, [22:0]. Notation: The symbol [22:15] signifies all 8 bits from bit 22 to bit 15.

9. Convert the following floating point representation to its decimal equivalent: 1 10000010 10101001100000000000000

10. (Adapted from 2.50) Moved to Problem Set 2 (updated 9/2/2015)
• xABCD OR x9876
• x1234 XOR x1234
• xFEED AND (NOT(xBEEF))

11. (2.54)

Fill in the truth table for the equations given. The first line is done as an example.
Q1 = NOT (NOT(X) OR (X AND Y AND Z))
Q2 = NOT ((Y OR Z) AND (X AND Y AND Z))

12. `X    Y    Z `
`Q1    Q2 `
`0    0    0`
`0      1`
`           `
`        `
`           `
`        `
`           `
`        `
`           `
`        `
`           `
`        `
`           `
`        `
`           `
`        `