gs gs122 Recursion - Recursive Selection Sort - Quiz No.1
gs gs122 Data Communication and Computer Network Quiz
This quiz belongs to book/course code gs gs122 Data Communication and Computer Network of gs organization. We have 268 quizzes available related to the book/course Data Communication and Computer Network. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Recursion. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: Which of the following sorting algorithm has best case time complexity of O(n2)?
bubble sort
selection sort
insertion sort
stupid sort
Question 2: Which of the following is the biggest advantage of selection sort?
its has low time complexity
it has low space complexity
it is easy to implement
it requires only n swaps under any condition
Question 3: What will be the recurrence relation of the code of recursive selection sort?
T(n) = 2T(n/2) + n
T(n) = 2T(n/2) + c
T(n) = T(n-1) + n
T(n) = T(n-1) + c
Question 4: Which of the following sorting algorithm is NOT stable?
Selection sort
Brick sort
Bubble sort
Merge sort
Question 5: What will be the best case time complexity of recursive selection sort?
O(n)
O(n2)
O(log n)
O(n log n)
Question 7: What is the average case time complexity of recursive selection sort?
O(n)
O(n log n)
O(n2)
O(log n)
Question 8: What is the bidirectional variant of selection sort?
cocktail sort
bogo sort
gnome sort
bubble sort
Question 9: Choose correct C++ code for recursive selection sort from the following.
#include <iostream> using namespace std; int minIndex(int a[], int i, int j) { if (i == 0) return i; int k = minIndex(a, i + 1, j); return (a[i] < a[k])? i : k; } void recursiveSelectionSort(int a[], int n, int index = 0) { if (index == n) return; int x = minIndex(a, index, n-1); if (x == index) { swap(a[x], a[index]); } recursiveSelectionSort(a, n, index + 1); } int main() { int arr[] = {5,3,2,4,1}; int n = sizeof(arr)/sizeof(arr[0]); recursiveSelectionSort(arr, n); return 0; } #include <iostream> using namespace std; int minIndex(int a[], int i, int j) { if (i == j) return i; int k = minIndex(a, i + 1, j); return (a[i] < a[k])? i : k; } void recursiveSelectionSort(int a[], int n, int index = 0) { if (index == n) return; int x = minIndex(a, index, n-1); if (x != index) { swap(a[x], a[index]); } recursiveSelectionSort(a, n, index + 1); } int main() { int arr[] = {5,3,2,4,1}; int n = sizeof(arr)/sizeof(arr[0]); recursiveSelectionSort(arr, n); return 0; } #include <iostream> using namespace std; int minIndex(int a[], int i, int j) { if (i == j) return i; int k = minIndex(a, i + 1, j); return (a[i] > a[k])? i : k; } void recursiveSelectionSort(int a[], int n, int index = 0) { if (index == n) return; int x = minIndex(a, index, n-1); if (x != index) { swap(a[x], a[index]); } recursiveSelectionSort(a, n, index + 1); } int main() { int arr[] = {5,3,2,4,1}; int n = sizeof(arr)/sizeof(arr[0]); recursiveSelectionSort(arr, n); return 0; } #include <iostream> using namespace std; int minIndex(int a[], int i, int j) { if (i == j) return i; int k = minIndex(a, i + 1, j); return (a[i] > a[k])? i : k; } void recursiveSelectionSort(int a[], int n, int index = 0) { if (index == 0) return; int x = minIndex(a, index, n-1); if (x == index) { swap(a[x], a[index]); } recursiveSelectionSort(a, n, index + 1); } int main() { int arr[] = {5,3,2,4,1}; int n = sizeof(arr)/sizeof(arr[0]); recursiveSelectionSort(arr, n); return 0; } Online Quizzes of gs122 Data Communication and Computer Network
Sorting - Insertion Sort - Quiz No.1
gs gs122
Data Communication and Computer Network Online Quizzes
Sorting - Insertion Sort - Quiz No.2
gs gs122
Data Communication and Computer Network Online Quizzes
Sorting - Insertion Sort - Quiz No.3
gs gs122
Data Communication and Computer Network Online Quizzes
Sorting - LSD Radix Sort - Quiz No.1
gs gs122
Data Communication and Computer Network Online Quizzes
Sorting - MSD Radix Sort - Quiz No.1
gs gs122
Data Communication and Computer Network Online Quizzes
Sorting - MSD Radix Sort - Quiz No.2
gs gs122
Data Communication and Computer Network Online Quizzes
