Davinder Singh - 4 years ago in Data Structure

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
Loading...

Answers

Guest

Related Questions

Davinder Singh - 4 years ago in Data Structure
The following sequence of operation is performed on stack : push(1),push(2),pop,push(1),push(2),pop,pop,pop,push(2),pop. The sequence of popped out values are ?
  • [A] 2,2,1,1,2
  • [B] 2,2,1,2,2
  • [C] 2,1,2,2,1
  • [D] 2,1,2,2,2
Submit Answer
Davinder Singh - 4 years ago in Data Structure
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
Submit Answer
Davinder Singh - 4 years ago in Data Structure
You can make telephone calls over the Internet using a technology called
  • [A] Intertel
  • [B] Telenet
  • [C] VoIP
  • [D] VoRP
Submit Answer
Davinder Singh - 4 years ago in Data Structure
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
View Answers
Davinder Singh - 4 years ago in Data Structure
Which of the following is useful in implementing quick sort?
  • [A] Stack
  • [B] Set
  • [C] List
  • [D] Queue
Submit Answer