Describe, step-by-step, what the Little Man does to execute an UNCODITIONAL BRANCH instruction. If a user wants to enter two numbers, what must the Little Man program do before she enters the second number? Why?
Write a Little Man program that accepts two numbers as input and outputs the numbers in reverse order.
Even if he runs out of instructions to execute, the Little Man only stops trying to execute instructions under one condition. What is that condition? What happens if the Little Man runs out of instructions and that condition is not met?
When a value is copied from one register to another, what happens to the value in the sourceregister? What happens to the value in the destinationregister?
If the memory register for a particular computer is 32 bits wide, how much memory can this computer support?