CIT237 TMA QUESTION

1. Which of the options is an example of divide-and-conquer paradigm?

Quicksort
Mergesort
Binary
All of the option

2. Which of the following options is a recursive sort algorithhm?
Quicksort
Mergesort
Binary
Options A and B

3.Which of the options has a time complexity of theta(n log (n)) on the average?
Quicksort
Mergesort
Binary
All of the options

4.Which of the following paradigms helps in the discovery of effecient algorithm?
Quicksort
Mergesort
Divide and conquer
Binary

5.Which of the following sorting algorithm has average-case and worst-case running time of O(n log n)?
Bubble sort
Insertion sort
Merge sort
Quick sort

6.Which sort is an O(n log n) comparison-based sorting algorithm?
Quicksort
Mergesort
divide and conqer
Binary

7.Which of the following options is the fastest sorting algorithm?
Quicksort
Mergesort
Binary
All of the options

8.Which of the options is the main advantages of sorting algorithms?
Our best sorting algorithms have a O(n log n) performance
it takes a very long time to sort large sets of data.
They allow us a way to put information into a meaningful order.
None of the options is correct

9.Divide-and-conquer paradigm consist of following major phases,except?
Breaking the problem into several sub-problems that are similar to the original problem but smaller in size
Solve the sub-problem recuursively
Combine these solutions to subproblems to create a solution to the original problem.
None of the options is correct

10.Which of the options divide its input's element according to their value?
Quicksort
Mergesort
Binary
All of the option

11.Which of the following sorting algorithms with a time complexity of O(n log(n))even in the worst case?
Heapsort
Mergesort
Binary
Options A and B

12.Which of the options divide its input's elements according to their position in the array?
Quicksort
Mergesort
Binary
All of the options

13.The following are advantages of Divide-and-conquer,execpt?
Solving difficult problems
Memory
Algorithm
None of the options is correct

14.The following are the significance of sorting,execpt?
It is used as a part of many geometric algorithm
For finding the intersection of two
for finding duplicate values within a set
None of the options is correct

15.Partition-Exchange sort is also known as?
Quicksort
Mergesort
Options B and D
Binary

16.Which of the following options is not true about a sorting algorithm?
It is for optimizing the use of other algorithms
It is often useful for canonicalizing data
It is used for producing human-readable output
None of the options is correct

17.Sorting algorithms are often classified by the following,execept
Computational complexity
Computational complexity of swaps
Recursion
None of the options is correct

18.Which of the following sorting algorithm maintain the relative order of records with equal keys?
Quicksort
Stable
Mergesort
Unstable

19.Which of the following algorithms works by recursively breaking down a problem into two or more sub-problems of the same type?
Quicksort
Mergesort
divide and conquer
Binary

20.The ideal sorting algorithm would have the following properties,except?
Stable
Operate in place
Adaptive
None of the options is correct