Crack
GATE
C
G
Topic
Computer Organization and Architecture
71 questions
0
/ 71 done
Questions per paper
All
MCQ
MSQ
NAT
2015 to 2026. Point at a year to read it.
0
1
2
3
4
5
6
2015
2019
2021
2023
2025
2026
Show as a table
Year
All
MCQ
MSQ
NAT
2015
3.3
1.3
0
2
2018
0
0
0
0
2019
3
2
0
1
2020
6
3
0
3
2021
4
0.5
0.5
3
2022
5
1
2
2
2023
5
2
0
3
2024
6
1
1.5
3.5
2025
5
2
1
2
2026
6
3
1
2
1
CS 2026 Set 1 · 1 mark · MCQ · Easy
Match each addressing mode in
List I
with a data element or an element of a data structure (in a high-level language) in
List II
:
2
CS 2026 Set 1 · 1 mark · MCQ · Easy
Consider a processor
P
P
P
whose instruction set architecture is the load-store architecture. The instruction format is such that the first operand of any instruction is the destination operand.
3
CS 2026 Set 1 · 1 mark · MCQ · Easy
Which one of the following dependencies among the register operands of different instructions can cause a data hazard in a pipelined processor?
4
CS 2026 Set 1 · 2 marks · MCQ · Moderate
The size of the physical address space of a processor is
2
32
2^{32}
2
32
bytes. The capacity of a cache memory unit is
2
23
2^{23}
2
23
bytes. The cache block size is 128 bytes. The cache memory unit can be built as a direct mapped cache or as a
K
K
K
-way set-associative cache, where
K
=
2
L
K = 2^L
K
=
2
L
and
L
∈
{
1
,
2
,
3
}
L \in \{1, 2, 3\}
L
∈
{
1
,
2
,
3
}
. Let the length of the TAG field be
M
M
M
bits for the direct mapped cache, and
N
N
N
bits for the set-associative cache.
5
CS 2026 Set 1 · 2 marks · MSQ · Moderate
Consider a system that has a cache memory unit and a memory management unit (MMU). The address input to the cache memory is a physical address. The MMU has a translation lookaside buffer (TLB). Assume that when a page is evicted from the main memory, the corresponding blocks in the cache are marked as invalid.
6
CS 2026 Set 1 · 2 marks · NAT · Hard
Consider a hard disk with a rotational speed of
15000
r
p
m
15000\,\mathrm{rpm}
15000
rpm
. The time to move the read/write head from a track to its adjacent track is
1
m
i
l
l
i
s
e
c
o
n
d
1\,\mathrm{millisecond}
1
millisecond
. Initially, the head is on track
0
0
0
. The number of sectors per track is
400
400
400
. The sector size is
1024
b
y
t
e
s
1024\,\mathrm{bytes}
1024
bytes
. It is necessary to transfer data from
10
10
10
randomly located sectors in each of the following tracks in the order:
5
5
5
,
12
12
12
and
7
7
7
.
7
CS 2026 Set 1 · 2 marks · NAT · Moderate
The EX stage of a pipelined processor performs the memory read operations for LOAD instructions, and the operations for the arithmetic and logic instructions. Let
t
E
X
t_{EX}
t
E
X
denote the time taken by the EX stage to perform the operation for an instruction. For each instruction type, the values of
t
E
X
t_{EX}
t
E
X
and
M
M
M
(the number of instructions of that type in a sequence of
100
100
100
instructions for a program P), are given in the table below.
8
CS 2026 Set 2 · 1 mark · MCQ · Moderate
Consider the following two statements about interrupt handling mechanisms in a CPU.
9
CS 2026 Set 2 · 2 marks · MCQ · Moderate
Consider a processor that has 16 general purpose registers and it uses 2-byte instruction format for all its instructions. Variable-sized opcodes are permitted. There are three different types of instructions; M-type, R-type, and C-type. Each M-type instruction has 2 register operands and a 6-bit immediate operand. Each R-type instruction has 3 register operands. Each C-type instruction has a register operand and a 6-bit offset value. If there are 2 unique M-type opcodes and 7 unique R-type opcodes, which one of the following options gives the maximum number of unique opcodes possible for C-type instructions?
10
CS 2026 Set 2 · 2 marks · MSQ · Hard
Consider a system with a processor and a
4
K
B
4\,\mathrm{KB}
4
KB
direct mapped cache with block size of
16
16
16
bytes. The system has a
16
M
B
16\,\mathrm{MB}
16
MB
physical memory. Four words
P
\mathrm{P}
P
,
Q
\mathrm{Q}
Q
,
R
\mathrm{R}
R
, and
S
\mathrm{S}
S
are accessed by the processor in the same order
10
10
10
times. That is, there are a total of
40
40
40
memory references in the sequence
P
,
Q
,
R
,
S
,
P
,
Q
,
R
,
S
,
…
\mathrm{P}, \mathrm{Q}, \mathrm{R}, \mathrm{S}, \mathrm{P}, \mathrm{Q}, \mathrm{R}, \mathrm{S}, \dots
P
,
Q
,
R
,
S
,
P
,
Q
,
R
,
S
,
…
11
CS 2026 Set 2 · 2 marks · NAT · Hard
Consider a system with
1
M
B
1\,\mathrm{MB}
1
MB
physical memory and a word length of
1
b
y
t
e
1\,\mathrm{byte}
1
byte
. The system uses a direct mapped cache, with block numbers starting from
0
0
0
. The word with physical address
0
x
A
2
C
28
0\mathrm{xA2C28}
0
xA2C28
is mapped to the cache block number
176
10
176_{10}
17
6
10
. The maximum possible size of the cache (in
K
B
\mathrm{KB}
KB
) for this configuration is _____.
(answer in integer)
12
CS 2026 Set 2 · 2 marks · NAT · Moderate
A non-pipelined instruction execution unit that operates at
1.6
G
H
z
1.6\,\mathrm{GHz}
1.6
GHz
clock takes an average of
5
5
5
clock cycles to complete the execution of an instruction. To improve the performance, the system was pipelined with a goal of achieving an average throughput of one instruction per clock cycle. However, it could operate only at
1.2
G
H
z
1.2\,\mathrm{GHz}
1.2
GHz
due to pipeline overheads. While executing a program in the pipelined design,
30
%
30\%
30%
of instructions encountered a stall of
2
2
2
cycles due to pipeline hazards. The speed-up obtained by the pipelined design over the non-pipelined one for this program is ________. (rounded off to two decimal places)
13
CS 2025 Set 1 · 1 mark · MCQ · Easy
Suppose a program is running on a non-pipelined single processor computer system. The computer is connected to an external device that can interrupt the processor asynchronously. The processor needs to execute the interrupt service routine (ISR) to serve this interrupt. The following steps (not necessarily in order) are taken by the processor when the interrupt arrives:
14
CS 2025 Set 1 · 1 mark · MSQ · Moderate
A partial data path of a processor is given in the figure, where RA, RB, and RZ are 32-bit registers. Which option(s) is/are CORRECT related to arithmetic operations using the data path as shown?
15
CS 2025 Set 1 · 2 marks · MCQ · Moderate
Consider a memory system with
1
M
1\,\mathrm{M}
1
M
bytes of main memory and
16
K
16\,\mathrm{K}
16
K
bytes of cache memory. Assume that the processor generates
20
20
20
-bit memory address, and the cache block size is
16
b
y
t
e
s
16\,\mathrm{bytes}
16
bytes
. If the cache uses direct mapping, how many bits will be required to store all the
t
a
g
tag
t
a
g
values? [Assume memory is byte addressable,
1
K
=
2
10
1\,\mathrm{K}=2^{10}
1
K
=
2
10
,
1
M
=
2
20
1\,\mathrm{M}=2^{20}
1
M
=
2
20
.]
16
CS 2025 Set 1 · 2 marks · MCQ · Easy
A processor has
64
64
64
general-purpose registers and
50
50
50
distinct instruction types. An instruction is encoded in
32
32
32
-bits. What is the maximum number of bits that can be used to store the immediate operand for the given instruction?
17
CS 2025 Set 1 · 2 marks · NAT · Moderate
A computer has a memory hierarchy consisting of two-level cache (L1 and L2) and a main memory. If the processor needs to access data from memory, it first looks into L1 cache. If the data is not found in L1 cache, it goes to L2 cache. If it fails to get the data from L2 cache, it goes to main memory, where the data is definitely available.
Hit rates
and
access times
of various memory units are shown in the figure. The
average memory access time
in nanoseconds (
n
s
\mathrm{ns}
ns
) is ____ (rounded off to two decimal places)
18
CS 2025 Set 2 · 1 mark · MSQ · Easy
Which of the following is/are part of an Instruction Set Architecture of a processor?
19
CS 2025 Set 2 · 2 marks · MCQ · Easy
For a direct-mapped cache, 4 bits are used for the tag field and 12 bits are used to index into a cache block. The size of each cache block is one byte. Assume that there is no other information stored for each cache block.
20
CS 2025 Set 2 · 2 marks · NAT · Moderate
Given a computing system with two levels of cache (L1 and L2) and a main memory. The first level (L1) cache access time is
1
n
s
1\,\mathrm{ns}
1
ns
and the "hit rate" for L1 cache is
90
%
90\%
90%
while the processor is accessing the data from L1 cache. Whereas, for the second level (L2) cache, the "hit rate" is
80
%
80\%
80%
and the "miss penalty" for transferring data from L2 cache to L1 cache is
10
n
s
10\,\mathrm{ns}
10
ns
. The "miss penalty" for the data to be transferred from main memory to L2 cache is
100
n
s
100\,\mathrm{ns}
100
ns
.
21
CS 2025 Set 2 · 2 marks · NAT · Moderate
respectively, in nanoseconds. The delay of an inter-stage latch is
10
10
10
nanoseconds. Assume that there are no pipeline stalls due to branches and other hazards. The time taken to process
1000
1000
1000
instructions in microseconds is _____ (rounded off to two decimal places)
22
CS 2025 Set 2 · 2 marks · NAT · Moderate
An application executes
6.4
×
10
8
6.4 \times 10^8
6.4
×
1
0
8
number of instructions in
6.3
6.3
6.3
seconds. There are four types of instructions, the details of which are given in the table. The duration of a clock cycle in nanoseconds is _____ (rounded off to one decimal place)
23
CS 2024 Set 1 · 1 mark · MCQ · Moderate
Which one of the following statements is FALSE?
24
CS 2024 Set 1 · 1 mark · MSQ · Moderate
Consider a 5-stage pipelined processor with Instruction Fetch (IF), Instruction Decode (ID), Execute (EX), Memory Access (MEM), and Register Writeback (WB) stages. Which of the following statements about forwarding is/are CORRECT?
25
CS 2024 Set 1 · 2 marks · MSQ · Moderate
Consider two set-associative cache memory architectures: WBC, which uses the write back policy, and WTC, which uses the write through policy. Both of them use the LRU (Least Recently Used) block replacement policy. The cache memory is connected to the main memory. Which of the following statements is/are TRUE?
26
CS 2024 Set 1 · 2 marks · NAT · Easy
Consider a
512
G
B
512\,\mathrm{GB}
512
GB
hard disk with
32
32
32
storage surfaces. There are
4096
4096
4096
sectors per track and each sector holds
1024
1024
1024
bytes of data. The number of cylinders in the hard disk is ____.
27
CS 2024 Set 1 · 2 marks · NAT · Moderate
The baseline execution time of a program on a
2
G
H
z
2\,\mathrm{GHz}
2
GHz
single core machine is
100
100
100
nanoseconds (
n
s
ns
n
s
). The code corresponding to
90
%
90\%
90%
of the execution time can be fully parallelized. The overhead for using an additional core is
10
n
s
10\,ns
10
n
s
when running on a multicore system. Assume that all cores in the multicore system run their share of the parallelized code for an equal amount of time.
28
CS 2024 Set 1 · 2 marks · NAT · Moderate
A given program has
25
%
25\%
25%
load/store instructions. Suppose the ideal CPI (cycles per instruction) without any memory stalls is
2
2
2
. The program exhibits
2
%
2\%
2%
miss rate on instruction cache and
8
%
8\%
8%
miss rate on data cache. The miss penalty is
100
100
100
cycles. The speedup (rounded off to two decimal places) achieved with a perfect cache (i.e., with NO data or instruction cache misses) is ____.
29
CS 2024 Set 2 · 1 mark · MCQ · Easy
8 bytes in 1 cycle from a device to main memory through cycle stealing at regular intervals. Which one of the following is the data transfer rate (in bits per second) of the DMA controller if 1% of the processor cycles are used for DMA?
30
CS 2024 Set 2 · 1 mark · MSQ · Moderate
An instruction format has the following structure:
31
CS 2024 Set 2 · 2 marks · NAT · Moderate
Consider a disk with the following specifications: rotation speed of
6000
R
P
M
6000\,\mathrm{RPM}
6000
RPM
, average seek time of
5
m
i
l
l
i
s
e
c
o
n
d
s
5\,\mathrm{milliseconds}
5
milliseconds
,
500
500
500
sectors/track,
512
512
512
-byte sectors. A file has content stored in
3000
3000
3000
sectors located randomly on the disk. Assuming average rotational latency, the total time (in seconds, rounded off to
2
2
2
decimal places) to read the entire file from the disk is ____
32
CS 2024 Set 2 · 2 marks · NAT · Easy
A processor with 16 general purpose registers uses a 32-bit instruction format. The instruction format consists of an opcode field, an addressing mode field, two register operand fields, and a 16-bit scalar field. If 8 addressing modes are to be supported, the maximum number of unique opcodes possible for every addressing mode is ____
33
CS 2024 Set 2 · 2 marks · NAT · Moderate
A non-pipelined instruction execution unit operating at
2
G
H
z
2\,\mathrm{GHz}
2
GHz
takes an average of 6 cycles to execute an instruction of a program P. The unit is then redesigned to operate on a 5-stage pipeline at
2
G
H
z
2\,\mathrm{GHz}
2
GHz
. Assume that the ideal throughput of the pipelined unit is 1 instruction per cycle. In the execution of program P, 20% instructions incur an average of 2 cycles stall due to data hazards and 20% instructions incur an average of 3 cycles stall due to control hazards. The speedup (rounded off to one decimal place) obtained by the pipelined design over the non-pipelined design is ____
34
CS 2024 Set 2 · 2 marks · NAT · Moderate
A processor uses a 32-bit instruction format and supports byte-addressable memory access. The ISA of the processor has 150 distinct instructions. The instructions are equally divided into two types, namely R-type and I-type, whose formats are shown below.
35
CS 2023 · 1 mark · NAT · Easy
Consider a 3-stage pipelined processor having a delay of
10
n
s
10\,\mathrm{ns}
10
ns
(nanoseconds),
20
n
s
20\,\mathrm{ns}
20
ns
, and
14
n
s
14\,\mathrm{ns}
14
ns
, for the first, second, and the third stages, respectively. Assume that there is no other delay and the processor does not suffer from any pipeline hazards. Also assume that one instruction is fetched every cycle.
36
CS 2023 · 1 mark · NAT · Moderate
A keyboard connected to a computer is used at a rate of 1 keystroke per second. The computer system polls the keyboard every
10
m
s
10\,\mathrm{ms}
10
ms
(milli seconds) to check for a keystroke and consumes
100
μ
s
100\,\mu\mathrm{s}
100
μ
s
(micro seconds) for each poll. If it is determined after polling that a key has been pressed, the system consumes an additional
200
μ
s
200\,\mu\mathrm{s}
200
μ
s
to process the keystroke. Let
T
1
T_1
T
1
denote the fraction of a second spent in polling and processing a keystroke.
37
CS 2023 · 2 marks · MCQ · Moderate
Consider the given C-code and its corresponding assembly code, with a few operands U1–U4 being unknown. Some useful information as well as the semantics of each unique assembly instruction is annotated as inline comments in the code. The memory is byte-addressable.
38
CS 2023 · 2 marks · MCQ · Moderate
A 4 kilobyte (KB) byte-addressable memory is realized using four 1 KB memory blocks. Two input address lines (IA4 and IA3) are connected to the chip select (CS) port of these memory blocks through a decoder as shown in the figure. The remaining ten input address lines from IA11–IA0 are connected to the address port of these blocks. The chip select (CS) is active high.
39
CS 2023 · 2 marks · NAT · Moderate
An 8-way set associative cache of size
64
K
B
64\,\mathrm{KB}
64
KB
(
1
K
B
=
1024
1\,\mathrm{KB}=1024
1
KB
=
1024
bytes) is used in a system with 32-bit address. The address is sub-divided into TAG, INDEX, and BLOCK OFFSET.
40
CS 2022 · 1 mark · MCQ · Easy
Which one of the following facilitates transfer of bulk data from hard disk to main memory with the highest throughput?
41
CS 2022 · 1 mark · MSQ · Moderate
Let WB and WT be two set associative cache organizations that use LRU algorithm for cache block replacement. WB is a write back cache and WT is a write through cache. Which of the following statements is/are FALSE?
42
CS 2022 · 1 mark · NAT · Moderate
A cache memory that has a hit rate of
0.8
0.8
0.8
has an access latency
10
n
s
10\,\mathrm{ns}
10
ns
and miss penalty
100
n
s
100\,\mathrm{ns}
100
ns
. An optimization is done on the cache to reduce the miss rate. However, the optimization results in an increase of cache access latency to
15
n
s
15\,\mathrm{ns}
15
ns
, whereas the miss penalty is not affected. The minimum hit rate (rounded off to two decimal places) needed after the optimization such that it should not increase the average memory access time is ____.
43
CS 2022 · 2 marks · MSQ · Hard
Consider a system with
2
K
B
2\,\mathrm{KB}
2
KB
direct mapped data cache with a block size of
64
b
y
t
e
s
64\,\mathrm{bytes}
64
bytes
. The system has a physical address space of
64
K
B
64\,\mathrm{KB}
64
KB
and a word length of
16
16
16
bits. During the execution of a program, four data words P, Q, R, and S are accessed in that order
10
10
10
times (i.e., PQRSPQRS...). Hence, there are
40
40
40
accesses to data cache altogether. Assume that the data cache is initially empty and no other data words are accessed by the program. The addresses of the first bytes of P, Q, R, and S are
0
x
A
248
0\mathrm{xA248}
0
xA248
,
0
x
C
28
A
0\mathrm{xC28A}
0
xC28A
,
0
x
C
A
8
A
0\mathrm{xCA8A}
0
xCA8A
, and
0
x
A
262
0\mathrm{xA262}
0
xA262
, respectively. For the execution of the above program, which of the following statements is/are TRUE with respect to the data cache?
44
CS 2022 · 2 marks · NAT · Moderate
A processor
X
1
X_1
X
1
operating at
2
G
H
z
2\,\mathrm{GHz}
2
GHz
has a standard 5-stage RISC instruction pipeline having a base CPI (cycles per instruction) of one without any pipeline hazards. For a given program
P
P
P
that has
30
%
30\%
30%
branch instructions, control hazards incur 2 cycles stall for every branch. A new version of the processor
X
2
X_2
X
2
operating at same clock frequency has an additional branch predictor unit (BPU) that completely eliminates stalls for correctly predicted branches. There is neither any savings nor any additional stalls for wrong predictions. There are no structural hazards and data hazards for
X
1
X_1
X
1
and
X
2
X_2
X
2
. If the BPU has a prediction accuracy of
80
%
80\%
80%
, the speed up (rounded off to two decimal places) obtained by
X
2
X_2
X
2
over
X
1
X_1
X
1
in executing
P
P
P
is ____.
45
CS 2021 Set 1 · 1 mark · NAT · Moderate
Consider a computer system with a byte-addressable primary memory of size
2
32
2^{32}
2
32
bytes. Assume the computer system has a direct-mapped cache of size
32
K
B
32\,\mathrm{KB}
32
KB
(
1
K
B
=
2
10
b
y
t
e
s
1\,\mathrm{KB} = 2^{10}\,\mathrm{bytes}
1
KB
=
2
10
bytes
), and each cache block is of size 64 bytes.
46
CS 2021 Set 1 · 2 marks · NAT · Moderate
A five-stage pipeline has stage delays of 150, 120, 150, 160 and 140 nanoseconds. The registers that are used between the pipeline stages have a delay of 5 nanoseconds each.
47
CS 2021 Set 1 · 2 marks · NAT · Hard
Consider the following instruction sequence where registers R1, R2 and R3 are general purpose and
M
E
M
O
R
Y
[
X
]
\mathrm{MEMORY}[X]
MEMORY
[
X
]
denotes the content at the memory location
X
X
X
.
48
CS 2021 Set 2 · 1 mark · NAT · Moderate
Consider a set-associative cache of size
2
K
B
2\,\mathrm{KB}
2
KB
(
1
K
B
=
2
10
bytes
1\,\mathrm{KB} = 2^{10}\text{ bytes}
1
KB
=
2
10
bytes
) with cache block size of
64
64
64
bytes. Assume that the cache is byte-addressable and a
32
32
32
-bit address is used for accessing the cache. If the width of the tag field is
22
22
22
bits, the associativity of the cache is ____
49
CS 2021 Set 2 · 1 mark · NAT · Easy
Consider a computer system with DMA support. The DMA module is transferring one
8
8
8
-bit character in one CPU cycle from a device to memory through
cycle stealing
at regular intervals. Consider a
2
M
H
z
2\,\mathrm{MHz}
2
MHz
processor. If
0.5
%
0.5\%
0.5%
processor cycles are used for DMA, the data transfer rate of the device is ____ bits per second.
50
CS 2021 Set 2 · 2 marks · MCQ · Moderate
Assume a two-level inclusive cache hierarchy, L1 and L2, where L2 is the larger of the two. Consider the following statements.
51
CS 2021 Set 2 · 2 marks · MSQ · Moderate
If the numerical value of a 2-byte unsigned integer on a little endian computer is 255 more than that on a big endian computer, which of the following choices represent(s) the unsigned integer on a little endian computer?
52
CS 2021 Set 2 · 2 marks · NAT · Hard
Consider a pipelined processor with 5 stages, Instruction Fetch (IF), Instruction Decode (ID), Execute (EX), Memory Access (MEM), and Write Back (WB). Each stage of the pipeline, except the EX stage, takes one cycle. Assume that the ID stage merely decodes the instruction and the register read is performed in the EX stage. The EX stage takes one cycle for ADD instruction and two cycles for MUL instruction. Ignore pipeline register latencies.
53
CS 2020 · 1 mark · MCQ · Moderate
Consider the following statements.
54
CS 2020 · 1 mark · MCQ · Moderate
Consider the following data path diagram.
55
CS 2020 · 1 mark · NAT · Moderate
A direct mapped cache memory of
1
M
B
1\,\mathrm{MB}
1
MB
has a block size of
256
b
y
t
e
s
256\,\mathrm{bytes}
256
bytes
. The cache has an access time of
3
n
s
3\,\mathrm{ns}
3
ns
and a hit rate of
94
%
94\%
94%
. During a cache miss. it takes
20
n
s
20\,\mathrm{ns}
20
ns
to bring the first word of a block from the main memory, while each subsequent word takes
5
n
s
5\,\mathrm{ns}
5
ns
. The word size is
64
b
i
t
s
64\,\mathrm{bits}
64
bits
. The average memory access time in ns (round off to
1
1
1
decimal place) is _______.
56
CS 2020 · 2 marks · MCQ · Moderate
A computer system with a word length of
32
b
i
t
s
32\,\mathrm{bits}
32
bits
has a
16
M
B
16\,\mathrm{MB}
16
MB
byte-addressable main memory and a
64
K
B
64\,\mathrm{KB}
64
KB
, 4-way set associative cache memory with a block size of
256
b
y
t
e
s
256\,\mathrm{bytes}
256
bytes
. Consider the following four physical addresses represented in hexadecimal notation.
57
CS 2020 · 2 marks · NAT · Moderate
Consider a non-pipelined processor operating at
2.5
G
H
z
2.5\,\mathrm{GHz}
2.5
GHz
. It takes 5 clock cycles to complete an instruction. You are going to make a 5-stage pipeline out of this processor. Overheads associated with pipelining force you to operate the pipelined processor at
2
G
H
z
2\,\mathrm{GHz}
2
GHz
. In a given program, assume that
30
%
30\%
30%
are memory instructions,
60
%
60\%
60%
are ALU instructions and the rest are branch instructions.
5
%
5\%
5%
of the memory instructions cause stalls of 50 clock cycles each due to cache misses and
50
%
50\%
50%
of the branch instructions cause stalls of 2 cycles each. Assume that there are no stalls associated with the execution of ALU instructions. For this program, the speedup achieved by the pipelined processor over the non-pipelined processor (round off to 2 decimal places) is ____.
58
CS 2020 · 2 marks · NAT · Moderate
A processor has 64 registers and uses 16-bit instruction format. It has two types of instructions: I-type and R-type. Each I-type instruction contains an opcode, a register name, and a 4-bit immediate value. Each R-type instruction contains an opcode and two register names. If there are 8 distinct I-type opcodes, then the maximum number of distinct R-type opcodes is ____.
59
CS 2019 · 1 mark · MCQ · Easy
A certain processor uses a fully associative cache of size
16
k
B
16\,\mathrm{kB}
16
kB
. The cache block size is 16 bytes. Assume that the main memory is byte addressable and uses a 32-bit address. How many bits are required for the
T
a
g
Tag
T
a
g
and the
I
n
d
e
x
Index
I
n
d
e
x
fields respectively in the addresses generated by the processor?
60
CS 2019 · 1 mark · MCQ · Moderate
The chip select logic for a certain DRAM chip in a memory system design is shown below. Assume that the memory system has 16 address lines denoted by
A
15
A_{15}
A
15
to
A
0
A_0
A
0
. What is the range of addresses (in hexadecimal) of the memory system that can get enabled by the chip select (CS) signal?
61
CS 2019 · 2 marks · NAT · Moderate
A certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses a
60
-
M
H
z
60\text{-}\mathrm{MHz}
60
-
MHz
clock. To service a cache miss, the memory controller first takes 1 cycle to accept the starting address of the block, it then takes 3 cycles to fetch all the eight words of the block, and finally transmits the words of the requested block at the rate of 1 word per cycle. The maximum bandwidth for the memory system when the program running on the processor issues a series of read operations is ____
×
10
6
b
y
t
e
s
/
s
e
c
.
\times 10^6\,\mathrm{bytes/sec.}
×
1
0
6
bytes/sec.
62
CS 2015 Set 1 · 1 mark · MCQ · Moderate
For computers based on three-address instruction formats, each address field can be used to specify which of the following:
63
CS 2015 Set 1 · 2 marks · NAT · Moderate
Consider a disk pack with a seek time of
4
m
i
l
l
i
s
e
c
o
n
d
s
4\,\mathrm{milliseconds}
4
milliseconds
and rotational speed of
10000
10000
10000
rotations per minute (\mathrm{RPM}). It has
600
600
600
sectors per track and each sector can store
512
b
y
t
e
s
512\,\mathrm{bytes}
512
bytes
of data. Consider a file stored in the disk. The file contains
2000
2000
2000
sectors. Assume that every sector access necessitates a seek, and the average rotational latency for accessing each sector is half of the time for one complete rotation. The total time (in milliseconds) needed to read the entire file is _____.
64
CS 2015 Set 1 · 2 marks · NAT · Easy
Consider a non-pipelined processor with a clock rate of
2.5
g
i
g
a
h
e
r
t
z
2.5\,\mathrm{gigahertz}
2.5
gigahertz
and average cycles per instruction of four. The same processor is upgraded to a pipelined processor with five stages; but due to the internal pipeline delay, the clock speed is reduced to
2
g
i
g
a
h
e
r
t
z
2\,\mathrm{gigahertz}
2
gigahertz
. Assume that there are no stalls in the pipeline. The speed up achieved in this pipelined processor is ____.
65
CS 2015 Set 2 · 1 mark · NAT · Easy
Assume that for a certain processor, a read request takes
50
n
s
50\,\mathrm{ns}
50
ns
on a cache miss and
5
n
s
5\,\mathrm{ns}
5
ns
on a cache hit. Suppose while running a program, it was observed that
80
%
80\%
80%
of the processor's read requests result in a cache hit. The average read access time in nanoseconds is ____.
66
CS 2015 Set 2 · 2 marks · NAT · Moderate
Consider a typical disk that rotates at
15000
15000
15000
rotations per minute (
R
P
M
\mathrm{RPM}
RPM
) and has a transfer rate of
50
×
10
6
b
y
t
e
s
/
s
e
c
50 \times 10^6\,\mathrm{bytes/sec}
50
×
1
0
6
bytes/sec
. If the average seek time of the disk is twice the average rotational delay and the controller's transfer time is
10
10
10
times the disk transfer time, the average time (in milliseconds) to read or write a
512
512
512
-byte sector of the disk is ____.
67
CS 2015 Set 2 · 2 marks · NAT · Moderate
Consider the sequence of machine instructions given below:
68
CS 2015 Set 2 · 2 marks · MCQ · Easy
Consider a processor with byte-addressable memory. Assume that all registers, including Program Counter (
P
C
\mathrm{PC}
PC
) and Program Status Word (
P
S
W
\mathrm{PSW}
PSW
), are of size
2
b
y
t
e
s
2\,\mathrm{bytes}
2
bytes
. A stack in the main memory is implemented from memory location
(
0100
)
16
(0100)_{16}
(
0100
)
16
and it grows upward. The stack pointer (
S
P
\mathrm{SP}
SP
) points to the top element of the stack. The current value of
S
P
\mathrm{SP}
SP
is
(
016
E
)
16
(016\mathrm{E})_{16}
(
016
E
)
16
. The
C
A
L
L
\mathrm{CALL}
CALL
instruction is of two words, the first word is the op-code and the second word is the starting address of the subroutine
(
o
n
e
w
o
r
d
=
2
b
y
t
e
s
)
(\mathrm{one\ word} = 2\,\mathrm{bytes})
(
one
word
=
2
bytes
)
. The
C
A
L
L
\mathrm{CALL}
CALL
instruction is implemented as follows:
69
CS 2015 Set 3 · 1 mark · MCQ · Moderate
Consider a machine with a byte addressable main memory of
2
20
2^{20}
2
20
bytes, block size of
16
16
16
bytes and a direct mapped cache having
2
12
2^{12}
2
12
cache lines. Let the addresses of two consecutive bytes in main memory be
(
E
201
F
)
16
(\mathrm{E201F})_{16}
(
E201F
)
16
and
(
E
2020
)
16
(\mathrm{E2020})_{16}
(
E2020
)
16
. What are the tag and cache line address (in hex) for main memory address
(
E
201
F
)
16
(\mathrm{E201F})_{16}
(
E201F
)
16
?
70
CS 2015 Set 3 · 2 marks · NAT · Moderate
Consider the following reservation table for a pipeline having three stages
S
1
,
S
2
S_1, S_2
S
1
,
S
2
and
S
3
S_3
S
3
.
71
CS 2015 Set 3 · 2 marks · MCQ · Moderate
Consider the following code sequence having five instructions
I
1
I_1
I
1
to
I
5
I_5
I
5
. Each of these instructions has the following format.