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

Which one of the following permutations can be obtained the output using stack assuming that the input is the sequence 1,2,3,4,5 in that order ?

• [A] 3,4,5,1,2
• [B] 3,4,5,2,1
• [C] 1,5,2,3,4
• [D] 5,4,3,1,2

Merge sort uses ?

• [A] Divide and conquer strategy
• [B] Backtracking approach
• [C] Heuristic search
• [D] Greedy approach

What is the result of the following operation Top (Push (S, X))

• [A] X
• [B] null
• [C] s
• [D] none of these

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