DSC UNIT 6

The process of ordering a list of objects is called __________

• Linked List

• Sorting

• Tree

• Searching

If the number of objects is small enough to fits into the main memory, sorting is called __________

• Internal sorting

• External Sorting

• Small Sorting

• Larger Sorting

If the number of objects is so large that some of them reside on external storage during the sort, it is called __________

• Internal sorting

• External Sorting

• Small Sorting

• Larger Sorting

The total number of comparisons in a bubble sort is __________

• O(n logn)

• O(2n)

• O(n2)

• O(n)

In __________ sorting the algorithm works by comparing each item in the list with the item next to it, and swapping them if required.

• Bubble Sort

• Bucket Sort

• Heap Sort

• Quick Sort

The complexity of bubble sort algorithm is __________

• O(n)

• O(logn)

• O(n2)

• O(n logn)

The complexity of sorting algorithm measures the __________ as a function of the number n of items to be sorter

• average time

• running time

• average-case complexity

• case-complexity

Bubble Sort is also known as __________

• Selection Sort

• Sinking Sort

• Heap Sort

• Insertion Sort

The sorting __________ is based on the divide-and-conquer paradigm

• Bubble Sort

• Merge sort

• Insertion Sort

• Selection Sort

Which of the following is an external sorting?

• Insertion Sort

• Bubble Sort

• Merge Sort

• Tree Sort