adplus-dvertising
frame-decoration

Question

In a vectored interrupt

a.

the branch address is assigned to a fixed location in memory

b.

the interrupting source supplies the branch information to the processor through an interrupt vector

c.

the branch address is obtained from a register in the processor

d.

none of the above

Answer: (b).the interrupting source supplies the branch information to the processor through an interrupt vector

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. In a vectored interrupt

Similar Questions

Discover Related MCQs

Q. An instruction pipeline can be implemented by means of

Q. A microprogram sequencer

Q. Status bit is also called

Q. If the value V(x) of the target operand is contained in the address field itself, the addressing mode is

Q. The instructions which copy information from one location to another either in the processor’s internal register set or in the external main memory are called

Q. Content of the program counter is added to the address part of the instruction in order to obtain the effective address is called

Q. Which of the following interrupt is non maskable

Q. In which addressing mode the operand is given explicitly in the instruction?

Q. To load and store instructions of vector architectures, the unit used is

Q. The most essential source of overhead, when gets ignored by the chime model is vector

Q. The highest bandwidth of memory for moving the ridge point in the Corei7 from 2.6 to

Q. The median vectorization getting improved from about 70% to about

Q. Loops when gets vectored then they do not have dependences among iterations of a loop, which are called

Q. Around 82% issues of the clock-cycle, have them between 29 to 32 out of the

Q. The length of a vector operation in a real program is often

Q. The processor of the system, which can read/write GPU Memory, is known as

Q. The L1 data caches has a size between

Q. A solution of the problem for representing parallelism in an algorithm is

Q. The primary and essential mechanism to support the sparse matrices is

Q. In later iterations, data accesses are dependent on the values of data produced in earlier iterations; this dependence is called a