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.


Labels:

Comments

Post a Comment

Please do not enter any spam link in the comment box.

Popular posts from this blog

Languages in DBMS

Languages in DBMS Structured Query Language(SQL) as we all know is the database language by the use of which we can perform certain operations on the existing database and also we can use this language to create a database. SQL uses certain commands like Create, Drop, Insert, etc. to carry out the required tasks. These SQL commands are mainly categorized into five categories as: DDL – Data Definition Language DQL – Data Query Language DML – Data Manipulation Language DCL – Data Control Language TCL – Transaction Control Language Now, we will see all of these in detail. DDL (Data Definition Language): DDL or Data Definition Language actually consists of the SQL commands that can be used to define the database schema. It simply deals with descriptions of the database schema and is used to create and modify the structure of database objects in the database. DDL is a set of SQL commands used to create, modify, and delete database structures but not data. These commands are normally ...
Post a Comment
Read more

Indexing in DBMS

Indexing in DBMS Indexing is used to optimize the performance of a database by minimizing the number of disk accesses required when a query is processed.  The index is a type of data structure. It is used to locate and access the data in a database table quickly. Index structure: Indexes can be created using some database columns. The first column of the database is the search key that contains a copy of the primary key or candidate key of the table. The values of the primary key are stored in sorted order so that the corresponding data can be accessed easily.  The second column of the database is the data reference. It contains a set of pointers holding the address of the disk block where the value of the particular key can be found. Indexing Methods Ordered indices The indices are usually sorted to make searching faster. The indices which are sorted are known as ordered indices. Example: Suppose we have an employee table with thousands of record and each of which is 10 byte...
Post a Comment
Read more

SQL Injection

SQL Injection The SQL Injection is a code penetration technique that might cause loss to our database. It is one of the most practiced web hacking techniques to place malicious code in SQL statements, via webpage input. SQL injection can be used to manipulate the application's web server by malicious users. SQL injection generally occurs when we ask a user to input their username/userID. Instead of a name or ID, the user gives us an SQL statement that we will unknowingly run on our database. For Example - we create a SELECT statement by adding a variable "demoUserID" to select a string. The variable will be fetched from user input (getRequestString). demoUserI = getrequestString("UserId"); demoSQL = "SELECT * FROM users WHERE UserId =" +demoUserId; Types of SQL injection attacks SQL injections can do more harm other than passing the login algorithms. Some of the SQL injection attacks include: Updating, deleting, and inserting the data: An attack can mo...
Post a Comment
Read more