QUIZ3:-DATA STRUCTURE

Which of the following sorting algorithms has the lowest worst-case complexity?

• Quick sort

• Merge sort

• Selection sort

• Bubble sort

If the number of records to be sorted is small, identify the suitable sorting to be used

• Quick sort

• Merge sort

• Selection sort

• Bubble sort

The worst case occurs in linear search algorithm when ______________________

• Item is not in the array at all

• Item is somewhere in the middle of the array

• Item is the last element in the array or item is not there at all

• Item is the last element in the array

Recognize the algorithm that does not divide the list.

• Merge sort

• Binary Search

• Linear Search

• Quick sort

Identify the types of sorting that used the concept of divide and conquer.

• Insertion sort

• Merge sort

• Selection sort

• Bubble sort

Suppose we are sorting an array of eight integers using quick sort, and we have just finished the first partitioning with the array looking like this:

2 5 1 7 9 12 11 10

Identify the correct statement?

• Neither the 7 nor the 9 is the pivot.

• The pivot could be either the 7 or the 9.

• The pivot is not the 7, but it could be the 9.

• The pivot could be the 7, but it is not the 9.

How many steps needed to sort the following numbers using a selection sort.

5 1 12 -5 16 2 12 14

• 8

• 6

• 7

• 5

Identify the types of sorting that is slowest.

• Bubble sort

• Selection sort

• Quick sort

• Merge sort

Identify the types of sorting that used partition and exchange sort.

• Bubble sort

• Selection sort

• Quick sort

• Merge sort

Identify the best answer for the statement given below

“ is any process of arranging items in some sequence and/or in different sets, and accordingly”

• Searching

• Sorting

• Hashing

• Fixing