Q: 1 A processor performing fetch or decoding of different instruction during the execution of another instruction is called ___________.
Super-Scaling
Pipe-Lining
Parallel Computation
None of the above
[ Option B ]
Pipelining is a technique in which a processor overlaps multiple stages of instruction execution. While one instruction is being executed, another instruction can be fetched and a third one can be decoded at the same time.
This means different stages like Fetch → Decode → Execute are performed simultaneously for different instructions, increasing CPU efficiency.
Q: 2 Which of the following obeys immediate addressing mode in assembly language (R1 and R2 are registers)?
MOV R1,#35H
MOV R1,R2
ADD R1,[0301]
None of these
[ Option A ]
In assembly language, addressing mode specifies how the operand is provided to the instruction.
In Immediate Addressing Mode, the operand is a constant value that is directly given in the instruction itself. It is not stored in a register or memory location.
In instruction MOV R1, #35H, #35H represents a constant hexadecimal value (35H). The # symbol indicates that the value is immediate data. This is immediate addressing mode because the value is directly provided in the instruction.
Q: 3 Which of the following architecture is suitable for a wide range of data types?
IA-32
ARM
ASUS firebird
68000
[ Option A ]
IA-32 (Intel Architecture, 32-bit) is a widely used computer architecture known for its support of a wide range of data types such as bytes (8 bits), words (16 bits), double words (32 bits), and quad words (64 bits).
It defines various data sizes and supports complex instruction sets for handling these different types efficiently, making it versatile across many computing applications.
Q: 4 Consider a computer system with speed of 106 instructions per second. A program P, having 2n2 steps is run on this system, where n is the input size. If n=10000, what is the execution time for P?
2 sec
20 sec
100 sec
200 sec
[ Option D ]
Execution Time = (Number of Instructions) / (Instructions Per Second)
Number of instructions for program P= 2n2
Given, n=10000
Number of instructions = 2*(10000)2 = 2*108
Speed of computer is given as 106 instructions per second.
Execution Time = (2*108) / (106) = 200 seconds
Q: 5 To fetch data from the secondary memory which one of the following registers is used?
MAR
PC
IR
MBR
[ Option A ]
The Memory Address Register (MAR) is used to hold the address of the data that needs to be fetched from or stored to memory, including secondary memory locations during data transfer operations.
When the CPU wants to fetch data from secondary memory, it places the address of the required data in the MAR, which then facilitates the transfer via the system bus.
Q: 6 Zero address instruction format is used for ___________.
Von-Neumann Architecture
CISC Architecture
Stack-Organized Architecture
None of the above
[ Option C ]
A zero address instruction format means that the instruction does not explicitly specify any operands. Instead, all operations are performed using a stack, where operands are implicitly taken from the top of the stack.
In a stack-organized architecture, instructions like ADD automatically use the top elements of the stack, so no address fields are required.
Q: 7 Which of the interrupts are non-maskable?
RST 7.5
TRAP
RST 5.5
INTR
[ Option B ]
In microprocessors like 8085, interrupts can be maskable or non-maskable. A Non-Maskable Interrupt (NMI) cannot be disabled or ignored by the processor and has the highest priority.
TRAP is a non-maskable interrupt, meaning:
Q: 8 The process when processor fetch or decode another instruction during the execution of current instruction is called?
Supercomputing
Pipelining
Cloud Computing
Grid Computing
[ Option B ]
When the CPU starts fetching or decoding the next instruction while the current instruction is still executing, this overlapping process is called Pipelining. It helps the CPU work faster by using its time efficiently.
Q: 9 Which of the following registers is used to keep track of address of memory location where the next instruction is located?
Program Counter
Memory Address Register
Memory Data Register
Instruction Counters
[ Option A ]
The register that keeps track of the address of the next instruction to be executed is the Program Counter (PC). After one instruction is executed, the PC is automatically updated to point to the next instruction in memory.
Q: 10 The instructions like MOV or ADD are called as ___________.
Opcode
Operators
Operand
None of the above
[ Option A ]
In assembly language, instructions like MOV and ADD are called opcodes (Operation Codes). An opcode specifies what operation the processor has to perform, such as moving data or performing addition. An instruction generally has two parts:
The operator is general programming term.
Q: 11 Index register in a digital computer is used for?
Pointing to the stack address
Indirect addressing
Keeping track the number of times loop executed
Address modification
[ Option D ]
A Register is a very small and very fast memory unit inside the CPU. It is used to temporarily store data, instructions, addresses, or results while the CPU is working. Because registers are located inside the processor, the CPU can access them much faster than main memory (RAM).
An Index Register is a special-purpose register used mainly to modify the address of an operand during program execution. It is commonly used when accessing arrays, tables, or sequential data structures.
| REGISTER TYPE | DESCRIPTION |
|---|---|
| Accumulator (AC) | Stores intermediate results of arithmetic and logic operations. |
| Program Counter (PC) | Holds the address of the next instruction to be executed. |
| Instruction Register (IR) | Stores the instruction currently being executed. |
| Memory Address Register (MAR) | Stores the address of the memory location to be accessed. |
| Memory Data Register (MDR) | Stores data being transferred to or from memory. |
| General Purpose Register | Store temporary data and operands. |
| Index Register | Used to modify addresses, especially while accessing arrays. |
| Base Register | Holds the starting address of a program or data block |
| Stack Pointer (SP) | Points to the top of the stack. |
| Status / Flag Register | Stores condition flags such as Zero, Carry, and Overflow. |
Q: 12 Which Register holds the address of the next instruction to be executed?
Instruction Register
Accumulator
Program Counter
Data Register
[ Option C ]
The Program Counter (PC) is a special register in the CPU that stores the address of the next instruction to fetch and execute from memory.
After fetching the current instruction, the PC increments to point to the next instruction’s address unless modified by a jump or branch instruction.
This allows the CPU to execute the sequence of instructions in order and supports control flow changes.
Q: 13 A CPU generates 32-bit virtual addresses. The page size is 4 KB. The processor has a translation look-aside buffer (TLB) which can hold a total of 128-page table entries and is 4-way set associative. The minimum size of the TLB tag is:
13 bits
20 bits
11 bits
15 bits
[ Option D ]
The CPU generates 32-bit virtual addresses. Since the page size is 4 KB, this means each page contains 212 bytes. Therefore, the lower 12 bits of the virtual address are used as the page offset. The remaining bits represent the virtual page number (VPN). Hence, the number of VPN bits is 32-12=20 bits.
The Translation Look-Aside Buffer (TLB) can hold a total of 128 page table entries and is 4-way set associative. This means the TLB is divided into sets, with each set containing 4 entries. The total number of sets in the TLB is 128/4=32. Since 32=25, 5 bits are required to select a set.
The TLB tag is formed from the remaining bits of the virtual page number after removing the set index bits. Therefore, the size of the TLB tag is 20-5=15 bits.
Q: 14 If a processor clock is rated as 2500 million cycles per second, then its clock period is?
2.50*10-10 sec
4.00*10-10 sec
1.00*10-10 sec
None of these
[ Option B ]
Clock frequency = 2500 million cycles per second
= 2500*106 = 2.5*109 Hz
Clock period is the inverse of frequency:
Clock Period = 1/Clock Frequency
=1/2.5*109 = 0.4*10−9 = 4.0*10−10 sec
Number Scale Table:
| NAME | POWER OF 10 |
|---|---|
| Thousand | 103 |
| Million | 106 |
| Billion | 109 |
| Trillion | 1012 |
| Quadrillion | 1015 |
| Quintillion | 1018 |
Q: 15 The instruction fetch phase ends with _______________.
Placing the data from the address in MAR into MDR.
Placing the address of the data into MAR.
Completing the execution of the data and placing its storage address into MAR.
Decoding the data in MDR and placing it in IR.
[ Option D ]
The instruction fetch phase is the first step of the instruction cycle in a CPU. During this phase, the instruction is fetched from memory and prepared for execution.
During the instruction fetch phase, the address from the Program Counter (PC) is first transferred to the MAR, then the instruction is fetched from memory into the MDR, and finally it is transferred to the IR and decoded.
The fetch phase ends when the instruction is placed in the IR and decoded, making it ready for execution.
Q: 16 In Register direct addressing mode, data are accessed by,
specifying the register name in which they are stored.
specifying the memory location in which they are stored.
secondary storage.
specifying the data directly.
[ Option A ]
Register Direct Addressing Mode
So, in Register Direct Addressing Mode, data are accessed by specifying the register name in which they are stored.
Q: 17 Small fastest data holding unit in CPU is _________.
Cache
Register
Buffer
All of these
[ Option B ]
A Register is the smallest and fastest storage unit inside the CPU. Registers are located directly within the processor and are used to hold data, instructions, memory addresses, or intermediate results during execution.
Registers operate at the same speed as the CPU, which makes them significantly faster than cache and main memory. Because of their limited size and very high speed, they are used for immediate processing tasks.
Thank you so much for taking the time to read my Computer Science MCQs section carefully. Your support and interest mean a lot, and I truly appreciate you being part of this journey. Stay connected for more insights and updates! If you'd like to explore more tutorials and insights, check out my YouTube channel.
Don’t forget to subscribe and stay connected for future updates.