Bissoy.com
Doctors Medicines MCQs Q&A

In boolean instructions, the flag that is the only allowed destination operand for two operand instructions is

In boolean instructions, the flag that is the only allowed destination operand for two operand instructions is Correct Answer carry flag

Carry flag(C) is the only allowed destination operand for two operand instructions in boolean instructions.

Related Questions

In the Asian Games, the flags of six countries were flown on the mast in the following manner. The flag of China was to the left of the Indian tricolor and to the right of the flag of Japan. The flag of Lanka was to the right of the Indian flag, but to the left of the flag of Pakistan, which was to the left of the flag of Bangladesh. Which two flags were in the center?
A 5-stage pipelined processor has Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Write Operand (WO) stages. The IF, ID, OF and WO stages take 1 clock cycle each for any instruction. The PO stage takes 1 clock cycle for ADD and SUB instructions, 3 clock cycles for MUL instruction, and 6 clock cycles for DIV instruction respectively. Operand forwarding is used in the pipeline. What is the number of clock cycles needed to execute the following sequence of instructions? Instruction Meaning of instruction I0 : MUL R2, R0, R1 R2← R0 * R1 I1 : DIV R5, R3, R4 R5 ← R3 / R4 I2 : ADD R2, R5, R2 R2 ← R5 + R2 I3 : SUB R5, R2, R6 R5 ← R2 – R6
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. c = a + b; d = c * a; e = c + a; x = c * c; if (x > a) {     y = a * a; } else {      d = d * d;      e = e * e; } Suppose the instruction set architecture of the processor has only two registers. The only allowed compiler optimization is code motion, which moves statements from one place to another while preserving correctness. What is the minimum number of spills to memory in the compiled code? 
interface Base{ boolean m1 (); byte m2(short s);}

which two code fragments will compile?
1. interface Base2 implements Base {}2. abstract class Class2 extends Base { public boolean m1(){ return true; }}3. abstract class Class2 implements Base {}4. abstract class Class2 implements Base { public boolean m1(){ return (7 > 4); }}5. abstract class Class2 implements Base { protected boolean m1(){ return (5 > 7) }}
Consider the following implementation as a solution to the critical section problem for two processes P0 and P1 with id 0 and 1, respectively. int flag [2] = {0, 0}; int turn = 0 ; void lock (int id)  /*id = 0 or 1 */ { turn = id ^ 1; /*S1*/ flag [id] = 1; /*S2*/ /* '^' is the bitwise XOR* / while (flag [id ^ 1] ) && turn == (id ^ 1)) ; } void unlock (int id) { flag[id] = 0 ; } Which of the following statements are correct?
Which fields are contained within an IEEE Ethernet frame header?
1. Source and destination MAC address
2. Source and destination network address
3. Source and destination MAC address and source and destination network address
4. FCS field
Read the instructions below and answer the questions that follow: P + Q means “some P are Q”. P – Q means “all P are Q”. P * Q means “no P is Q”. Now, statements below are followed by two conclusions. You have to take the given statements to be true even if they seem to be at variance from commonly known facts. Read all the conclusions and then decide which of the given conclusions logically follows from the given statements disregarding commonly known facts. Statements: Apple * flag Flag + team Team + goat Goat – ball Conclusions: I. Flag + ball II. Team * apple
The type of operand that is not allowed to use in boolean instructions of 8051 is
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. c = a + b; d = c * a; e = c + a; x = c * c; if (x > a) {     y = a * a; } else {      d = d * d;      e = e * e; } What is the minimum number of registers needed in the instruction set architecture of the processor to compile this code segment without any spill to memory? Do not apply any optimization other than optimizing register allocation.
The instruction that is used to transfer the data from source operand to destination operand is