Define the addressing modes, Computer Engineering

Assignment Help:

Q. Define the ADDRESSING MODES?

The elementary set of operands in 8086 can reside in memory, register and immediate operand. How can these operands be retrievedby various addressing modes? The answer to the question above is provided in the subsequent sub-section. Large number of addressing modes assists in addressing complex data structures with ease. A number of specific Terms and registers roles for addressing:

Base register (BX, BP): These registers are employed for pointing to base of a stack, array etc.

Index register (SI, DI): These registers are employed as index registers in data and/or extra segments.

Displacement: It signifies offset from the segment address. 

Addressing modes of 8086

Mode

Description

 

Direct

Effective address is the displacement of memory variable.

 

Register Indirect

Effective address is the contents of a register.

[BX]

[SI]

[DI]

[BP]

Based

Effective address is the sum of a base register and a displacement.

LIST[BX] 

(OFFSET LIST + BX)

[BP + 1]

Indexed

Effective address is the sumof an index register and a displacement.

LIST[SI]

[LIST +DI]

[DI + 2]

Based Indexed

Effective address is the sum of a base and an index register.

[BP + DI]

[BP + DI]

Based Indexed with

displacement

Effective address is the sum of a base register, an index register, and a displacement. 

[BX + SI + 2]


Related Discussions:- Define the addressing modes

Example multi-layer ann with sigmoid units, Example Multi-layer ANN with Si...

Example Multi-layer ANN with Sigmoid Units: However we will concern ourselves here that with ANNs containing only one hidden layer and as this makes describing the backpropaga

What is demand paging, What is major difference between the Historic Unix a...

What is major difference between the Historic Unix and the new BSD release of Unix System V in terms of Memory Management? Historic Unix uses Swapping - Whole process is tran

Time complexity in the worst case, Speicified the following piece of code: ...

Speicified the following piece of code: int i = 1; int j = 4; while (i     {      if (i%3 == 0) i+=3;      else i+=4;        if (j%2 == 0) j*=4;      els

Struct and class, https://dl.dropbox.com/u/41918180/Images/Pro%202/2.png ...

https://dl.dropbox.com/u/41918180/Images/Pro%202/2.png https://dl.dropbox.com/u/41918180/Images/Pro%202/3.png https://dl.dropbox.com/u/41918180/Images/Pro%202/4.png">https://dl.d

Programming languages array operations, Q. Programming languages array oper...

Q. Programming languages array operations? In programming languages array operations are written in compact form which frequently makes programs more understandable. Conside

Parallel computing, explain different types of parallel processing mechani...

explain different types of parallel processing mechanism

What do you understand by client-server architecture, Question: (a) (i...

Question: (a) (i) Explain what do you understand by Client/server architecture? (ii) List and briefly describe 3 types of Client/server architecture. (b) The most impo

Explain different system calls for performing different task, Write down di...

Write down different system calls for performing different kinds of tasks. The major types of system calls are given as: Process Control: These kinds of system calls are

Declarative programming languages, Declarative programming languages: ...

Declarative programming languages: We notice that declarative programming languages can have some better compensation over procedural ones. Actually, it is often said that a J

Avl tree rotation and b tree construction in data structure, Elements are g...

Elements are given 3,14,7,1,8,5,11,17,,6,23,12,20,26,4,16,18,24,25,19 We will construct b tree and avl tree And after that delete some integers

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