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!
Q. Explain Relative Addressing Scheme?
In this addressing technique the register R is the program counter (PC) which contains the address of current instruction being executed. Operand field A comprises the displacement (negative orpositive) of adata or instruction with respect to current instruction. This addressing scheme has benefits if memory references are nearer to current instruction being executed. (Please refer to the Figure below).
Let's give an illustration of Index, Base and Relative addressing techniques.
Illustration 1: What would be the effective address and operand value for following LOAD instructions?
(i) LOAD IA 56 R1 Where IA signifies index addressing and R1 is index register and 56 is the displacement in Hexadecimal.
(ii) LOAD BA 46 B1 Where BA signifies base addressing and B1 is base register and46 is the displacement specified in instruction in Hexadecimal notation.
(iii) LOAD RA 36 Where RA signifies relative addressing.
The values of memory and registers is given below:
The values are displayed in the below table:
What are the characteristics of SRAM? SRAM are fast They are volatile They are of high cost Less density
A doubly linked list is like a linked list except that each node has a pointer both to the next node in the list and to the previous node in the list. There are also pointers to th
dear sir,kindly describe the above tpoic completely
Q. Find the Largest and the Smallest Array Values? Write down a program to find the largest as well as the smallest numbers from a given array. This program uses JGE (jump grea
write algorithm and draw flowchart for exchange the values of two variables.
Step 1: Click on the icon in the object tool bar Or Insert -> SSI Step 2: Select the file Step 3: Add the file Step 4: Provide the URL (where to be attached) Step
How can i made Carnot engine
Find out useless nonterminal symbols use c program.
What do understand by the granularity of a parallel system ? Granularity refers to the quantity of computation complete in parallel relative to the size of the entire program. I
Define Deadlock with Resource request and allocation graph (RRAG) Deadlocks can be described through a directed bipartite graph termed as a RRAG that is Resource Request All
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