Chapter Exam

Chapter-5 Sorting — Online MCQ Test

Q: Which search algorithm requires the array to be sorted?

Answer: D. Both B and C — Binary Search and Jump Search both require a pre-sorted array to work correctly, as they rely on the sorted order to eliminate portions of the search space.

Q: Which sorting algorithm has the same best, average, and worst-case time complexity?

Answer: C. Selection Sort — Selection Sort always has O(n²) complexity regardless of input order because it always performs n(n-1)/2 comparisons to find the minimum element in each pass.

Q: Compare Linear Search and Binary Search: when is Linear Search preferable to Binary Search?

Answer: B. When the array is small and unsorted — For small unsorted arrays, the overhead of sorting for Binary Search makes Linear Search more practical despite its O(n) complexity.

COMPUTER SCIENCE · CLASS 12 SECOND PUC · Karnataka State Board

Practice Chapter-5 Sorting with a free chapter-wise online MCQ test for Karnataka State Board CLASS 12 SECOND PUC COMPUTER SCIENCE. This chapter covers: bubble sort - insertion sort. AI-generated questions from basic to board-exam level, with instant results and explanations.

Questions

20m

Time Limit

Attempts Left

10 random questions from this chapter (mixed difficulty)
Questions you've seen before won't repeat until the pool resets
You have 20 minutes — exam auto-submits when time is up
Maximum 3 attempts per chapter
Results and explanations shown immediately after submission

New here? Register free — includes 3 free chapter exams.

Chapter-5 Sorting — Important Questions & Answers (FAQ)

Frequently asked questions from Karnataka State Board CLASS 12 SECOND PUC COMPUTER SCIENCE — Chapter-5 Sorting, with answers and explanations. These are sample questions; the exam has its own separate question set.

What is the primary characteristic of Linear Search?

A. It searches elements sequentially from the beginning ✓
B. It requires the array to be sorted
C. It divides the array into halves
D. It uses divide and conquer strategy

Answer: A. It searches elements sequentially from the beginning
Linear search checks each element one by one from the start until the target is found, regardless of whether the array is sorted or not.

Which search algorithm requires the array to be sorted?

A. Linear Search
B. Binary Search
C. Jump Search
D. Both B and C ✓

Answer: D. Both B and C
Binary Search and Jump Search both require a pre-sorted array to work correctly, as they rely on the sorted order to eliminate portions of the search space.

Which sorting algorithm has the same best, average, and worst-case time complexity?

A. Bubble Sort
B. Insertion Sort
C. Selection Sort ✓
D. Quick Sort

Answer: C. Selection Sort
Selection Sort always has O(n²) complexity regardless of input order because it always performs n(n-1)/2 comparisons to find the minimum element in each pass.

Compare Linear Search and Binary Search: when is Linear Search preferable to Binary Search?

A. Linear Search is always preferable
B. When the array is small and unsorted ✓
C. When the array is large and sorted
D. They always have the same efficiency

Answer: B. When the array is small and unsorted
For small unsorted arrays, the overhead of sorting for Binary Search makes Linear Search more practical despite its O(n) complexity.

In a highly competitive exam scenario, searching 10^7 records for a specific ID where records are sorted by ID, which algorithm combination would be optimal and why?

A. Linear Search because it's simpler
B. Bubble Sort followed by Linear Search for accuracy
C. Binary Search directly on the sorted records to minimize comparisons ✓
D. Insertion Sort to maintain sorted order during search

Answer: C. Binary Search directly on the sorted records to minimize comparisons
Binary Search on 10^7 sorted records requires only ~23 comparisons worst case, far superior to Linear Search's 10^7 comparisons, making it optimal for this competitive scenario.