SHARE
SPREAD
HELP

The Tradition of Sharing

Help your friends and juniors by posting answers to the questions that you know. Also post questions that are not available.


To start with, Sr2Jr’s first step is to reduce the expenses related to education. To achieve this goal Sr2Jr organized the textbook’s question and answers. Sr2Jr is community based and need your support to fill the question and answers. The question and answers posted will be available free of cost to all.

 

#
Authors:
Linda Null ,julia Lobur
Chapter:
Marie An Introduction To A Simple Computer
Exercise:
Exercises
Question:9 | ISBN:9780763704445 | Edition: 3

Question

Assume a 2^20 byte memory:

a) What are the lowest and highest addresses if memory is byte-addressable?

b) What are the lowest and highest addresses if memory is word-addressable, assuming a 16-bit word?

c) What are the lowest and highest addresses if memory is word-addressable, assuming a 32-bit word?

TextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbookTextbook

Answer

a)

If memory is byte-addressable, the lowest address would be 0 and the highest address would be(220 - 1).

This is because each byte in memory is assigned a unique address, starting from 0 and incrementing up to (220 - 1).

b)

f memory is word-addressable with a 16-bit word, each word would occupy 2 bytes.

Therefore, the lowest address would be 0, and the highest address would be ((220) / 2) - 1.

The division by 2 is because each word occupies 2 bytes, so the total number of words in the memory is halved compared to byte-addressable memory.

c)

If memory is word-addressable with a 32-bit word, each word would occupy 4 bytes.

In this case, the lowest address would be 0, and the highest address would be ((220) / 4) - 1.

Again, the division by 4 is because each word occupies 4 bytes, so the total number of words in the memory is a quarter of the byte-addressable memory.

0 0

Discussions

Post the discussion to improve the above solution.