Data Structure Selection Sort Online Exam Quiz
Data Structure Selection Sort GK Quiz. Question and Answers related to Data Structure Selection Sort. MCQ (Multiple Choice Questions with answers about Data Structure Selection Sort
The given array is arr = {1,2,3,4,5}. (bubble sort is implemented with a flag variable)The number of iterations in selection sort and bubble sort respectively are,
Options
A : 5 and 4
B : 1 and 4
C : 0 and 4
D : 4 and 1
The given array is arr = {3,4,5,2,1}. The number of iterations in bubble sort and selection sort respectively are,
Options
A : 5 and 4
B : 4 and 5
C : 2 and 4
D : 2 and 5
What is an in-place sorting algorithm?
Options
A : It needs O(1) or O(logn) memory to create auxiliary locations
B : The input is already sorted and in-place
C : It requires additional storage
D : It requires additional space
What is the disadvantage of selection sort?
Options
A : It requires auxiliary memory
B : It is not scalable
C : It can be used for small keys
D : It takes linear time to sort the elements
What is the advantage of selection sort over other sorting techniques?
Options
A : It requires no additional storage space
B : It is scalable
C : It works best for inputs which are already sorted
D : It is faster than any other sorting technique
What is the average case complexity of selection sort?
Options
A : O(nlogn)
B : O(logn)
C : O(n)
D : O(n2)
What is the best case complexity of selection sort?
Options
A : O(nlogn)
B : O(logn)
C : O(n)
D : O(n2)
What is the worst case complexity of selection sort?
Options
A : O(nlogn)
B : O(logn)
C : O(n)
D : O(n2)
Data Structure Adjacency List more Online Exam Quiz
Data Structure Reverse Word Stack
Data Structure Search Element Array Recursion 1