GATE||COA|| Pipelining and Secondary Memory || Pyqs (2010 to 2025 )

Last Updated :
Discuss
Comments

Question 1

The width of the physical address on a machine is 40 bits. The width of the tag field in a 512 KB 8-way set associative cache is _________ bits.
[GATE 2016 || SET-2 NAT || 2 marks]

  • 24

Question 2

An application loads 100 libraries at start-up. Loading each library requires exactly one disk access. The seek time of the disk to a random location is given as 10 ms. Rotational speed of disk is 6000 rpm. If all 100 libraries are loaded from random locations on the disk, how long does it take to load all libraries? (The time to transfer data from the disk block once the head has been positioned at the start of the block may be neglected)
[GATE 2011 || MCQ || 2-mark]

  • 0.50 s

  • 1.50 s

  • 1.25 s

  • 1.00 s

Question 3

An instruction pipeline has five stages, namely:

  1. Instruction Fetch (IF) – latency = 1 ns
  2. Instruction Decode and Register Fetch (ID/RF) – latency = 2.2 ns
  3. Instruction Execution (EX) – latency = 2 ns
  4. Memory Access (MEM) – latency = 1 ns
  5. Register Write Back (WB) – latency = 0.75 ns

(ns stands for nanoseconds).

To gain in terms of frequency, the designers have decided to:

  • Split the ID/RF stage into three stages (ID, RF1, RF2) each of latency:

2.2/3 ns ≈ 0.73ns

  • Split the EX stage into two stages (EX1, EX2) each of latency 1 ns.

Thus, the new design has a total of 8 pipeline stages.

A program has 20% branch instructions, which execute in the EX stage and produce the next instruction pointer:

  • At the end of the EX stage in the old design.
  • At the end of the EX2 stage in the new design.

The IF stage stalls after fetching a branch instruction until the next instruction pointer is computed.

  • All instructions other than branch instructions have an average CPI = 1 in both designs.
  • The execution times of this program on the old and the new design are P and Q nanoseconds, respectively.

The value of  Q/P​ = ?
[GATE 2014 || SET-3 MCQ || 2 marks]

  • 1.54

  • 1.55

  • 1.56

  • 1.57

Question 4

A computer system has an L1 cache, an L2 cache, and a main memory unit connected as shown below:

  • Block size in L1 cache: 4 words
  • Block size in L2 cache: 16 words
  • Memory access times:
    • L1 cache: 2 nanoseconds
    • L2 cache: 20 nanoseconds
    • Main memory: 200 nanoseconds
Screenshot-2025-08-20-150719

If there is a miss in the L1 cache and a hit in the L2 cache, a block is transferred from the L2 cache to the L1 cache.

What is the time taken for this transfer?
[GATE 2010 || MCQ || 2 marks]


  • 222nanoseconds

  • 888nanoseconds

  • 902 nanoseconds

  • 968nanoseconds

Question 5

An 8 KB direct-mapped write-back cache is organized as multiple blocks, each of size 32 bytes. The processor generates 32-bit addresses.

The cache controller maintains the tag information for each cache block, which includes:

  1. 1 Valid bit
  2. 1 Modified (dirty) bit
  3. As many tag bits as required to uniquely identify the memory block mapped to the cache
    What is the total size of memory needed at the cache controller to store meta-data (tags) for the cache?
    [GATE 2011 || MCQ || 2 marks]
  • A. 4864bits

  • B. 6144bits

  • C. 6656bits

  • D. 5376bits

Question 6

A computer has a 256 KByte, 4-way set associative, write-back data cache with a block size of 32 Bytes. The processor sends 32-bit addresses to the cache controller. Each cache tag directory entry contains, in addition to the address tag, 2 valid bits, 1 modified bit, and 1 replacement bit.
What is the number of bits in the tag field of an address?
[GATE 2012 || MCQ || 2 marks]

  • 160Kbits

  • 136Kbits


  • 40Kbits

  • 32Kbits


Question 7

A computer has a 256 KByte, 4-way set associative, write-back data cache with a block size of 32 Bytes. The processor sends 32-bit addresses to the cache controller. Each cache tag directory entry contains, in addition to the address tag, 2 valid bits, 1 modified bit, and 1 replacement bit.

The number of bits in the tag field of an address is _________.
[GATE 2012|| MCQ || 2 marks]

  • 11

  • 14

  • 16

  • 27

Question 8

A RAM chip has a capacity of 1024 words of 8 bits each (1K × 8).
The number of 2 × 4 decoders with enable line needed to construct a 16K × 16 RAM from 1K × 8 RAM is ___ .
[GATE 2013 || MCQ || 2 marks]

  • 4

  • 5


  • 6

  • 7


Question 9

In a k-way set associative cache, the cache is divided into v sets, each of which consists of k lines. The lines of a set are replaced in sequence one after another. The lines in set s are sequenced before the lines in set (s+1). The main memory blocks are numbered 0 onwards. The main memory block numbered j must be mapped to any one of the cache lines from
[GATE 2013|| MCQ || 1 marks]



  • (j mod v) * k to (j mod v) * k + (k – 1)

  • (j mod v) to (j mod v) + (k – 1)

  • (j mod k) to (j mod k) + (v – 1)

  • (j mod k) * v to (j mod k) * v + (v – 1)

Question 10

If the associativity of a processor cache is doubled while keeping the capacity and block size unchanged, which one of the following is guaranteed to be NOT affected?
[GATE 2014|| SET-2 MCQ || 2 marks]


  • Width of tag comparator

  • Width of set index decoder

  • Width of way selection multiplexor


  • Width of processor to main memory data bus

There are 56 questions to complete.

Take a part in the ongoing discussion