1) Finding the location of a given item in a collection of items is called ......

A. Discovering

B. Finding

C. Searching

D. Mining

2) Which of the following is an external sorting?

A. Insertion Sort

B. Bubble Sort

C. Merge Sort

D. Tree Sort

3) Very slow way of sorting is ..........

A. Insertion sort

B. Heap sort

C. Bubble sort

D. Quick sort

4) Which of the following is an internal sorting?

A. Tape Sort

B. 2-way Merge Sort

C. Merge Sort

D. Tree Sort

5) Sorting a file F usually refers to sorting F with respect to a particular key called .....

A. Basic key

B. Primary key

C. Starting key

D. Index key

6) The time complexity of quick sort is ........

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)

7) Selection sort first finds the .......... element in the list and put it in the first position.

A. Middle element

B. Largest element

C. Last element

D. Smallest element

8) Quick sort is also known as ........

A. merge sort

B. tree sort

C. shell sort

D. partition and exchange sort

9) The operation that combines the element is of A and B in a single sorted list C with n=r+s element is called ....

A. Inserting

B. Mixing

C. Merging

D. Sharing

10) A tree sort is also known as ......... sort.

A. quick

B. shell

C. heap

D. selection

11) .......... sorting is good to use when alphabetizing large list of names.

A. Merge

B. Heap

C. Radix

D. Bubble

12) The easiest sorting is ........

A. quick sort

B. shell sort

C. heap sort

D. selection sort

13) Which of the following sorting algorithm is of divide and conquer type?

A. Bubble sort

B. Insertion sort

C. Quick sort

D. Merge sort

14) Merging k sorted tables into a single sorted table is called ......

A. k way merging

B. k th merge

C. k+1 merge

D. k-1 merge

15) The function used to modify the way of sorting the keys of records is called ........

A. Indexing function

B. Hash function

C. Addressing function

D. All of the above

16) If the number of record to be sorted large and the key is short, then ...... sorting can be efficient.

A. Merge

B. Heap

C. Radix

D. Bubble

17) The total number of comparisons in a bubble sort is ....

A. O(n logn)

B. O(2n)

C. O(n2)

D. O(n)

18) If the number of record to be sorted large and the key is long, then ...... sorting can be efficient.

A. Merge

B. Heap

C. Quick

D. Bubble

19) The time complexity of heap sort is ....

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)

20) The complexity of selection sort is .......

A. O(n)

B. O(n2)

C. O(n logn)

D. O(logn)

1) C. Searching

2) C. Merge Sort

3) A. Insertion sort

4) D. Tree Sort

5) B. Primary key

6) D. O(n logn)

7) D. Smallest element

8) D. partition and exchange sort

9) C. Merging

10) C. heap

11) C. Radix

12) D. selection sort

13) C. Quick sort

14) A. k way merging

15) B. Hash function

16) C. Radix

17) A. O(n logn)

18) C. Quick

19) D. O(n logn)

20) B. O(n2)

A. Discovering

B. Finding

C. Searching

D. Mining

2) Which of the following is an external sorting?

A. Insertion Sort

B. Bubble Sort

C. Merge Sort

D. Tree Sort

3) Very slow way of sorting is ..........

A. Insertion sort

B. Heap sort

C. Bubble sort

D. Quick sort

4) Which of the following is an internal sorting?

A. Tape Sort

B. 2-way Merge Sort

C. Merge Sort

D. Tree Sort

5) Sorting a file F usually refers to sorting F with respect to a particular key called .....

A. Basic key

B. Primary key

C. Starting key

D. Index key

6) The time complexity of quick sort is ........

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)

7) Selection sort first finds the .......... element in the list and put it in the first position.

A. Middle element

B. Largest element

C. Last element

D. Smallest element

8) Quick sort is also known as ........

A. merge sort

B. tree sort

C. shell sort

D. partition and exchange sort

9) The operation that combines the element is of A and B in a single sorted list C with n=r+s element is called ....

A. Inserting

B. Mixing

C. Merging

D. Sharing

10) A tree sort is also known as ......... sort.

A. quick

B. shell

C. heap

D. selection

11) .......... sorting is good to use when alphabetizing large list of names.

A. Merge

B. Heap

C. Radix

D. Bubble

12) The easiest sorting is ........

A. quick sort

B. shell sort

C. heap sort

D. selection sort

13) Which of the following sorting algorithm is of divide and conquer type?

A. Bubble sort

B. Insertion sort

C. Quick sort

D. Merge sort

14) Merging k sorted tables into a single sorted table is called ......

A. k way merging

B. k th merge

C. k+1 merge

D. k-1 merge

15) The function used to modify the way of sorting the keys of records is called ........

A. Indexing function

B. Hash function

C. Addressing function

D. All of the above

16) If the number of record to be sorted large and the key is short, then ...... sorting can be efficient.

A. Merge

B. Heap

C. Radix

D. Bubble

17) The total number of comparisons in a bubble sort is ....

A. O(n logn)

B. O(2n)

C. O(n2)

D. O(n)

18) If the number of record to be sorted large and the key is long, then ...... sorting can be efficient.

A. Merge

B. Heap

C. Quick

D. Bubble

19) The time complexity of heap sort is ....

A. O(n)

B. O(logn)

C. O(n2)

D. O(n logn)

20) The complexity of selection sort is .......

A. O(n)

B. O(n2)

C. O(n logn)

D. O(logn)

#### Answers:

1) C. Searching

2) C. Merge Sort

3) A. Insertion sort

4) D. Tree Sort

5) B. Primary key

6) D. O(n logn)

7) D. Smallest element

8) D. partition and exchange sort

9) C. Merging

10) C. heap

11) C. Radix

12) D. selection sort

13) C. Quick sort

14) A. k way merging

15) B. Hash function

16) C. Radix

17) A. O(n logn)

18) C. Quick

19) D. O(n logn)

20) B. O(n2)