Which of the following is useful in implementing quick sort?

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

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?

• [A] mn
• [B] max(m,n)
• [C] min(m,n)
• [D] m+n-1

The number of possible ordered trees with three nodes A,B,C is?

• [A] 16
• [B] 12
• [C] 6
• [D] 10

You can make telephone calls over the Internet using a technology called

• [A] Intertel
• [B] Telenet
• [C] VoIP
• [D] VoRP

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