Question: 2. (40 pts) For the simple computer developed in class, assume it is now word-addressable (NOT byte addressable}. Consider the following program starting in memory

 2. (40 pts) For the simple computer developed in class, assume
it is now word-addressable (NOT byte addressable}. Consider the following program starting

2. (40 pts) For the simple computer developed in class, assume it is now word-addressable (NOT byte addressable}. Consider the following program starting in memory location 0. 00000000000010] 0 00] 0000000000100 000000000000 10 I 0 00 l 0000000000] 0] 00 l 00000000000] l 000] 000000000000 Assume the contents of locations 10, 12, 14 are 4, 6, 3. respectively. The content of AC is zero before the program is executed. 1) Translate each memory line in the above program into an assemny instruction (e.g., with opcode ADD or IMP). For example, the rst instruction can be written as \"ADD 0b l 010\" or \"ADD 10\". {10 pts}. 2) Write down the execution sequence of thoSe instructions. Note that JMP can change the execution sequence. {10 pts}. 3) What will be the content of AC in two cases: (a) before the first execution of the last instruction [i.e., the last line in the above program: 000 I 000000000000) and (b) after the execution of the entire program? Show how you get your answers for partial credit. (I 0 pts each)

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Economics Questions!