Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?

Which of the following algorithm design technique is used in the quick sort algorithm?

• [A] Dynamic programming
• [B] Backtracking
• [C] Divide and conquer
• [D] Greedy method

The number of swapping needed to sort numbers 8,22,7,9,31,19,5,13 in ascending order using bubble sort is ?

• [A] 11
• [B] 12
• [C] 13
• [D] 14

The number of binary trees with 3 nodes which when traversed in post order gives the sequence A,B,C is ?

• [A] 3
• [B] 9
• [C] 7
• [D] 5

The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a one needs a minimum of ?

• [A] 2 deletions and 3 additions
• [B] 3 additions and 2 deletions
• [C] 3 deletions and 3 additions
• [D] 3 deletions and 4 additions

Linked list are not suitable data structure of which one of the following problems ?

• [A] Insertion sort
• [B] Binary search
• [C] Radix sort
• [D] Polynomial manipulation