gs gs122 Sorting - Quicksort - Quiz No.3
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 Sorting. 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 one of the following sorting algorithm is best suited to sort an array of 1 million elements?
Bubble sort
Insertion sort
Merge sort
Quick sort
Question 2: Quick sort is a space-optimised version of ____
Bubble sort
Selection sort
Insertion sort
Binary tree sort
Question 3: Quick Sort can be categorized into which of the following?
Brute Force technique
Divide and conquer
Greedy algorithm
Dynamic programming
Question 4: Select the appropriate recursive call for QuickSort.(arr is the array, low is the starting index and high is the ending index of the array, partition returns the pivot element, we will see the code for partition very soon)
public static void quickSort(int[] arr, int low, int high) { int pivot; if(high>low) { pivot = partition(arr, low, high); quickSort(arr, low, pivot-1); quickSort(arr, pivot+1, high); } } public static void quickSort(int[] arr, int low, int high) { int pivot; if(high<low) { pivot = partition(arr, low, high); quickSort(arr, low, pivot-1); quickSort(arr, pivot+1, high); } } public static void quickSort(int[] arr, int low, int high) { int pivot; if(high>low) { pivot = partition(arr, low, high); quickSort(arr, low, pivot); quickSort(arr, pivot, high); } } public static void quickSort(int[] arr, int low, int high) { int pivot; if(high>low) { pivot = partition(arr, low, high); quickSort(arr, low, pivot); quickSort(arr, pivot+2, high); } }
Question 5: What is the worst case complexity of QuickSort?
O(nlogn)
O(logn)
O(n)
O(n2)
Question 6: What is a randomized QuickSort?
The leftmost element is chosen as the pivot
The rightmost element is chosen as the pivot
Any element in the array is chosen as the pivot
A random number is generated which is used as the pivot
Question 7: Which of the following code performs the partition operation in QuickSort?
private static int partition(int[] arr, int low, int high) { int left, right, pivot_item = arr[low]; left = low; right = high; while(left > right) { while(arr[left] <= pivot_item) { left++; } while(arr[right] > pivot_item) { right--; } if(left < right) { swap(arr, left, right); } } arr[low] = arr[right]; arr[right] = pivot_item; return right; } private static int partition(int[] arr, int low, int high) { int left, right, pivot_item = arr[low]; left = low; right = high; while(left <= right) { while(arr[left] <= pivot_item) { left++; } while(arr[right] > pivot_item) { right--; } if(left < right) { swap(arr, left, right); } } arr[low] = arr[right]; arr[right] = pivot_item; return right; } private static int partition(int[] arr, int low, int high) { int left, right, pivot_item = arr[low]; left = low; right = high; while(left <= right) { while(arr[left] > pivot_item) { left++; } while(arr[right] <= pivot_item) { right--; } if(left < right) { swap(arr, left, right); } } arr[low] = arr[right]; arr[right] = pivot_item; return right; } private static int partition(int[] arr, int low, int high) { int left, right, pivot_item = arr[low]; left = low; right = high; while(left > right) { while(arr[left] > pivot_item) { left++; } while(arr[right] <= pivot_item) { right--; } if(left < right) { swap(arr, left, right); } } arr[low] = arr[right]; arr[right] = pivot_item; return right; }
Question 8: What is the best case complexity of QuickSort?
O(nlogn)
O(logn)
O(n)
O(n2)
Question 9: The given array is arr = {2,3,4,1,6}. What are the pivots that are returned as a result of subsequent partitioning?
1 and 3
3 and 1
2 and 6
6 and 2
Question 10: What is the average case complexity of QuickSort?
O(nlogn)
O(logn)
O(n)
O(n2)
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
