1. 2.

3.

4. 5.

Suppose register 7 contains the bit pattern E5 and that register 8 contains the bit pattern OF. What bit pattern is left in register 0 after each of the following instruction is executed: 5078 Here is a tiny program listed with the address on the left and the byte stored at the address to the right. Assume that the program counter is sent to 00 and then the machine starts executing. 00 1754 02 B002 04 C000 This is the textbook's formal definition of an algorithm: An algorithm is an ordered set of unambiguous, executable steps that defines a terminating process. Does this program fit the formal definition of an algorithm as defined by the textbook? Here is a tiny program listed with the address on the left and the byte stored at that address on the right. Assume that the program counter is set to AF and then the machine starts executing. Address Value AF BO BO BO AF This is the formal definition of an algorithm from the textbook: "an algorithm is an ordered set of unambiguous, executable sets that defines a terminating process." Does this program fit this formal definition of an algorithm? B1 Suppose register 7 contains the bit pattern E5 and that register 8 contains the bit pattern OF. What bit pattern is left in register 0 after each of the following instruction is executed: 5078 Suppose register 3 contains the bit pattern E5. What bit pattern is left in register 3 after each of the following instruction is executed: A30A