Question
a.
Least significant position
b.
Middle significant position
c.
Registry
d.
Most significant position
Posted under Computer Architecture
Engage with the Community - Add Your Comment
Confused About the Answer? Ask for Details Here.
Know the Explanation? Add it Here.
Q. Big Endian byte order putting the byte having address
Similar Questions
Discover Related MCQs
Q. Width of object like a double-word will be having a size of
View solution
Q. Whenever a memory location is used, then the actual memory address specified through the addressing mode, is called the
View solution
Q. Regs[R4] ? Regs[R4]+ Regs[R3]; the given statement represents the
View solution
Q. Modern compiler technology with its ability to effectively using larger numbers of
View solution
Q. If we have single memory address then the numbers of operands allowed maximum, would be
View solution
Q. A GPR computer having memory to memory operations can easily be ignored by the compiler and is used as a
View solution
Q. The example/s of general-purpose RISC architectures is/are
View solution
Q. Mem[Regs[R1]]; referring the memory location contents, the address of this memory location is specified by the contents of
View solution
Q. The operands working in the stack-architecture are implicitly
View solution
Q. Architecture accessing memory only with the load instruction and the store instructions, is called
View solution
Q. One class accessing memory as being part of any instruction, is called
View solution
Q. For enhancement of the Pentium 4;soultion adopted was
View solution
Q. In the four control inputs of MIPS ALU the ADD function has Control lines of
View solution
Q. If the control store has space and new instructions are free of cost; the given statement defines the
View solution
Q. Invoking the operating system of the PC from user program is the type of
View solution
Q. When signals can be read and written is known as
View solution
Q. For moving string instruction from the register to the memory ,the command used is
View solution
Q. The CPI (Clock per instruction) is given by the following formula:
View solution
Q. Undefined instruction can be handled by defining the next-state value, for every op value other than
View solution
Q. In the multi-cycle data-path with exception handled, the clock cycle has
View solution
Suggested Topics
Are you eager to expand your knowledge beyond Computer Architecture? We've curated a selection of related categories that you might find intriguing.
Click on the categories below to discover a wealth of MCQs and enrich your understanding of Computer Science. Happy exploring!