Addressing Modes


Q11.

Which of the following is/are true of the auto-increment addressing mode? I. It is useful in creating self-relocating code II. If it is included in an Instruction Set Architecture, then an additional ALU is required for effective address calculation III. The amount of increment depends on the size of the data item accessed
GateOverflow

Q12.

Which of the following statements about relative addressing mode is FALSE?
GateOverflow

Q13.

In which addressing mode, the effectives address of the operand is generated by adding a constant value to the content of a register?
GateOverflow

Q14.

Which of the following is/are true of the auto-increment Addressing Modes? I. It is useful in creating self-relocating code II. If it is included in an Instruction Set Architecture, then an additional ALU is required for effective address calculation III. The amount of increment depends on the size of the data item accessed
GateOverflow

Q15.

In the Big-Endian system, the computer stores
GateOverflow

Q16.

Which of the following statements about relative addressing mode is FALSE?
GateOverflow

Q17.

Match each of the high level language statements given on the left hand side with the most natural Addressing Modes from those listed on the right hand side. 1 A[1] = B[J]; a Indirect addressing 2 while [*A++]; b Indexed, addressing 3 int temp = *x; c Autoincrement
GateOverflow

Q18.

Which of the following Addressing Modess are suitable for program relocation at run time? (i) Absolute addressing (ii) Based addressing (iii) Relative addressing (iv) Indirect addressing
GateOverflow

Q19.

In the absolute the Addressing Modes :
GateOverflow

Q20.

The most appropriate matching for the following pairs is: \begin{array}{ll} \text{X: Indirect addressing} & \text{1: Loops } \\ \text{Y: Immediate addressing } & \text{2: Pointers} \\ \text{Z: Auto decrement addressing } & \text{3: Constants } \\ \end{array}
GateOverflow