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.
Minimize the logic function Y(A, B, C, D) = ∑m(0,1,2,3,5,7,8,9,11,14). Use Karnaugh map. Draw logic circuit for the simplified function. Ans: In following figure (a) shows the
Q. Find simplified function F and implement that function using only NAND gates. 1. F(A,B,C) = (A+B) (A'+B+C') (A'+B'+C') 2. F (A,B,C) = A'B'C'+B'CD'+A'BCD'+AB'C' 3. F(X,Y
Q. Determine the odd parity bit for F. Q. Convert the following from binary to decimal, hexadecimal, BCD and octal. a) 1000000011 b) 0001010110101 c) 1 Q. Convert the f
Explain the different page replacement policies. Various page replacement algorithms are briefly explained below: 1. First-in, first-out FIFO page replacement algorith
basic purpose of cookies
It allows code reusability. Reusability saves time in program development. It encourages the reuse of proven and debugged high-quality software, thus decreasing problem after a sys
What is a file? A file is a named collection of related information that is recorded on secondary storage. A file having either programs or data. A file has sure "structure" b
how Hierarchical Routing implement in c or cpp
Words having 8-bits are to be stored into computer memory. The number of lines required for writing into memory are ? Ans. 8-bit words needed 8 bit data lines.
We might model such a scenario using three types of object: one for Customers, one for BankAccounts and another for Transactions. In terms of data required, for Customers assume we
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