Work through fixed-width modular arithmetic, the carry out of the most significant bit, the flags behind the signed and unsigned branch conditions, and the shift-and-add multiplication algorithm.
0 of 8 correct
Knowledge Check
Arithmetic in an N-bit register wraps modulo M. For a 4-bit register, what is M?
Knowledge Check
An add produces a carry out of the most significant bit. What happens to that carry?
Knowledge Check
Which branching condition should be used to check if one unsigned integer is strictly greater than another?
Knowledge Check
Why do the unsigned branch conditions ignore the Negative (N) and Overflow (V) flags?
Knowledge Check
In the shift-and-add multiplication algorithm taught in the course, what extra step is needed at the end when the original multiplier is negative?
Knowledge Check
How is a multi-bit binary adder built out of full adders?
Knowledge Check
Why does the ALU perform subtraction by negating the subtrahend and then adding?
Knowledge Check
After a subs or cmp on signed integers, why is the lt condition true exactly when N is not equal to V?