Skip to content
Early access — you're among the first to try PYQLabs. Share feedback
Concept drill

Pipelining

GATE CSE & IT · Computer Architecture - Pipelining · 2000-2026

30
PYQs
67%
keyed
0
elite explanations
17
years appeared

Study anchor

Source-book anchor pending for this concept.

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2026 PYQ

Which one of the following dependencies among the register operands of different instructions can cause a data hazard in a pipelined processor?

easyanswer keybasic explanation
2026 PYQ

Which of the following statements is/are true with respect to the interaction of a web browser with a web server using HTTP 1.1?

mediumanswer keybasic explanation
2026 PYQ

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}$ denote...

mediumbasic explanation
2026 PYQ

A non-pipelined instruction execution unit that operates at 1.6 GHz clock takes an average of 5 clock cycles to complete the execution of an instruction. To improve the performance...

mediumbasic explanation
2025 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 nanoseconds. Assume that there...

mediumanswer key
2024 Q30

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 fol...

mediumanswer key
2024 Q31

An instruction format has the following structure: Instruction Number: Opcode destination reg, source reg-1, source reg-2 Consider the following sequence of instructions to be exec...

mediumanswer key
2024 Q58

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-s...

hardanswer key
2024 PYQ

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 fol...

mediumanswer keybasic explanation
2024 PYQ

Consider a network path P—Q—R between nodes P and R via router Q. Node P sends a file of size $10^6$ bytes to R via this path by splitting the file into chunks of $10^3$ bytes each...

mediumanswer keybasic explanation
2024 PYQ

An instruction format has the following structure: Instruction Number: Opcode destination reg, source reg-1, source reg-2 Consider the following sequence of instructions to be exec...

easyanswer keybasic explanation
2024 PYQ

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-s...

mediumbasic explanation
2023 PYQ

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, respectively. Assume that there is no o...

easybasic explanation
2023 PYQ

Suppose in a web browser, you click on the www.gate-2023.in URL. The browser cache is empty. The IP address for this URL is not cached in your local host, so a DNS lookup is trigge...

hardanswer keybasic explanation
2022 PYQ

A processor X 1 operating at 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 prog...

mediumbasic explanation
2021 PYQ

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, e...

hardbasic explanation
2020 PYQ

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. Overhea...

mediumbasic explanation
2016 PYQ

Suppose the functions $$F$$ and $$G$$ can be computed in $$5$$ and $$3$$ nanoseconds by functional units $${U_F}$$ and $${U_G},$$ respectively. Given two instances of $${U_F}$$ and...

medium
2015 PYQ

Consider the sequence of machine instructions given below: MUL R5, R0, R1 DIV R6, R2, R3 ADD R7, R5, R6 SUB R8, R7, R4 In the above sequence, $$R0$$ to $$R8$$ are general purpose r...

hard
2015 PYQ

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...

medium
2014 PYQ

Consider the following processors ($$ns$$ stands for nanoseconds). Assume that the pipeline registers have zero latency. $$P1:$$ Four-stage pipeline with stage latencies $$1$$ $$ns...

easyanswer key
2013 PYQ

Consider an instruction pipeline with five stages without any branch prediction: Fetch Instruction $$(FI),$$ Decode Instruction $$(DI),$$ Fetch Operand $$(FO),$$ Execute Instructio...

mediumanswer key
2012 PYQ

Consider a source computer (S) transmitting a file of size 10 6 bits to a destination computer (D) over a network of two routers (R 1 and R 2 ) and three links (L 1 , L 2 , and L 3...

mediumanswer key
2012 PYQ

Register renaming is done in pipelined processors

easyanswer key
2008 PYQ

For all delayed conditional branch instructions, irrespective of whether the condition evaluate true or false,

easyanswer key
2008 PYQ

Which of the following are NOT true in a pipelined processor? $$1.$$ Bypassing can handle all RAW hazards $$2.$$ Register renaming can eliminate all register carried WAR hazards $$...

mediumanswer key
2004 PYQ

A $$4$$-stage pipeline has the stage delays as $$150, 120,160$$ and $$140$$ nano seconds respectively. Registers that are used between the stages have a delay of $$5$$ nanoseconds...

easyanswer key
2003 PYQ

For a pipelined $$CPU$$ with a single $$ALU$$, consider the following situations $$1.\,\,\,\,\,$$ The $$j+1$$ instruction uses the result of the $$j$$-$$th$$ instruction as an oper...

easyanswer key
2002 PYQ

The performance of a pipelined processor suffers if

easyanswer key
2000 PYQ

Comparing the time $$T1$$ taken for a single instruction on a pipelined $$CPU$$ with time $$T2$$ taken on a non-pipelined but identical $$CPU,$$ we can say that

easyanswer key