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 Status and Control Registers?
For control of numerous operations several registers are used. These registers can't be used in data manipulation though content of some of these registers can be used by programmer. One of the control registers for a von-Neumann machine is the Program Counter (PC).
Almost all the CPUs have a status register a part of which may be programmer visible. A register that may be formed by condition codes is called condition code register. Some of the commonly employed flags or condition codes in such a register may be:
These flags are set by CPU hardware while performing an operation. For illustration an addition operation can set overflow flag or on a division by 0 the overflow flag can be set etc. These codes can be tested by a program for a typical conditional branch operation. Condition codes are collected in one or more registers. RISC machines have various sets of conditional code bits. In these machines, an instruction specifies the set of condition codes that is to be used. Independent sets of condition code allow provisions of having parallelism within the instruction execution unit.
Flag register is frequently called as Program Status Word (PSW). It comprises condition code and other status information. There can be numerous other status and control registers like interrupt vector register in machines employing vectored interrupt or stack pointer if a stack is used to implement subroutine calls etc.
Not Recently Used Page Replacement Algorithm The not recently used abbreviated as NRU page replacement algorithm works on the subsequent principle: while a page is referenced,
Discrete Mathematics - (A?B)-(AnB)=(A-B)?(B-A) - prove by cases?? State which law you have used at each step. I''ve just started learning this, this semester .. and i havnt quite
Hill Climbing - Artificial Intelligence: As we've seen, in some problems, finding the search path from primary to goal state is the point of the exercise. In other problems, t
Q. Signed 1s complement representation? Another possibility that is also simple is use of signed 1's complement. Signed 1's complement has a principal. Add both numbers includi
Shared Memory Refers to the memory part of a computer system in which the memory can processed directly by any of the processors in the system. Distributed Memory Refer
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
What is the main problem with segmentation? Problem with segmentation (i) Is with paging, such mapping needs two memory references per logical address that slows down the
A Canvas object gives access to a Graphics object by its paint() method.
Data hazards - computer architecture : A main effect of pipelining is to alter the relative timing of instructions by overlapping their execution. This introduces contro
Define pipelining Pipelining is an efficient way of organizing concurrent activity in a computer system. The processor implements the program by fetching and implementing instr
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