Computer Organization and Architecture Assignment: MARIE, ISA Analysis

This assignment solution addresses key concepts in Computer Organization and Architecture (COA). It begins with a MARIE program for calculating the Fibonacci series, analyzing its functionality and limitations. The solution then delves into instruction set design, calculating the possible number of instructions based on address bits and encoding schemes. Finally, it presents code examples for different addressing modes (3-address, 2-address, 1-address, and 0-address machines) to perform the same operation, illustrating the differences in code structure and complexity. The assignment includes a bibliography of relevant sources. The solution provides valuable insights into fundamental computer architecture principles, including instruction set design and addressing modes.

Running head: COMPUTER ORGANIZATION AND ARCHITECTURE
Assignment 2: MARIE and ISA
Name of the Student
Name of the University
Author’s Note

1
COMPUTER ORGANIZATION AND ARCHITECTURE
Table of Contents
Answer 1:.........................................................................................................................................2
Answer 2:.........................................................................................................................................5
Answer 3:.........................................................................................................................................6
Bibliography....................................................................................................................................8

2
COMPUTER ORGANIZATION AND ARCHITECTURE
Answer 1:
1.a.
The following is the MARIE program created for the calculation of the Fib (n) where user inputs
is n –
ORG 100
INPUT
STORE N
STORE Ctr
Loop1 CLEAR
LOAD Ctr
SUBT C1
STORE Ctr
LOAD F2
ADD F1
STORE F3
LOAD F1
STORE F2
LOAD F3

3
COMPUTER ORGANIZATION AND ARCHITECTURE
STORE F1
LOAD Ctr
SKIPCOND 400
JUMP Loop1
LOAD Ctr
OUTPUT
LOAD N
OUTPUT
LOAD F1
OUTPUT
HALT
N DEC 0
Ctr DEC 0
C1 DEC 1
F1 DEC 0
F2 DEC 1
F3 DEC 0

4
COMPUTER ORGANIZATION AND ARCHITECTURE
1.b.
If the value of n is greater than 24 then the correct result cannot be obtained from the
MARIE program and it is identified by gradually increasing the value of n and verification of the
output.
The reason for the value greater than 24 causes error result is that the threshold limit for
storing the value is crossed.

5
COMPUTER ORGANIZATION AND ARCHITECTURE
Answer 2:
Number of possible instruction set for the 11 bits address = 211
= 2048
Number of encoding consumed by the two-address instructions = 6 × 24 × 24
= 1536
Number of encoding taken by the one-address instructions = 30 × 24
= 480
Therefore the possible number of zero-address instructions = 2048 − (1536 + 480)

6
COMPUTER ORGANIZATION AND ARCHITECTURE
= 32 instructions.
Answer 3:
For the 3 Address Machine
ADD R1, B, C
SUBT R2, D, E
MUL A, R1, R2
For the 2 Address Machine
LOAD R1, B
ADD R1, C
LOAD R2, D
SUBT R2, E
MULT R2, R1
STORE A, R2
For the 1 Address machine
LOAD B
ADD C
STORE TEMP
LOAD D

7
COMPUTER ORGANIZATION AND ARCHITECTURE
SUBT E
MULT TEMP
STORE A
For the 0 address machine
PUSH B
PUSH C
ADD
PUSH D
PUSH E
SUB
MULT
STORE A

8
COMPUTER ORGANIZATION AND ARCHITECTURE
Bibliography
Farooq, S. M., & Basha, S. S. (2016, January). A study on Fibonacci series generation
algorithms. In Advanced Computing and Communication Systems (ICACCS), 2016 3rd
International Conference on (Vol. 1, pp. 1-5). IEEE.
Null, L., & Lobur, J. (2014). The essentials of computer organization and architecture. Jones &
Bartlett Publishers.
Prinz, P., Crawford, T., Hennessy, J. L., & Patterson, D. A. (2018). Computer Architecture: A
Quantitative Approach.
Singh, S., Yadav, P., & Mukherjee, G. (2015). Line Search Techniques by Fibonacci
Search. International Journal of Mathematics and Statistics Invention.
Tanenbaum, A. S. (2016). Structured computer organization. Pearson Education India.
Wang, S., & ZHANG, C. (2016). Computer architecture.