Explain relative addressing scheme, Computer Engineering

Assignment Help:

Q. Explain Relative Addressing Scheme?

In this addressing technique the register R is the program counter (PC) which contains the address of current instruction being executed. Operand field A comprises the displacement (negative orpositive) of adata or instruction with respect to current instruction. This addressing scheme has benefits if memory references are nearer to current instruction being executed. (Please refer to the Figure below). 

896_Explain Relative Addressing Scheme.png

Let's give an illustration of Index, Base and Relative addressing techniques. 

Illustration 1: What would be the effective address and operand value for following LOAD instructions?

(i)    LOAD   IA   56 R1 Where IA signifies index addressing and R1 is index register and 56 is the displacement in Hexadecimal.

(ii)   LOAD BA 46 B1 Where BA signifies base addressing and B1 is base register and46 is the displacement specified in instruction in Hexadecimal notation.

(iii)  LOAD RA 36 Where RA signifies relative addressing. 

 The values of memory and registers is given below:

1500_Explain Relative Addressing Scheme1.png

The values are displayed in the below table:

597_Explain Relative Addressing Scheme2.png


Related Discussions:- Explain relative addressing scheme

Explain what is a transaction in sap terminology, Explain what is a transac...

Explain what is a transaction in SAP terminology. In SAP terminology, a transaction is series of logically linked dialog steps.

Determine the level of state decomposition, Determine the level of state de...

Determine the level of state decomposition The level of state decomposition must be determined by judgement. A too fine grained model is unsuitable, such as, modelling all poss

Define the time when a block of data is ready to be read, The total time to...

The total time to prepare a disk drive mechanism for a block of data to be read from is its ? Ans. latency plus seek time is the total time to prepare a disk drive mechanism fo

Computation step in time complexity of an algorithm, Q. Computation step in...

Q. Computation step in time complexity of an algorithm? So First in the computation step the local processor executes an arithmetic and logic operation. Afterwards the several

Recursion, Ask qurecurrion for short noteestion

Ask qurecurrion for short noteestion

Two methods of copying a information document, There are basically two meth...

There are basically two methods of copying: Photocopying This is a modified development of photography. It is quite expensive and slow and is not often used for routine rep

Marked statement is implemented , Consider the ReadRear Java method (a)...

Consider the ReadRear Java method (a) Illustrate pictures that explain the data structure every time a checkpoint is reached for the problems of sizes one, two, three and four s

Show the process of message passing, Q. Show the process of message passing...

Q. Show the process of message passing? The subsequent issues are determined by system in process of message passing: 1)  Whether receiver is prepared to receive message

Illustrate minimization of gates, Q. Illustrate Minimization of Gates? ...

Q. Illustrate Minimization of Gates? The generalization of Boolean expression is much useful for combinational circuit design. The subsequent three techniques are used for this

What is parsing, a. Define parsing? Give difference among top down parsing ...

a. Define parsing? Give difference among top down parsing and bottom up parsing. b. Determine the self-relocating programs? Why self-relocating programs are less efficient then

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd