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. Describe Program Control Instructions?
These instructions specify conditions for altering the sequence of program execution or we can say in other words that the content of PC (program counter) register. PC points to memory location which holds the subsequent instruction to be executed. The alteration in value of PC as a result of execution of control instruction such as BRANCH or JUMP causes a break in sequential execution of instructions. The most common control instructions are as following:
JUMP and BRANCH may be unconditional or conditional. JUMP is an unconditional branch used to implement simple loops. JNE jump not equal is conditional branch instruction. The conditional branch instructions like BRP X and BRN X causes a branch to memory location X if the result of most recent operation is positive or negative correspondingly. If the condition is true PC is loaded with branch address X and next instruction is taken from X otherwise PC is not changed and the subsequent instruction is taken from location pointed by PC. Figure below displays an unconditional branch instruction and a conditional branch instruction if content of AC is zero.
MBR←0; Assign 0 to MBR register
X←2001; Assume X to be an address location 2001
READ X; Read a value from memory location 2001 into AC
BRZ 1007; Branch to location 1007 if AC is zero (Conditional branch on zero)
ADD MBR; add the content of MBR to AC and store result to AC
TRAS MBR; Transfer the contents of AC to MBR
INC X; Increment X to point to next location
JUMP 1001;Loop back for further processing.
chemistry behind them in brief
Add 648 and 487 in BCD code. Ans. In BCD Code, addition of 648 and 487: 6 4 8 = 0 1 1 0 0 1 0 0 1 0 0 0 4 8 7 = 0 1 0 0 1 0 0 0 0 1 1 1 ---------------------
Addressability: Location-addressable Each alone accessible unit of information in storage is chosen with its numerical memory address. In the modern computers, location-a
What is control store? The microroutines for all the instructions in the instruction set of a computer are kept in a special memory known as the control store.
Generic Techniques Developed: In the pursuit of solutions to various problems in the above categories, various individual fundamental techniques have sprung up which have been
"A datagram cannot be larger than the MTU of a network over which it is sent." Is the statement true or false? Explain with the help of a suitable example. All hardware technol
How will you prepare problem statement? Problem statement should state what is to be completed and not how it is to be executed. It should be a statement of requirements not a
What is a accepting computation history? An accepting computation history is explained as , Let M be a Turing machine and w be a input string, for M on w is a sequence of con
Running Time - Metrics for performance evaluation: Running time is amount of time consumed in execution of an algorithm for a provided input on N-processor based parallel comp
what is cascading rolback?
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