Question
Show how the following values would be stored by machines with 32-bit words, using little endian and then big endian format. Assume each value starts
- Show how the following values would be stored by machines with 32-bit words, using little endian and then big endian format. Assume each value starts at address 1016. Draw a diagram of memory for each, placing the appropriate values in the correct (and labeled) memory locations.
- 1234567816
- ABCDEF1216
- 8765432116
- Convert the following expressions from infix to reverse Polish (postfix) notation.
- W * X - W * (U * V - Z)
- (W / (X + Y / (U * V)))/(U / (X - Y))
- (X+Y)*Z +(X-Y)*Z
Show the content of the stack during the conversion process for two of them
- Convert the following expressions from reverse Polish notation to infix notation.
- U V W X Y Z + * - * -
- X Y Z + V W * Z - +
- X Z + W / X Z - W / -
Show details of conversion
4. Suppose we have the instruction LOAD 600. Given that memory and register R1 contain the values below:
Address | Content |
100 | 600 |
400 | 300 |
500 | 400 |
600 | 600 |
700 | 600 |
800 | 600 |
Content | |
R1 | 200 |
Assuming R1 is implied in the indexed addressing mode, determine the actual value loaded into the accumulator and fill in the table below:
Mode | Value Loaded into AC |
Immediate |
|
Direct |
|
Indirect |
|
Indexed |
|
5. The memory unit of a computer has 1 M words of 32 bits each. The computer has an instruction format with 4 fields: an opcode field; a mode field to specify 1 of 4 addressing modes; a register address field to specify 1 of 8 registers; and a memory address field. Assume an instruction is 32 bits long. Answer the following:
- How large must the mode field be?
- How large must the register field be?
- How large must the address field be?
- How large is the opcode field?
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started