GATE Computer Organization and Architecture: Instruction Pipelining and Pipeline Hazards – Previous Year Questions
33 GATE previous year questions on Instruction Pipelining and Pipeline Hazards (Computer Organization and Architecture, Computer Science) with answers and explanations, from every paper.
33 questions worth 60 marks in all (6 1-mark, 27 2-mark). Asked between 2007 and 2026, so you can see how the topic has been tested over time.
- GATE 2007 CS Q37 – A pipeline has IF, ID (decode/operand fetch), EX, WB. IF, ID, WB take1 cycle; ADD/SUB EX takes1, MUL EX takes3. Operand forwarding is available. How…
- GATE 2008 CS Q36 – Which statements are NOT true for a pipelined processor? I. Bypassing handles all RAW hazards. II. Register renaming eliminates all register-carried…
- GATE 2008 CS Q76 – Delayed branching handles control hazards. For all delayed conditional branches, irrespective of whether the condition is true or false,
- GATE 2008 CS Q77 – A pipelined processor has one branch delay slot. Which instruction can move into it without any other program modification?
- GATE 2009 CS Q28 – A four-stage pipeline requires the following cycles per instruction. How many cycles execute the loop? Instruction S1 S2 S3 S4 --- --- --- --- --- I1…
- GATE 2021 CS (CS2) Q63 – A five-stage pipeline has IF,ID,EX,MEM,WB. All stages take one cycle except EX: ADD takes one and MUL two. ID decodes and reads registers. Instruction…
- GATE 2015 CS (CS3) Q48 – A pipeline reservation table uses S1 at times 1 and 5, S2 at times 2 and 4, and S3 at time 3. Find its minimum average initiation latency.
- GATE 2015 CS (CS3) Q49 – Instructions have form OP Ri,Rj,Rk, writing Ri and reading Rj,Rk: S1: I2 and I5 have an anti-dependence. S2: I2 and I4 have an anti-dependence. S3: An…
- GATE 2015 CS (CS2) Q53 – A four-stage pipeline has IF (fetch/decode), OF (operand fetch), PO (perform operation), WB (writeback). IF,OF,WB take one cycle; PO takes one for…
- GATE 2010 CS Q43 – A pipeline has IF, ID, OF, PO and WO stages. IF, ID, OF and WO each take one cycle. PO takes one cycle for ADD/SUB, three for MUL and six for DIV.…
- GATE 2011 CS Q51 – Four pipeline stages take 5,6,11,8 ns. Registers between stages and after the last each add one ns. Under ideal steady-state conditions, find…
- GATE 2013 CS Q55 – A pipeline has FI,DI,FO,EI,WO stage delays 5,7,10,8,6 ns, with one-ns buffers after stages and no branch prediction. A twelve-instruction program has…
- GATE 2012 CS Q30 – Register renaming in pipelined processors is done
- GATE 2016 CS (CS2) Q40 – F takes 5 ns and G takes 3 ns on their functional units. Two instances of each unit are available. Ignoring other delays, find the minimum time for…
- GATE 2016 CS (CS2) Q43 – A 3 GHz three-stage pipeline has latencies 1=3 2/4=2 3. The longest stage is split into two equal stages. Ignoring register delay, find the new…
- GATE 2014 CS (CS3) Q19 – Pipeline registers have zero latency. Stage latencies (ns) are P1: 1,2,2,1; P2: 1,1.5,1.5,1.5; P3: 0.5,1,1,0.6,1; P4: 0.5,0.5,1,1,1.1. Which processor…
- GATE 2014 CS (CS3) Q53 – A five-stage instruction pipeline has stages IF, ID/RF, EX, MEM, WB with latencies 1,2.2,2,1,0.75 ns. ID/RF is split into ID,RF1,RF2, each 2.2/3 ns,…
- GATE 2014 CS (CS1) Q53 – A six-stage instruction pipeline has perfectly balanced stages and no cycle-time overhead. If 25% of instructions incur two pipeline stall cycles,…
- GATE 2017 CS (CS1) Q60 – Instruction execution in a processor is divided into 5 stages, Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Execute (EX), and…
- GATE 2016 CS (CS1) Q42 – 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…
- GATE 2015 CS (CS1) Q55 – 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…
- GATE 2018 CS Q60 – The instruction pipeline of a RISC processor has the following stages: Instruction Fetch (IF), Instruction Decode (ID), Operand Fetch (OF), Perform…
- GATE 2026 CS (CS2) Q57 – A non-pipelined instruction execution unit operating at 1.6 GHz takes an average of 5 clock cycles per instruction. A pipelined redesign could operate…
- GATE 2026 CS (CS1) Q16 – Which one of the following dependencies among the register operands of different instructions can cause a data hazard in a pipelined processor?
- GATE 2026 CS (CS1) Q60 – The EX stage of a pipelined processor performs the memory read operations for LOAD instructions, and the operations for the arithmetic and logic…
- GATE 2025 CS (CS2) Q56 – A 5-stage instruction pipeline has stage delays of 180, 250, 150, 170, and 250, respectively, in nanoseconds. The delay of an inter-stage latch is 10…
- GATE 2024 CS (CS2) Q31 – An instruction format has the structure: Instruction Number: Opcode destination reg, source reg-1, source reg-2. Consider the sequence: I1: DIV R3,…
- GATE 2024 CS (CS2) Q58 – A non-pipelined unit at 2 GHz takes an average of 6 cycles per instruction of program P. The unit is redesigned as a 5-stage pipeline at 2 GHz with…
- GATE 2024 CS (CS1) Q30 – Consider a 5-stage pipelined processor with Instruction Fetch (IF), Instruction Decode (ID), Execute (EX), Memory Access (MEM), and Register Writeback…
- GATE 2023 CS Q33 – Consider a 3-stage pipelined processor having a delay of 10 ns (nanoseconds), 20 ns, and 14 ns, for the first, second, and the third stages,…
- GATE 2022 CS Q61 – A processor X1 operating at 2 GHz has a standard 5-stage RISC instruction pipeline having a base CPI (cycles per instruction) of one without any…
- GATE 2021 CS (CS1) Q63 – 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…
- GATE 2020 CS Q53 – 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…