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 is dbms goal?
Q. Working of Fully Parallel Associative Processor? Fully Parallel Associative Processor: This processor accepts the bit parallel memory organisation. There are 2 kinds of this
What is state and state diagram? A state is an abstraction of values and links of an object. Set of values and links are grouped together into a state according to the group be
Microsoft access name has been transformed to Microsoft office access. This software incorporates relational database management system which joins GUI (graphical user interface) w
what is polymorphism
To how many tables can an append structure be assigned. One table can be assigned to append structure.
Illustrate the basic structure of the von Neumann machine The following figure shows basic structure of the von Neumann machine. A von Neumann machine has only a single path be
Complete Binary tree A complete binary tree can be described as a binary tree whose non leaf nodes have nonempty left and right sub tree and all leaves are at the similar level
Q. Illustrate Header section of a device driver? Header comprises information which allows DOS to identify the driver. It also comprises pointers which allow it to chain to ot
Computer Organization 1. Draw a flowchart of a Booth's multiplication algorithm and explain it. 2. What is the concept of memory interleaving? 3. Explain virtual memory? Expla
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