Direct addressing and immediate addressing mode , Computer Engineering

Assignment Help:

Direct Addressing and  Immediate Addressing mode - computer architecture:

 Immediate Addressing:

It is the simplest form of addressing. Here, the operand is itself given in the instruction. This mode is used to define constant or set primary values of variables. The benefit of this mode is that no memory reference rather than instruction fetch is needed to obtain operand. The disadvantage of it is that the size of the number is restricted to the size of the address field, in which most of the instruction sets is small compared to word length.

Direct Addressing:

Effective address of the operand is given in the address field of the instruction in the case of direct addressing mode. It need one memory reference to read the operand from the given location and provides only a restricted address space. Length of the address field is typically less than the word length.

For Example: Move P, Ro, Add Q, Ro P and Q are the address of operand. Indirect 

 

 


Related Discussions:- Direct addressing and immediate addressing mode

What are the counters, What are the Counters? 1. The Counter is a seque...

What are the Counters? 1. The Counter is a sequential circuit which consists of a set of flip flops connected in a appropriate manner to count the sequence of input pulses.

Operating systems, Consider the state transition diagram of Figure 3.9b . S...

Consider the state transition diagram of Figure 3.9b . Suppose that it is time for the OS to dispatch a process and that there are processes in both the Ready state and the Ready/S

Explain a full subtractor using half subtractors, Draw the logic diagram of...

Draw the logic diagram of a full subtractor using half subtractors and explain its working with the help of a truth table Ans: Full Subtractor: It has to take care of repe

Ready to help students, What is the process to register as expert in comput...

What is the process to register as expert in computer science

What is minimum spanning tree, Minimum Spanning Tree: Given a weighted gra...

Minimum Spanning Tree: Given a weighted graph G, it is often desired to make a spanning tree T for G, like the sum of weights of the edges in T is the least. Like tree is known as

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

Minimize the logic function using NAND gate, Minimize the logic function F(...

Minimize the logic function F(A, B, C, D) = ∑ m(1,3,5,8,9,11,15) + d(2,13) using NAND gate with help of K-map. Ans. Realization of given expression by using NAND gates:  In

Multi tasking environment, Q. Explain about Multi tasking environment? ...

Q. Explain about Multi tasking environment? Multi tasking uses parallelism by: 1) Pipelining functional units are pipe line mutually 2) Simultaneously employing multiple

Examples of artificial neural networks, Examples of artificial neural netwo...

Examples of artificial neural networks: Now here as an example consider a ANN that has been trained to learn the following rule categorising the brightness of 2x2 black and wh

What is the length of function code at user-command, What is the length of ...

What is the length of function code at user-command? Every menu function, push button, or function key has an associated function code of length FOUR (for example, FREE), which

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