Question: 1 . Assume you have a byte - addressable machine that uses 3 2 - bit integers and you are storing the hex value 1

1. Assume you have a byte-addressable machine that uses 32-bit integers and you are storing the hex value 1234 at address 0:
a) Show how this is stored on a big endian machine.
b) Show how this is stored on a little endian machine.
c) If you wanted to increase the hex value to 123456, which byte assignment would be more efficient, big or little endian? Explain your answer.
6. The first two bytes of a 2M \times 16 main memory have the following hex values:
Byte 0 is FE
Byte 1 is 01
If these bytes hold a 16-bit twos complement integer, what is its actual decimal value if:
a) Memory is big endian?
b) Memory is little endian?
10) A computer has 32-bit instructions and 12-bit addresses. Suppose there are 250 two-address instructions. How many one-address instructions can be formulated? Explain your answer.
12) Convert the following expression from infix to reverse Polish (postfix) notation
X \times Y + W \times Z + V \times U
21) Suppose we have the instruction Load 1000. Given that memory and register R1 contain the values below
and assuming that R1 is implied in the indexed addressing mode, determine the actual value loaded into the accumulator for the following modes:
Immediate
Direct
Indirect
Indexed
27) A digital computer has a memory unit with 24 bits per word. The instruction set consists of 150 different operations. All instructions have an operation code part (opcode) and an address part (allowing for only one address). Each instruction is stored in one word of memory
a) How many bits are needed for the opcode?
b) How many bits are left for the address part of the instruction?
c) What is the maximum allowable size for memory?
d) What is the largest unsigned binary number that can be accommodated in one word of memory?

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 Databases Questions!