USA: +1(669)289-8683 
Sign in
I need help with my computer architecture midterm. It is due 10/26 at 11:59pm PST, I need it back by 12/26 5pm PST! I have the attached the final to this question. You must show your work for all answers!
Ex: Convert the 16-bit hexadecimal values stored as two’s complement to their equivalent signed decimal
A = 1010
A = 1010
B = 1011
B = 1011
= 1010 1010 1011 1011
MSB = 0 = +
(1 x2^15) + (0x2^14) + (1×2^13) + (0x2^12) + (1 x2^11) + (0 x2^10) + (1 x2^9) + (0 x2^8) + (1 x2^7) + (0 x2^6) + (1 x2^5) +
(0 x2^4) + (1 x2^3) + (0 x2^2) + (1 x2^1) + (1 x2^0) = ….
CS 242: Computer Architecture and Organization
Fall 2023
Student: ___________________________
Midterm (150 total points)
True/False (10 points)
1. Only a very good assembly programmer can produce better code than the most modern
compilers.
2. Knowing the machine level limitations helps you decide if an assembly program can be more
efficient than a high-level language one.
3. One assembly instruction translates into multiple machine level instructions.
4. Von Neumann architecture does not separate between the program memory unit and
processing unit.
5. Von Neumann bottleneck occurs between the CPU and external memory modules.
6. Both signed and unsigned numbers can have as the first bit a 1.
7. Data stored in memory with the most significant byte in the lowest-numbered address is called
little-endian storage.
8. When adding two signed integers in the two’s complement notation, carry is irrelevant.
9. Combinational logic circuits have no memory.
10. A register is a type of combinational logic circuit.
Computer Arithmetic
1. Convert the 16-bit hexadecimal values stored as two’s complement to their equivalent signed
decimal:
a. aabb (5 points)
b. 0101 (5 points)
2. Show how each signed decimal integers would be stored in 16-bit two’s complement format.
Give your answer in hexadecimal.
a. -2048 (5 points)
b. 513 (5 points)
c. -86 (5 points)
d. 1010 (5 points)
3. Perform binary addition of the following pairs of 16-bit numbers shown in hexadecimal and
indicate whether the result is “right” or “wrong”. Treat the numbers first as signed and then as
unsigned.
a. 07ef + 7812 (10 points)
b. 9999 + 6666 (10 points)
Boolean Algebra
1. Minimize the following function using algebraic manipulations (10 points):
F(x,y,z) = x’z + xy’z’ + xyz’ + xz
2. Minimize the following function using Karnaugh map (10 points):
F(x,y,z) = xyz’ + x’y’z’ + xy’z’ + x’yz’ + xy’z + x’yz
3. Given the follow Karnaugh map find the minimized function F(x,y,z,w): (20 points)
zw
1
xy
1
1
1
1
1
1
F(x,y,z,w) =
4. Provide a NAND circuit implementation for the #2 function (15 points)
5. A 3-bit parity check circuit will output a 1 for input having even number of 1’s. Provide the truth
table, Karnaugh map for the minimized function, and circuit implementation using PLA. (35 pts.)
Extra Credit: 10 points (same 10 like below)
There are 10 types of people in the world—those who understand binary notation and those who don’t.
True / False
