Always, on every assignment, please write your name legibly as it appears on your University ID and on the class list!
This first assignment is dominated by review questions that are not as much specific to the material in the book as they are to material you should have learned in prior courses or work experience. None of the answers should be long, and none should take longer than a few minutes of your time.
The assignment due date allows completed work to be returned by courrier from Rockwell-Collins to Iowa City.
The Problem: Show a truth table for a full adder using ripple carry.
The Problem: Show how the expression A = B + 5 is evaluated in the assembly language of any computer (current, obsolete or fictional), assuming A and B are one-word variables, and assuming that they are global variables -- that is, that they have static addresses. Of course, you must identify the computer you are using as an example! (For most machines, the solution will be 3 instructions or less.)