Merge Sort, Quick Sort and Order Statistics
Curriculum and historical examination lineage for Merge Sort, Quick Sort and Order Statistics under Unit 2 (Divide and Conquer Paradigms) of Design and Analysis of Algorithms (21CSC204J) at SRMIST.
Historical appearance distribution across SRMIST Formative Tests (CT1, CT2) and University End Semester examinations.
Factual marks weightage of questions asked on this topic in historical examinations.
Representative historical questions extracted directly from SRMIST examination papers.
Identify the sorting technique which compares adjacent elements in a list and switches whenever necessary? (A) Merge sort (B) Quick sort (C) Bubble sort (D) Selection sort [1]
Merge sort uses which of the following technique to implement sorting? (A) Back tracking (B) Greedy algorithm (C) Divide and conquer (D) Dynamic partitioning [1]
b. Construct an algorithm for randomized quick sort and perform the complexity analysis of randomized quick sort algorithm. [8]
Examinations where questions for Merge Sort, Quick Sort and Order Statistics have appeared.
Master Merge Sort, Quick Sort and Order Statistics in MintAI
Practice past exam questions, test recurring archetypes, and view predictive probability for this topic before your upcoming exam.