Data Structure quiz 1

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

• a) Quick sort

• b) Shell sort

• c) Insertion sort

• d) Heap sort

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

• a) It is faster than any other sorting technique
  
  
  

• b) It is scalable

• c) It works best for inputs which are already sorted

• d) It requires no additional storage space

Which of the following method is used for sorting in merge sort?

• partitioning
  
  

• b) merging

• c) exchanging

• d) selection

Merge sort uses which of the following method to implement sorting?

• a) selection

• b) exchanging

• c) merging

• d) partitioning

Which of the following sorting algorithms is the fastest?

• a) Merge sort

• b) Shell sort

• c) Insertion sort

• d) Quick sort

Shell sort algorithm is an example of?

• a) Bottom-up sorting

• b) In-place sorting

• c) Internal sorting

• d) External sorting

Which of the following is not an advantage of optimised bubble sort over other sorting techniques in case of sorted elements?

• a) It is faster

• b) Consumes less memory

• c) Detects whether the input is already sorted

• d) Consumes less time

Answer explanation

Optimised Bubble sort is one of the simplest sorting techniques and perhaps the only advantage it has over other techniques is that it can detect whether the input is already sorted. It is faster than other in case of sorted array and consumes less time to describe whether the input array is sorted or not. It consumes same memory than other sorting techniques. Hence it is not an advantage.

The given array is arr = {1,2,4,3}. Bubble sort is used to sort the array elements. How many iterations will be done to sort the array with improvised version?

• a) 4

• b) 2

• c) 1

• d) 0

Where is linear searching used?

• a) When the list has only a few elements

• b) When performing a single search in an unordered list

• c) Used all the time

• d) When the list has only a few elements and When performing a single search in an unordered list

Given an array arr = {5,6,77,88,99} and key = 88; How many iterations are done until the element is found?

• a) 1

• b) 3

• c) 4

• d) 2