Ratings are approximate, based on recurring patterns in past GATE CSE papers.
Previous year questions
15 real questions from the official GATE CSE papers (2012 to 2025), newest first, each with the official answer key and a worked solution. Questions are the property of the GATE organising institutes; this copy is for your personal study.
15 questions · 0 correct of 0 attempted · marks 0 / 26
Year:
GATE 2025 CS2 · Q56NAT2 marks
A 5-stage instruction pipeline has stage delays of 180, 250, 150, 170 and 250 ns respectively. The delay of an inter-stage latch is 10 ns. Assume there are no pipeline stalls due to branches and other hazards. The time taken to process 1000 instructions in microseconds is ______ (rounded off to two decimal places).
GATE 2024 CS1 · Q30MSQ1 mark
Consider a 5-stage pipelined processor with IF, ID, EX, MEM and WB stages. Which of the following statements about forwarding is/are CORRECT?
One or more options may be correct. Select all that apply, then submit.
GATE 2024 CS2 · Q31MSQ1 mark
An instruction format has the structure: Opcode destination reg, source reg-1, source reg-2. Consider the sequence in a pipelined processor: I1: DIV R3, R1, R2 I2: SUB R5, R3, R4 I3: ADD R3, R5, R6 I4: MUL R7, R3, R8. Which of the following statements is/are TRUE?
One or more options may be correct. Select all that apply, then submit.
GATE 2024 CS2 · Q58NAT2 marks
A non-pipelined instruction execution unit operating at 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 GHz. Assume the ideal throughput of the pipelined unit is 1 instruction per cycle. In the execution of P, 20% of instructions incur an average of 2 cycles stall due to data hazards and 20% 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 ______.
GATE 2023 · Q33NAT1 mark
Consider a 3-stage pipelined processor having a delay of 10 ns, 20 ns and 14 ns for the first, second and 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. The total execution time for executing 100 instructions on this processor is ______ ns.
GATE 2022 · Q61NAT2 marks
A processor X1 operating at 2 GHz has a standard 5-stage RISC instruction pipeline having a base CPI of one without any pipeline hazards. For a given program P that has 30% branch instructions, control hazards incur 2 cycles stall for every branch. A new version X2 operating at the 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 or data hazards for X1 and X2. If the BPU has a prediction accuracy of 80%, the speed up (rounded off to two decimal places) obtained by X2 over X1 in executing P is ______.
GATE 2021 Set 1 · Q53NAT2 marks
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. The total time to execute 100 independent instructions on this pipeline, assuming there are no pipeline stalls, is ______ nanoseconds.
GATE 2020 · Q43NAT2 marks
Consider a non-pipelined processor operating at 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 GHz. In a given program, assume that 30% are memory instructions, 60% are ALU instructions and the rest are branch instructions. 5% of the memory instructions cause stalls of 50 clock cycles each due to cache misses and 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 ______.
GATE 2018 · Q50NAT2 marks
The instruction pipeline of a RISC processor has the following stages: Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform Operation (PO) and Writeback (WB). The IF, ID, OF and WB stages take 1 clock cycle each for every instruction. Consider a sequence of 100 instructions. In the PO stage, 40 instructions take 3 clock cycles each, 35 instructions take 2 clock cycles each, and the remaining 25 instructions take 1 clock cycle each. Assume that there are no data hazards and no control hazards. The number of clock cycles required for completion of execution of the sequence of instructions is ______.
GATE 2017 Set 1 · Q50NAT2 marks
Instruction execution in a processor is divided into 5 stages: Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Execute (EX), and Write Back (WB). These stages take 5, 4, 20, 10 and 3 nanoseconds (ns) respectively. A pipelined implementation of the processor requires buffering between each pair of consecutive stages with a delay of 2 ns. Two pipelined implementations of the processor are contemplated: (i) a naive pipeline implementation (NP) with 5 stages and (ii) an efficient pipeline (EP) where the OF stage is divided into stages OF1 and OF2 with execution times of 12 ns and 8 ns respectively. The speedup (correct to two decimal places) achieved by EP over NP in executing 20 independent instructions with no hazards is ______.
GATE 2016 Set 1 · Q32NAT2 marks
The stage delays in a 4-stage pipeline are 800, 500, 400 and 300 picoseconds. The first stage (with delay 800 picoseconds) is replaced with a functionally equivalent design involving two stages with respective delays 600 and 350 picoseconds. The throughput increase of the pipeline is ______ percent.
GATE 2015 Set 1 · Q38NAT2 marks
Consider a non-pipelined processor with a clock rate of 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 gigahertz. Assume that there are no stalls in the pipeline. The speed up achieved in this pipelined processor is ______.
GATE 2014 Set 1 · Q43NAT2 marks
Consider a 6-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is executing on this 6-stage pipeline, the speedup achieved with respect to non-pipelined execution if 25% of the instructions incur 2 pipeline stall cycles is ______.
GATE 2013 Code A · Q45MCQ2 marks
Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction (FI), Decode Instruction (DI), Fetch Operand (FO), Execute Instruction (EI) and Write Operand (WO). The stage delays for FI, DI, FO, EI and WO are 5 ns, 7 ns, 10 ns, 8 ns and 6 ns, respectively. There are intermediate storage buffers after each stage and the delay of each buffer is 1 ns. A program consisting of 12 instructions I1, I2, I3, …, I12 is executed in this pipelined processor. Instruction I4 is the only branch instruction and its branch target is I9. If the branch is taken during the execution of this program, the time (in ns) needed to complete the program is
GATE 2012 Code A · Q20MCQ1 mark
Register renaming is done in pipelined processors
Extra practice (GATE-style)
More questions in the same formats, each with a full solution. These are original questions written to follow the patterns above, not past-paper questions.
6 questions · 0 correct of 0 attempted · marks 0 / 10
Q1NAT2 marks
A 5-stage pipeline has stage delays 150, 120, 160, 140 and 100 ps. Each pipeline register adds 10 ps. A non-pipelined version has no register overhead. For 1000 instructions with no hazards, the speedup of the pipeline (up to two decimals) is ____.
Q2MCQ2 marks
A 5-stage pipeline (IF, ID, EX, MEM, WB) with full operand forwarding runs: LW R1,0(R2); ADD R3,R1,R4; SUB R5,R3,R6; OR R7,R8,R9. The total number of cycles is
Q3NAT2 marks
No forwarding; the register file is written in the first half and read in the second half of a cycle. Code: ADD R1,R2,R3; SUB R4,R1,R5; AND R6,R4,R1. Total cycles to complete all three on a 5-stage pipeline is ____.
Q4MCQ1 mark
I1: ADD R1,R2,R3 and I2: SUB R2,R4,R5 execute in that order. The hazard between them is
Q5NAT2 marks
Base CPI is 1. 20% of instructions are branches, 60% of branches are taken, and a taken branch costs 3 stall cycles (not-taken branches cost 0). The effective CPI is ____.
Q6MCQ1 mark
For a k-stage pipeline processing a very large number of instructions with no stalls, the speedup approaches
Common traps
Non-pipelined time has no latch overhead; pipelined clock does.
A pipelined instruction still takes k cycles (latency unchanged).
Load-use stall remains even with full forwarding.
Always state the assumption on same-cycle register write/read when counting stalls.