University Computer Organization and Architecture Assignment Solution

Verified

Added on  2020/05/16

|4
|299
|338
Homework Assignment
AI Summary
This document offers a comprehensive solution to a computer organization and architecture assignment. The solution addresses key concepts, including calculating total storage capacity, rotational delay, and access time. It also explores instruction set architecture, including addressing modes, and demonstrates the implementation of arithmetic operations using different addressing formats (2-address, 1-address, and 0-address instructions). The assignment covers topics such as memory organization, instruction formats, and assembly language concepts. The solution provides a clear explanation and breakdown of each problem, making it a valuable resource for students studying computer architecture.
Document Page
Running Head: COMPUTER ORGANIZATION AND ARCHITECTURE
Assignment 2: MARIE & ISA
[Student Name]
[University Name]
tabler-icon-diamond-filled.svg

Paraphrase This Document

Need a fresh take? Get an instant paraphrase of this document with our AI Paraphraser
Document Page
1COMPUTER ORGANIZATION AND ARCHITECTURE
Answer to question 1
Total number of Track - 23*512 = 11776
Total number of sectors - 11776*64 = 753664
I) Total capacity – 753664*32 = 24117248 bytes
II) Rotational delay - (1 / (RPM / 60)) * 0.5 * 1000 = 30000 / 9600 = 0.3125 ms
III) Access time = seek time + rotational delay = 10+0.3125 ms
Answer to question 2
I) 8 bits,
ii) 3 bits are need to specify the register because 2^3 = 8.
iii) 32-8 = 24
iv) 224 is the maximum allowable size
v) largest unsigned binary number is 232-1
Answer to question 3
Number of address instruction is 213 = 8192
FIVE 2-address = 5 * 25 * 25 = 5120
TWENTY 1-address = 20 * 25 = 640
8192 – (5120+640) = 2432 0-address instruction still possible to accommodate for the
instruction set architecture.
Answer to question 4
2 address
Document Page
2COMPUTER ORGANIZATION AND ARCHITECTURE
MOV C,X # C X
ADD C, Y # C X + Y
MOV B, Y # B Y
SUB B, Z # B Y-Z
MPY C, B # C * B
MOV D, X # DX
MPY D, Y # D X*Y
DIV C, D # C / D
1-Address
LOAD X
ADD Y
STORE A
LOAD Y
SUB Z
MPY A
STORE A
LOAD X
MPY Y
DIV A
STORE A
Document Page
3COMPUTER ORGANIZATION AND ARCHITECTURE
0-Address
PUSH X
PUSH Y
ADD
PUSH Y
PUSH Z
SUB
MPY
PUSH X
PUSH Y
MPY
DIV
POP A
chevron_up_icon
1 out of 4
circle_padding
hide_on_mobile
zoom_out_icon
[object Object]