Computer Science · Parallel Algorithms
Match List-I with List-II: List-I (Parallel Concept/Algorithm) P. Parallel Breadth-First Search (BFS) Q. Parallel Depth-First Search (DFS) R. Parallel Merge Sort S. Randomized Parallel Algorithms List-II (Description)1. Algorithms that use randomness to parallelize computations and reduce communication dependency. 2. Parallel sorting algorithm that divides input into chunks, sorts them independently, and merges results. 3. Parallel graph traversal exploring as far as possible along each branch before backtracking. 4. Parallel graph traversal exploring all vertices at the current level before moving to the next. Choose the correct option matching P, Q, R, S in order:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 14-3-1-2
- 24-2-3-1
- 34-3-2-1✓
- 43-1-2-4
Correct answer
4-3-2-1
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!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Parallel Algorithms MCQs →Want more practice questions on Parallel Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Parallel Algorithms