7 years ago in Data Structure

Queue can be used to implement ?

[A] quick sort
[B] merge sort
[C] heap sort
[D] insertion sort
Loading...
Next Question

Overall Stats

Attempted 243
Correct 30
Incorrect 76
Viewed 137

Answers

Guest
Guest
Poonam Singla - 6 years ago

Queue can be used to implement heap sort..not for quick sort.this is implemented by stack

Comments (0)
Lets Know
Lets Know - 4 years ago

Lets Know from Pakistan is saying heap sort is correct answer

Rohan Bhosale
Rohan Bhosale - 4 years ago

Rohan Bhosale from Pune, India is saying insertion sort is correct answer

Rohan Bhosale
Rohan Bhosale - 4 years ago

Rohan Bhosale from Pune, India is saying insertion sort is correct answer

Mihir Shah
Mihir Shah - 4 years ago

Mihir Shah from Majalgaon, India is saying heap sort is correct answer

Related Questions

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

View Answer

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

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

View Answer

Merge sort uses ?

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

View Answer

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 Answer

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

View Answer