DSA QUIZ 2

1. Which of the following sorting algorithms is the fastest for sorting small arrays?

• Quick Sort

• Shell Sort

• Insertion Sort

• Heap Sort

2. What is the advantage of selection sort over other sorting techniques?

• It is faster than any other sorting technique

• It is scalable

• It works best for inputs which are already sorted

• It requires no additional storage space

3. What is an external sorting algorithm?

• Algorithm that uses tape or disk during the sort

• Algorithm that uses main memory during the sort

• Algorithm that involves swapping

• Algorithm that are considered ‘in place’

4. What is an internal sorting algorithm?

• Algorithm that uses tape or disk during the sort

• Algorithm that uses main memory during the sort

• Algorithm that involves swapping

• Algorithm that are considered ‘in place’

5. Select the appropriate code that performs bubble sort.

• 
• 
• 
• 

6. How can you improve the best case efficiency in bubble sort? (The input is already sorted)

• 
• 
• 
• 

7. How many passes does an insertion sort algorithm consist of?

• N

• N - 1

• N + 1

• N²

8. Any algorithm that sorts by exchanging adjacent elements require O(N²) on average.

• True

• False

9. ____ number of passes will require to sort the elements (14, 12,16, 6, 3, 10) using insertion sort
   

10. For the following question, how will the array elements look like after second pass?

    34, 8, 64, 51, 32, 21

• 8, 21, 32, 34, 51, 64

• 8, 32, 34, 51, 64, 21

• 8, 34, 51, 64, 32, 21

• 8, 34, 64, 51, 32, 21