Computer Organization Assignment 2 - [University Name]

This assignment solution addresses several key concepts in computer organization and architecture. It begins by calculating the maximum allowable memory size and the largest unsigned binary number based on a given instruction set and memory word size. The solution then calculates and compares the values for different addressing modes (immediate, direct, and indirect). Following this, the assignment provides assembly code for a given arithmetic expression using 0-address, 1-address, and 2-address instruction formats, demonstrating the different approaches to instruction set design. Finally, the solution determines the number of possible instruction codes available and assesses how many 0-address instructions can still be accommodated, given a certain number of 2-address and 1-address instructions. The document concludes with a bibliography of relevant academic resources.

Running Head: ASSIGNMENT 2: MARIE AND ISA
ASSIGNMENT 2: MARIE AND ISA
[Student Name]
[University Name]

1ASSIGNMENT 2: MARIE AND ISA
Table of Contents
Answer to question 1..................................................................................................................2
Answer to question 2..................................................................................................................2
Answer to question 3..................................................................................................................2
Answer to question 4..................................................................................................................3
Bibliography...............................................................................................................................4

2ASSIGNMENT 2: MARIE AND ISA
Answer to question 1
digital computer has a memory unit with 24 bits per word.
The instruction set consists of 199 different operations.
2^8 = 256. Therefore the operation code need 8bits.
There are total 24-8 = 16 bits are left for the address part of the instruction.
Total maximum allowable size for the memory is 2^16 = 65535.
2^15 = 32768-1 = 32767 is the largest unsigned binary number that can be accommodated in
one word of memory.
Answer to question 2
The immediate value will be 200+900 = 1100
Direct value = 800+900 = 1700
Indirect value = 500
Index value = 250
Answer to question 3
F = (A-B)*(C*D+E)
0-address 1-address 2-address
PUSH A
PUSH B
SUB
POP A
LOAD A
SUB B
STORE F
LOAD C
MOV A, F
SUB T1, B
MOV C, T2
MPY D, T2

3ASSIGNMENT 2: MARIE AND ISA
PUSH C
PUSH D
MPY
PUSH E
ADD
PUSH A
MPY
POP F
MPY D
ADD E
STORE T
MPY F
STORE F
ADD E, T2
MPY T1, T2
MOV F, T2
Answer to question 4
There are 2^10 = 1024 possible instruction code.
Each address has 2^3 = 8 possible values.
So, for 15 2-address instruction has 15*8*8 = 960 instruction code
So, for 7 1-address instruction has =7*8 = 56 instruction code
1024-(960+56) = 8, 0-address instruction still possible to accommodate for the instruction
set architecture.

4ASSIGNMENT 2: MARIE AND ISA
Bibliography
Furber, S. B. (2017). VLSI RISC architecture and organization. Routledge.
Harris, S., & Harris, D. (2015). Digital design and computer architecture: arm edition.
Morgan Kaufmann.
Tanenbaum, A. S. (2016). Structured computer organization. Pearson Education India.
Yadin, A. (2016). Computer systems architecture. Chapman and Hall/CRC.
Zhang, S., & Liu, H. (2018, August). The Comprehensive Experiment in the Course of
Computer Organization and Architecture. In 2018 13th International Conference on
Computer Science & Education (ICCSE) (pp. 1-5). IEEE.