ITEC 1011 – Introduction to Information Technologies



ITEC 1000 – Introduction to Information Technologies

Assignment #3

Due: Monday, July 18

1. Suppose the Little Man Computer had been implemented as a 16-bit binary machine. Assume that the binary LMC provides the same instruction set, with the same op codes (in binary, of course), and the same instruction format (op code followed by address). How many bits would be required for the op code portion of the instruction? How many mailboxes (memory locations) could the binary machine accommodate? What is the range of two's complement integer data that this machine can handle?

2. When the textbook discusses conditional branching it claimed that a BRANCH NEGATIVE instruction is not necessary. Give a sequence of BRANCH instructions that will cause a program to branch to location 50 if the value in the calculator is negative ( < 0 ).

3. Suppose that the following instructions are found at the given locations in memory:

20 LDA 50

21 ADD 51

50 724

51 006

a. Show the contents of the IR, the PC, the MAR, the MDR, and A at the

conclusion of instruction 20.

b. Show the contents of each register as each step of the fetch-execute cycle is

performed for instruction 21.

4. Show the steps of the CPU fetch-execute cycle for the remaining instructions in the Little Man instruction set.

................
................

In order to avoid copyright disputes, this page is only a partial summary.

Google Online Preview   Download