Virtual Labs

Tools

Aim

Theory

Objective

Pretest

Procedure

Simulation

Posttest

References

Feedback

Aim

Theory

Objective

Pretest

Procedure

Simulation

Posttest

References

Feedback

Searching and Sorting

Choose difficulty:

Beginner

Intermediate

Advanced

1. Which of the following is the best case time complexity of bubble sort?

a: O(n) Explanation

Explanation

b: O(n^2) Explanation

Explanation

c: O(log n) Explanation

Explanation

d: O(n log n) Explanation

Explanation

2. Which searching algorithm divides the search interval in half each time?

a: Binary Search Explanation

Explanation

b: Linear Search Explanation

Explanation

c: Jump Search Explanation

Explanation

d: Exponential Search Explanation

Explanation

3. Which sorting algorithm is NOT stable?

a: Bubble Sort Explanation

Explanation

b: Selection Sort Explanation

Explanation

c: Insertion Sort Explanation

Explanation

d: Merge Sort Explanation

Explanation

4. What is the main advantage of merge sort over bubble sort?

a: Merge sort is easier to implement Explanation

Explanation

b: Merge sort is faster for large data Explanation

Explanation

c: Bubble sort uses less memory Explanation

Explanation

d: Bubble sort is always faster Explanation

Explanation

5. Which searching algorithm is best for unbounded or infinite lists?

a: Linear Search Explanation

Explanation

b: Binary Search Explanation

Explanation

c: Exponential Search Explanation

Explanation

d: Jump Search Explanation

Explanation

6. Which of the following statements about sorting is TRUE?

a: Bubble sort is always faster than quick sort. Explanation

Explanation

b: Merge sort is stable and efficient for large data. Explanation

Explanation

c: Selection sort is the fastest algorithm. Explanation

Explanation

d: Insertion sort is always O(n log n). Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)