Navigate

Question Detail

Which sorting method is slowest

  • Quick sort
  • Heap sort
  • Shell sort
  • Bubble sort

Answer: Option D

Similar Questions :

1. A linear list from which elements can be added or removed from either end is called

  • stack
  • queue
  • deque
  • tree

Answer: Option C

2. What are the minimum number of queues needed to implement the priority queue?

  • One
  • Two
  • Three
  • Four

Answer: Option B

Explanation:

One queue is used for the actual storing of data, and the other one is used for storing the priorities.

3. Sort which compares adjacent elements in a list and switches where necessary is

  • Insertion sort
  • Heap sort
  • Quick sort
  • Bubble sort

Answer: Option D

4. The complexity of Bubble sort algorithm is

  • O(n)
  • O(log n)
  • O(n2)
  • O(n log n)

Answer: Option C

5. Deletion from one end and insertion from other end is

  • stack
  • branch
  • tree
  • queue

Answer: Option D

Read more from - Data Structure Questions Answers - Chapter 1