Computer Science · Computer Architecture
Which of the following statements about the space-time diagram and pipeline speedup are true? (A) Completing n tasks on a k-segment pipeline requires k + (n - 1) clock cycles. (B) For a non-pipelined unit, the total time required for n tasks is n × tn. (C) For a very large number of tasks (n), and when tn = k × tp, the speedup approaches k. Choose the correct answer:
- 1(A) and (B) only
- 2(B) and (C) only
- 3(A) and (C) only
- 4(A), (B) and (C)✓
Correct answer
(A), (B) and (C)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Preparing for Computer Science?
Practice full-length Computer Science mock tests with real exam timers, instant score analysis, and all-India ranking.
Want more practice questions on Computer Architecture?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Computer Architecture