Department of Electrical and Computer Engineering
14:332:331Computer Architecture and Assembly Language
Fall 2012 MIDTERM EXAMINATION SOLUTIONS
PROBLEM 1 (35+10 points)
A computer has a workload composed of two programs, in which Program 1 is
executed 55%
14:332:331 Homework 3 Solutions
Problem 1 (30 points)
A is 33 (base 10) and B is 8 (base 10).
(1) (5 points) Represent A and B as 6-bit unsigned integers (in binary).
33 (base 10) = 100001 (in binary) = 2^5 + 2^0 = 32 + 1 = 33
8 (base 10) = 001000 (in bin
14:332:331 Homework 1 Solutions
Problem 1 (25 points)
Consider a computer with 8 Gbytes of main memory, a display of
1280x1024 resolution and 1 Gbit Ethernet connection.
a) If each primary colors of each pixel in the display use 8 bits (primary
colors are
Electrical and Computer Engineering Department
Arithmetic for Computers
Introduction
Thus far we have learned about signed and unsigned
integers;
We will now learn about real numbers
Addition and subtraction when the result is larger than
can be accommoda
14:332:331 Homework 2 (due September 29, 2015 at start of class)
100 points total
Problem 1 (15 points)
Consider the high-level statement D[6]=B[i-j]. Assume that i is in $t4, j in $s2, the
base address of array B is in $t3, and that of array D is in $s0.
14:332:331 Homework 3 (due October 16, 2015 start of class)
100 points total
Problem 1 (35 points)
Consider the first generation multiplication hardware shown below. The registers have already been loaded with
multiplicand 2410 and multiplier 810.
a) Assu
Electrical and Computer Engineering Department
Arithmetic for Computers
Introduction
Thus far we have learned about signed and unsigned integers;
We will now learn about real numbers
Addition and subtraction when the result is larger than can be
accommoda
Electrical and Computer Engineering Department
14:332:331
Computer Architecture and Assembly
Language
Fall 2015
Professor Grigore (Greg) Burdea Ph.D.
ECE Department, Rutgers University
Office: Core 721, Office Hours TU, FR 1:30-2:30 pm
.
Burdea@jove rutge
Electrical and Computer Engineering
Department
14:332:331
Computer Architecture and Assembly
Language
Fall 2015
Professor Grigore (Greg) Burdea Ph.D.
ECE Department, Rutgers University
Office: Core 721, Office Hours TU, FR 1:30-2:30 pm
Burdea@jove.rutgers
14:332:331 Computer Architecture HW #3
Problem 1 (30 points)
A is 23 (base 10) and B is 7 (base 10).
(1) (5 points) Represent A and B as 6-bit unsigned integers (in binary).
23 (decimal) = 24+22+21+20=010111 (binary)
7 (decimal) = 22+21+20=000111 (binary
14:332:331Computer Architecture and Assembly Language
MIDTERM EXAMINATION SOLUTIONS
100+30 extra credit points
PROBLEM 1 (35 points+10 extra credit)
A computer has a workload composed of four programs, in which Program 1 is
executed 40% of the time, Progr
1
14:332:331Computer Architecture and Assembly Language
Final Examination Solutions
PROBLEM 1 (40 points+10 points extra credit)
Consider the pipeline in Figure 1 below. The instruction sequence executed on the pipeline is:
100 <before 1>
104 <before 2>
1
Comp Arch Homework 2 Solutions
Fall 2014
Problem 1 (15 points)
Consider the high-level statement C[4]=A[i-j]. Assume that i is in $t3, j in $s4, the base address of
array A is in $t4, and that of array C is in $s0.
(1) Write the corresponding MIPS code us
COM 19y nk/him, /+ w #1
Fa 200-}
("89m+ons)
4. A
5'31 _ 0:7 I a» Panformamce N F/COv
. it} mad; ZQH i pQ/GCOPWQZP( "A 403/45 : 203 insb/SQC
I :' 5
J puforwqmg p2 m ng403/{ _, 2,5 403 H
p2: CW; ch2 25 6H2 p 9 3
. M FW;_V\ N 40 1: 4/
(Pic?! 5
14:332:331 Homework 2 Solutions
100 points total
Problem 1 (15 points)
Consider the high-level statement C[6]=A[i+j]. Assume that i is in $t0, j in $s4, the
base address of array A is in $t1, and that of C is in $s3.
(1) (7.5 pts) Write the corresponding