NEW
Font size
WorksheetsAddressing Modes Worksheet
Total questions: 60
Worksheet time: 20mins
In Immediate Addressing Mode, the operand is:
Stored in memory
Given directly in the instruction
Stored in a register
Stored in the accumulator
In Register Indirect Addressing, the operand is:
Given in the instruction
Stored in the accumulator
Found using the address contained in a register
Found in a specific memory address
Which addressing mode requires two memory accesses — one to fetch the address and one to fetch the operand?
Direct
Indirect
Register
Immediate
The instruction ADD R1, (R2) uses which addressing mode?
Immediate
Indirect
Register
Direct
If memory location 200 holds address 500, and memory[500] = 25, what will LOAD R1, (200) load into R1?
200
500
25
Undefined
In Direct Addressing, if instruction says LOAD R2, 300 and M[300]=45, R2= ?
0
45
300
90
The instruction MOV A, #5 is an example of:
Immediate Addressing
Register Addressing
Direct Addressing
Indirect Addressing
In Implicit Addressing, the operand:
Is mentioned in the instruction
Is known from the instruction context
Must be fetched from memory
Is always zero
During which phase of the instruction cycle is the instruction decoded?
Fetch
Decode
Execute
Store
The Program Counter (PC) is incremented during the:
Execute phase
Decode phase
Fetch phase
Store phase
The Instruction Register (IR) temporarily holds:
The next instruction address
The current instruction being executed
The operands
The program counter value
The Execute phase may involve:
Fetching an instruction
Incrementing PC
Performing arithmetic or logic operations
Decoding instruction
If instruction fetch requires 1 μs, decode 0.5 μs, execute 1.5 μs, and store 0.5 μs — total instruction cycle time = ?
2.0 μs
3.0 μs
3.5 μs
4.0 μs
If PC = 1200 before fetch, what is PC after fetching one instruction?
1199
1200
1201
1210
A zero-address instruction is most suitable for which architecture?
Stack-based
Accumulator-based
General register
Harvard
In a one-address instruction, one operand is assumed to be in:
Memory
Accumulator
The instruction MUL R1, R2 can belong to which format?
Zero address
One address
Two address
Three address
Three-address instructions are generally:
Shorter in size
Longer in size
Used only in CISC
Faster than one-address
How many addresses are needed for the instruction R3 = R1 + R2?
1
2
3
0
If an instruction has opcode 8 bits and 3 address fields of 12 bits each, total instruction size = ?
24 bits
32 bits
44 bits
44 (8+36)
A single accumulator organization uses:
Multiple registers
One special register
Stack
Cache
RISC architecture typically uses:
Variable instruction size
Fixed instruction size
Microprogrammed control unit
Complex addressing modes
CISC stands for:
Complex Instruction Set Computer
Compact Instruction Set Computer
Complete Instruction Sequential Control
Central Instruction Storage Computer
Which of the following is not a feature of RISC?
A) Fixed instruction length
B) Hardwired control
C) Fewer instructions
D) Complex addressing
If a RISC instruction takes 1 cycle and a CISC instruction takes 4 cycles but replaces 3 RISC instructions, which is faster for total of 12 operations?
RISC
CISC
Same speed
Depends on compiler
In Von Neumann architecture, instructions and data share:
Separate memories
Same memory
Different buses
Same CPU but separate memory
The Harvard architecture uses:
One bus for both data and instructions
Two separate buses
Cache only
Stack memory
A major disadvantage of Von Neumann architecture is:
Expensive design
Bottleneck issue
Slow arithmetic
Fixed memory size
The Harvard architecture is commonly used in:
A) PCs
B) Microcontrollers
C) Servers
D) Laptops
If instruction and data buses are separate, how many memory fetches occur simultaneously?
0
1
2
4
A shift register is primarily built using:
JK Flip-Flops
D Flip-Flops
T Flip-Flops
SR Flip-Flops
The main function of a shift register is:
Arithmetic operation
Shift and store data
Address decoding
Code conversion
A SISO shift register outputs data:
In parallel
Serially
Randomly
Simultaneously
In SIPO, data is input:
Serially
Parallel
Randomly
Multiplexed
If 4-bit SISO register input = 1010, what is serial output sequence?
0101
1010
1100
0000
A 4-bit SIPO receives input 1001. After 3 pulses, what is output?
0011
1100
001
100
In a PISO register, parallel input = 1011. What will be the serial output after one clock?
1
0
10
11
In a PIPO shift register, data is:
Loaded and output simultaneously
Loaded serially
Counters are made of which flip-flop?
D Flip-Flop
T Flip-Flop
JK Flip-Flop
SR Flip-Flop
In a 4-bit counter, how many states are possible?
8
16
10
4
A 3-bit synchronous counter counts from:
0-6
0-7
1-8
0-8
Minimum number of flip-flops for mod-10 counter = ?
3
4
5
10
A mod-6 counter counts up to decimal:
5
6
7
8
If 4-bit asynchronous counter output = 1111, next output (up count) = ?
0000
1110
0010
1000
In a synchronous counter, all flip-flops are:
Triggered by different clocks
Triggered by a common clock
Not clocked
Asynchronous
Ripple counter is also called:
Synchronous
Asynchronous
Parallel counter
Binary divider
Booth’s algorithm is used for:
Division
Signed binary multiplication
Logical AND
Bit shifting
Booth’s algorithm improves:
Division speed
Multiplication performance
Addition accuracy
Register storage
Multiply 3 × 2 (0011 × 0010) = ?
0100
0110
1100
1010
Multiply (-3) × (2) in 4-bit 2's complement → product = ?
1010
0110
0010
1000
The non-restoring division method avoids:
Repeated subtraction
Restoring step
Shifting
Comparison
Divide 8 ÷ 3 using non-restoring division → quotient = ?
0010
1000
0011
1110
In restoring division, when partial remainder < 0, we:
Continue
Add divisor
Subtract divisor
Skip
Booth algorithm is particularly efficient for:
Sparse 1’s
Consecutive 1’s
Random bits
All zeros
The IAS instruction length is:
32 bits
40 bits
64 bits
16 bits
If AC = 10, M(X) = 7, result of ADD M(X) → ?
7
17
10
3
The instruction STOR M(X) means:
Move memory → AC
Move AC → memory
Add values
Swap data
If AC = 12, M(X) = -5 → result of ADD |M(X)| = ?
17
-17
7
-7
The instruction LSH in IAS computer:
Shifts bits left by one
Shifts right
Divides by 2
Adds 1
If AC = 00001010, after LSH → AC = ?
00000101
00010100
00101000
11111111
