1.The number of nested loops in a bubble sort algorithm of

1   2  3  4 

2. What is the worst case complexity for selection sort algorithm

O(n)  O(n*n)  O(nlogn)  O(logn) 

3. In a selectionsort of n elements, how many times is the swap function is the swap function called in the complete execution of the algorithm? 

1  n – 1  n log n  n² 

4. For insertion sort, the number of entries we must index through when there are n elements in the array is

n entries  n*n entries   n-1 entries   none of the above  

5. What is the best case complexity for insertion sort algorithm
O(n)   O(n*n)   o(nlogn)  none of the above 

6. In which cases are the time complexities same in insertion sort?ties for processing all

Worst and Best   Best and Average   Worst and Average   Worst, verage and Best  

7. The following loop is used for
For i<- 1 to N
For j<- i+1 to N
If(a(i)>a(j))
{
Temp=a(i);
A(i)=a(j);
A(j)=temp;

Bubble sort   Selection sort   Insertion sort   Merge sort  

8. Which of the following algorithm design technique is used for quick sort

Dynamic programming   Backtracking   Divide and conquer   Greedy method  

9. Straight selection sort is also called

Push-down sort   Push-up sort  both   none  


10. The types of selection sort are

General selection sort   Pull-up selection sort   Push-up selection sort  
none