Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
In this technique, operand field of instruction includes an address and an index register thatcomprises an offset. This addressing scheme is normally used to address the consecutive locations of memory (that may store the elements of an array). Index register is a special CPU register which contains an index value. Contents of the operand field A are taken to be address of the initial or reference location (or first element of array). The index register specifies distance between the starting address and address of that operand.
For illustration: to address of an element B[i] of an array B[1], B[2],....B[n] with every element of array stored in two consecutive locations and starting address of array is presumed to be 101, the operand field A in instruction shall comprises the number 101 and index register R will contain the value of expression (i - 1) × 2.
So for first element of the array index register will hold 0. For addressing 5th element of the array A=101 while index register will hold:
(5- 1) × 2 = 8
So address of 5th element of array B is=101+8=109. In B[5] but the element will be stored in location 109 and 110. To address any other element of array changing the content of index register will serve.
So the effective address in this technique is calculated as:
EA = A +(R)
D = (EA)
(DA is Direct address)
As the index register is employed for iterative applications so the value of index register is decremented or incremented after each reference to it. In numerous systems this operation is performed automatically at the time of the course of an instruction cycle. This feature is termed as auto-indexing. Auto indexing can be auto-decrementing or auto-incrementing. The choice of register to be employed as an index register varies from machine to machine. Some machines use general-purpose registers for this purpose whereas other machines can specify special purpose registers referred to as index registers.
Figure: For Displacement Addressing
The six several application of stack in computer application is: 1. Conversion of infix to postfix notation and vice versa. 2. Evaluation of arithmetic expression. 3.
The data structure required to convert a recursion to an iterative procedure is Stack is the data structure required to convert a recursion to an iterative procedure
What are the features of the hardwired control? A controller that uses this approach can function at high speed. It has little flexibility and the complexity of the instruction
Performance and Issues in Pipelining Throughput: Throughput of a pipeline can be defined as the number of results that have been getting per unit time. It can be denoted as:
Illustrates about Metal Fix. A Metal Fix implies that only the upper metal interconnects layers are influenced. Connections may be made or broken, but new cells may not be adde
What is dynamic random access memory Computer memory today comprises mainly of dynamic random access memory (DRAM) chips which have been built into multi-chip modules that are
Define register file. All general purpose registers are combined into a one block called the register file.
explain associative mapping
What are the types of calendars in a single interface? Member Event calendar helps users manage their personal time, Kept track of meetings with others, and so on. Tea
What are Grouping Notations These notations are boxes into which a model could be decomposed. Their elements includes of packages, frameworks and subsystems.
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd