QUESTION 22

1. Which of the following sorting procedures is the slowest?

   		a. Quick sort
   		b. Heap sort
   		c. Shell sort
   		d. Bubble sort

QUESTION 24

1. Quick sort efficiency can be improved by adopting

   		a. non-recursive method
   		b. insertion method
   		c. tree search method
   		d. None of the above

0.25 points

QUESTION 25

1. Which of the following methods can be used to find the factorialof a number?

   		a. Recursion
   		b. Iteration
   		c. Dynamic programming
   		d. All of the mentioned

0.25 points

QUESTION 26

1. Which of these sorting algorithms has the lowest complexity onaverage?

   		a. Merge sort
   		b. quick sort,
   		c. insertion sort
   		d. heap sort.

0.25 points

QUESTION 27

1. Two or more functions, which invoke (call) each other, arecalled

   		a. combined recursive functions
   		b. coexitant recursive functions
   		c. mutually recursive functions
   		d. double recursive functions

0.25 points

QUESTION 28

1. Number of selections required to sort a file of size N bystraight selection requires

   		a. N - 1
   		b. log N
   		c. O(N2)
   		d. None of the above

0.25 points

QUESTION 29

1. Which of these sorting algorithms does not allow to sort anarray in place

   		a. Merge sort
   		b. quick sort,
   		c. insertion sort
   		d. heap sort.

0.25 points

QUESTION 30

1. How complexity of T(n) = 7T(n/3) + n2

   		a. O(n)
   		b. O(log n)
   		c. O(n2)
   		d. O(n log n)

0.25 points

QUESTION 31

1. The complexity of the bubble sorting algorithm is

   		a. O(n)
   		b. O(log n)
   		c. O(n2)
   		d. O(n log n)

0.25 points

QUESTION 32

1. What is the minimum complexity (on average) of a sortingalgorithm by comparisons of n elements?

   		a. O( logn)
   		b. O( n)
   		c. O( nlogn)
   		d. O( n2)

0.25 points

QUESTION 33

1. The total number of comparisons made in quick sort for sorting afile of size n, is

   		a. O(n log(n))
   		b. O(n2)
   		c. n(log(n))
   		d. None of the above

0.25 points

QUESTION 34

1. Straight selection sort is basically a method of repeated

   		a. interchange
   		b. searching
   		c. position adjustment
   		d. None of the above

0.25 points

QUESTION 35

1. How complex is sorting by insertion?

   		a. O(n*2)
   		b. O(log n)
   		c. O(nlog n)
   		d. no one

0.25 points

QUESTION 36

1. Two main measures for the efficiency of an algorithm are

   		a. Complexity and capacity.
   		b. Time and space
   		c. Data and space.
   		d. Processor and memory

0.25 points

QUESTION 37

1. The time factor to determine the efficiency of the algorithm ismeasured by

   		a. Count microseconds
   		b. Count the number of operations
   		c. Count the number of declarations
   		d. Count the kilobytes of algorithm

0.25 points

QUESTION 38

1. Which of these sorting algorithms has the best complexity in theworst case?

   		a. Merge sort
   		b. quick sort,
   		c. insertion sort
   		d. heap sort.

QUESTION 40

1. What sort is divide and conquer

   		a. Sort by insertion
   		b. Sort by bubble
   		c. Sort by merge
   		d. All the above