Navigate

Question Detail

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

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

Answer: Option D

Similar Questions :

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

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

Answer: Option D

2. Merge sort uses

  • Divide and conquer strategy
  • Backtracking approach
  • Heuristic search
  • Greedy approach

Answer: Option A

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

4. A graph with one or more edges is at least

  • 1-chromatic
  • 2-chromatic
  • 3-chromatic
  • 4-chromatic

Answer: Option B

5. minimum number of stacks of size n required to implement a queue of size n

  • One
  • Two
  • Three
  • Four

Answer: Option B

Read more from - Data Structure Questions Answers - Chapter 1