Skip to main content

Addressing Modes & Types of Addressing Modes

Addressing Modes & Types of Addressing Modes


Addressing modes: The different ways of specifying the location of an operand in instruction are called addressing modes.

Types of Addressing Modes: In computer architecture, there are the following types of addressing modes:
  1. Implied / Implicit Addressing Mode
  2. Stack Addressing Mode
  3. Immediate Addressing Mode
  4. Direct Addressing Mode
  5. Indirect Addressing Mode
  6. Register Direct Addressing Mode
  7. Register Indirect Addressing Mode
  8. Relative Addressing Mode
  9. Indexed Addressing Mode
  10. Base Register Addressing Mode
  11. Auto-Increment Addressing Mode
  12. Auto-Decrement Addressing Mode
Types of Addressing Modes
(Types of Addressing Modes)

In this article, we will discuss these addressing modes in detail.

1. Implied Addressing Mode:
In this addressing mode,
  • The definition of the instruction itself specifies the operands implicitly.
  • It is also called an implicit addressing mode.

Examples:
  • The instruction “Complement Accumulator” is an implied mode of instruction.
  • In a stack-organized computer, Zero Address Instructions have implied mode instructions.

2. Stack Addressing Mode:
In this addressing mode,
  • The operand is contained at the top of the stack.

Example:
  • This instruction simply pops out two symbols contained at the top of the stack.
  • The addition of those two operands is performed.
  • The result so obtained after addition is pushed again at the top of the stack.

3. Immediate Addressing Mode:
In this addressing mode,
  • The operand is specified in the instruction explicitly.
  • Instead of the address field, an operand field is present that contains the operand.

Examples:
  • ADD 10 will increment the value stored in the accumulator by 10.
  • MOV R #20 initializes register R to a constant value of 20.

4. Direct Addressing Mode:
In this addressing mode,
  • The address field of the instruction contains the effective address of the operand.
  • Only one reference to memory is required to fetch the operand.
  • It is also called an absolute addressing mode.

Example:
  • ADD X will increment the value stored in the accumulator by the value stored at memory location X.
AC ← AC + [X]

5. Indirect Addressing Mode:
In this addressing mode,
  • The address field of the instruction specifies the address of memory location that contains the effective address of the operand.
  • Two references to memory are required to fetch the operand.

Example:
  • ADD X will increment the value stored in the accumulator by the value stored at the memory location specified by X.
AC ← AC + [[X]]

6. Register Direct Addressing Mode:
In this addressing mode,
  • The operand is contained in a register set.
  • The address field of the instruction refers to a CPU register that contains the operand.
  • No reference to memory is required to fetch the operand.

Example:
  • ADD R will increment the value stored in the accumulator by the content of register R.
AC ← AC + [R]

NOTE:
  • This addressing mode is similar to the direct addressing mode.
  • The only difference is address field of the instruction refers to a CPU register instead of the main memory.

7. Register Indirect Addressing Mode:
In this addressing mode,
  • The address field of the instruction refers to a CPU register that contains the effective address of the operand.
  • Only one reference to memory is required to fetch the operand.

Example:
  • ADD R will increment the value stored in the accumulator by the content of the memory location specified in register R.
AC ← AC + [[R]]

NOTE:
  • This addressing mode is similar to the indirect addressing mode.
  • The only difference is address field of the instruction refers to a CPU register.

8. Relative Addressing Mode:
In this addressing mode,
  • Effective address of the operand is obtained by adding the content of the program counter with the address part of the instruction.
Effective Address = Content of Program Counter + Address part of the instruction

NOTE:
  • Program counter (PC) always contains the address of the next instruction to be executed.
  • After fetching the address of the instruction, the value of the program counter immediately increases.
  • The value increases irrespective of whether the fetched instruction has been completely executed or not.

9. Indexed Addressing Mode:
In this addressing mode,
  • Effective address of the operand is obtained by adding the content of the index register with the address part of the instruction.
Effective Address = Content of Index Register + Address part of the instruction

10. Base Register Addressing Mode:
In this addressing mode,
  • Effective address of the operand is obtained by adding the content of the base register with the address part of the instruction.
Effective Address = Content of Base Register + Address part of the instruction

11. Auto-Increment Addressing Mode:
  • This addressing mode is a special case of Register Indirect Addressing Mode where-

Effective Address of the Operand = Content of Register

In this addressing mode,
  • After accessing the operand, the content of the register is automatically incremented by step size ‘d’.
  • Step size ‘d’ depends on the size of the operand accessed.
  • Only one reference to memory is required to fetch the operand.

Example:
Assume operand size = 2 bytes.
Here,
  • After fetching operand 6B, the instruction register RAUTO will be automatically incremented by 2.
  • Then, updated value of RAUTO will be 3300 + 2 = 3302.
  • At memory address 3302, the next operand will be found.

NOTE:
In auto-increment addressing mode,
  • First, the operand value is fetched.
  • Then, the instruction register RAUTO value is incremented by step size ‘d’.

12. Auto-Decrement Addressing Mode:
  • This addressing mode is again a special case of Register Indirect Addressing Mode where-

Effective Address of the Operand = Content of Register – Step Size

In this addressing mode,
  • First, the content of the register is decremented by step size ‘d’.
  • Step size ‘d’ depends on the size of the operand accessed.
  • After decrementing, the operand is read.
  • Only one reference to memory is required to fetch the operand.
Example:
Assume operand size = 2 bytes.
Here,
  • First, the instruction register RAUTO will be decremented by 2.
  • Then, the updated value of RAUTO will be 3302 – 2 = 3300.
  • At memory address 3300, the operand will be found.
NOTE:
In auto-decrement addressing mode,
  • First, the instruction register RAUTO value is decremented by step size ‘d’.
  • Then, the operand value is fetched.


Comments

Popular posts from this blog

JS Code for Generating OTP

JS Code for Generating OTP -  * Learn how to create a simple JavaScript function to generate a random 4-digit OTP. (GENERATED BY - ChatGPT) function OTP() { let otp = ""; otp = Math.floor(Math.random() * 9000 + 1000); return otp; } console.log("Your OTP is-", OTP());

Concurrency Control

What is Concurrency Control? Concurrency Control in Database Management System is a procedure of managing simultaneous operations without conflicting with each other. It ensures that Database transactions are performed concurrently and accurately to produce correct results without violating data integrity of the respective Database. Concurrent access is quite easy if all users are just reading data. There is no way they can interfere with one another. Though for any practical Database, it would have a mix of READ and WRITE operations and hence the concurrency is a challenge. DBMS Concurrency Control is used to address such conflicts, which mostly occur with a multi-user system. Therefore, Concurrency Control is the most important element for proper functioning of a Database Management System where two or more database transactions are executed simultaneously, which require access to the same data. Potential problems of Concurrency Here, are some issues which you will likely to face wh...

Top 10 Most Famous Photographers of All Time

*Top 10 Most Famous Photographers of All Time* If you want to take truly memorable and moving photographs, you can learn something by studying the pictures of famous photographers. Some of the most beloved artists are deceased, but some are still delighting us with their photographs. The list below includes some of the more famous photographers that still impact our lives today. 1. *Ansel Adams* is probably the most easily recognized name of any photographer. His landscapes are stunning; he achieved an unparalleled level of contrast using creative darkroom work. You can improve your own photos by reading Adams’ own thoughts as he grew older, when he wished that he had kept himself strong enough physically to continue his work. 2. *Yousuf Karsh* has taken photographs that tell a story, and that are more easily understood than many others. Each of his portraits tells you all about the subject. He felt as though there was a secret hidden behind each woman and man. Whether he captures a gl...