Parallel and Distributed Computing MCQ Practice

Question 1 of 10

A photo app must apply the same filter to 8 independent images. A setup step that loads filter settings takes 2 seconds and cannot be split. Each image filter takes 5 seconds on one core.

On one core, total time is 2 + 8*5 = 42 seconds. Which change reduces total time if four cores filter images at once after the shared setup?

  1. A. Run the 8 independent filters in parallel after the 2-second setup so time becomes 2 + 2*5 = 12 seconds when images are split across four cores in two waves of 4.
  2. B. Repeat the setup eight separate times on purpose before any filtering.
  3. C. Force every image to wait for all others with no overlapping work.
  4. D. Replace independent filters with a longer single-threaded setup only.

Question 2 of 10

A sequential sorting job takes 40 minutes. A parallel version finishes in 10 minutes.

What is the speedup?

  1. A. 40 * 10 = 400
  2. B. 40 / 10 = 4
  3. C. 40 - 10 = 30
  4. D. 10 / 40 = 0.25

Question 3 of 10

A simulation has a 9-minute sequential initialization and then 6 independent runs that each take 6 minutes on one processor.

With 3 processors for the runs, which total time is correct?

  1. A. 9 + 6*6 = 45 minutes, as if still fully sequential on the runs.
  2. B. 0 minutes, because parallel computing removes all work.
  3. C. 9 + 2*6 = 21 minutes, because the runs form two waves of 3.
  4. D. 6 minutes total, ignoring initialization.

Question 4 of 10

A team keeps adding processors to a task whose sequential portion is 20 minutes and whose parallelizable work is 20 minutes on one processor.

Which statement is best?

  1. A. Adding processors always reduces time to 0 minutes.
  2. B. Sequential portions accelerate without bound when processors are added.
  3. C. Speedup is measured by multiplying sequential and parallel times.
  4. D. Even with many processors, total time cannot drop below about 20 minutes because the sequential portion limits further gains.

Question 5 of 10

Which description matches distributed computing?

  1. A. Multiple devices work together to run a program, often for large storage or processing needs.
  2. B. Exactly one core executes every instruction with no other machines involved by definition.
  3. C. A protocol that forbids networks from connecting computers.
  4. D. A sorting algorithm that must run only on paper.

Question 6 of 10

A genome scan can finish in 50 hours on one lab workstation. Splitting across 10 networked machines needs 2 hours of communication overhead plus 5 hours of compute per machine on the parallel part.

Parallel wall-clock estimate: 2 + 5 = 7 hours. Which claim is accurate?

  1. A. The sequential-only time is 7 hours on one workstation.
  2. B. Speedup is 50/7, about 7.1, but communication overhead means efficiency is not the same idea as raw processor count.
  3. C. Speedup must equal 10 because 10 machines were plugged in.
  4. D. Communication time never affects distributed solutions.

Question 7 of 10

A bakery packing task has 1 minute of sequential labeling setup and 12 identical independent boxes that each take 1 minute to pack on one worker.

Which change reduces completion time the most among the options?

  1. A. Add workers but force them to pack one box at a time globally with no overlap.
  2. B. Increase the sequential setup to 12 minutes while still using one packer.
  3. C. After setup, assign the 12 boxes to 4 workers packing simultaneously (3 minutes of parallel packing), totaling about 1+3=4 minutes.
  4. D. Keep one worker and repeat the labeling setup 12 times before packing anything.

Question 8 of 10

Sequential computing means:

  1. A. All operations on all machines finish at identical instants by definition.
  2. B. No program can ever use more than one byte of memory.
  3. C. Packets are forbidden on local networks.
  4. D. Operations are performed in order, one at a time.

Question 9 of 10

A sequential solution takes as long as:

  1. A. The sum of all of its steps
  2. B. Only the shortest step, ignoring the rest
  3. C. Zero if the programmer smiles
  4. D. The number of routers in another country

Question 10 of 10

A parallel solution includes a 5-minute sequential merge and three parallel tasks taking 8, 6, and 4 minutes that start together after a shared 1-minute setup.

Phase Time (minutes)
Setup (sequential) 1
Task A 8
Task B 6
Task C 4
Merge (sequential) 5

What is the total parallel schedule time?

  1. A. 5 minutes only
  2. B. 1 + 8 + 5 = 14 minutes, using the longest parallel task
  3. C. 1+8+6+4+5 = 24 minutes, adding every parallel task end to end
  4. D. 8 minutes only