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

throughput

GATE CSE & IT · Pipelining · 1999-2026

9
PYQs
67%
keyed
0
elite explanations
7
years appeared

Study anchor

Morris Mano / Patterson-Hennessy

Digital logic, datapath, memory hierarchy, instruction sets

Practice action

Start latest PYQ

PYQs in this concept

All concepts →
2026 PYQ

Consider a file of size 4 million bytes being transferred between two hosts connected via a path consisting of three consecutive links of bandwidth $2 \mathrm{Mbps}, 500 \mathrm{kb...

easyanswer keybasic explanation
2022 PYQ

Which one of the following facilitates transfer of bulk data from hard disk to main memory with the highest throughput?

easyanswer keybasic explanation
2021 PYQ

Consider a network using the pure ALOHA medium access control protocol, where each frame is of length 1,000 bits. The channel transmission rate is 1 Mbps (= 10 6 bits per second)....

mediumbasic explanation
2016 PYQ

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

easy
2016 PYQ

A sender uses the Stop-and-Wait ARQ protocol for reliable transmission of frames. Frames are of size 1000 bytes and the transmission rate at the sender is 80 Kbps (1Kbps = 1000 bit...

medium
2003 PYQ

Host A is sending data to host B over a full duplex link. A and B are using the sliding window protocol for flow control. The send and receive window sizes are 5 packets each. Data...

mediumanswer key
2003 PYQ

Using a larger block size in a fixed block size file system leads to

easyanswer key
2001 PYQ

Consider a set of $$n$$ tasks with known runtimes $${r_1},{r_2},.....\,{r_n}\,\,$$ to be run on a uniprocessor machine. Which of the following processor scheduling algorithms will...

easyanswer keybasic explanation
1999 PYQ

Which of the following disk scheduling strategies is likely to give the best throughput?

easyanswer key