Computer Science · Parallel Algorithms
Match List-I (Concepts/Algorithms) with List-II (Definitions/Properties): P. Parallel Breadth-First Search (BFS) Q. Parallel Depth-First Search (DFS) R. Parallel Merge Sort S. Randomized Parallel Algorithms List-II: 1. Algorithms that use randomness to parallelize computations and reduce communication overhead. 2. A parallel sorting algorithm that recursively divides data into smaller chunks, sorts them, and merges them. 3. A parallel version of graph traversal that explores along each path as deep as possible before backtracking. 4. A parallel version of graph traversal that explores all neighbor vertices level by level.
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1P-4, Q-3, R-2, S-1✓
- 2P-4, Q-2, R-3, S-1
- 3P-4, Q-3, R-1, S-2
- 4P-3, Q-1, R-2, S-4
Correct answer
P-4, Q-3, R-2, S-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