adplus-dvertising
frame-decoration

Question

In the indirect addressing scheme, the second part of an instruction contains:

a.

the operand in decimal form

b.

the address of the location where the value of the operand is stored

c.

the address of the location where the address of the operand is stored

d.

the operand in an encoded form

Answer: (c).the address of the location where the address of the operand is stored

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In the indirect addressing scheme, the second part of an instruction contains:

Similar Questions

Discover Related MCQs

Q. Amdahl’s law states that the maximum speedup S achievable by a parallel computer with ‘p’ processors is given by:

Q. Amongst the logic families DTL, TTL, ECL and CMOS, the family with the least power dissipation is:

Q. The characteristic equation of the D flip-flop is:

Q. Which of the following logic is the fastest ?

Q. Which of the following logic has the maximum fan out ?

Q. The first operating system of Microprocessor is ...................

Q. A half-adder is also known as :

Q. When an inverter is placed between both inputs of an S-R flip flop, the resulting flip flop is:

Q. The Register or main memory location which contains the effective address of the operand is known as:

Q. Identify the logic function performed by the circuit shown

Q. When a tri-state logic device is in the third state, then:

Q. An example of a connective which is not associative is:

Q. Essential hazards may occur in:

Q. The characteristic equation of a T flip-flop is:

(A) Qn+1=TQ’n + T’ Qn              
(B) Qn+1=T+Qn
(C) Qn+1=TQn                   
(D) Qn+1= T’Q’n

The symbols used have the usual meaning.

Q. The maximum size of main memory of a computer is determined by:

Q. In computer terminology, POST stands for:

Q. IC 74 LS 138 is a:

Q. A hardware interface that allows for the connection of several peripheral devices to a single PCI board

Q. Simplified form of the Boolean expression Y=A’BC’D’+ABC’D’+A’BCD’+ABCD’ is:

Q. Which of the following statements are true?

(i) Every logic network is equivalent to one using just NAND gates or just NOR gates.
(ii) Boolean expressions and logic networks correspond to labelled acyclic diagraphs.
(iii) No two Boolean algebras with n atoms are isomorphic.
(iv) Non-zero elements of finite Boolean algebras are not uniquely expressible as joins of atoms.