Navigate

Question Detail

Algorithm solves all pair shortest path problem is

Answer: Option

Similar Questions :

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

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

Answer: Option B

2. The complexity of merge sort algorithm is

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

Answer: Option D

3. Which of the languages is often translated to the pseudo code

  • PASCAL
  • FORTRAN
  • PL/I
  • BASIC

Answer: Option A

4. Which is having highest precedence in C

  • relational operators
  • equality operator
  • logical operator
  • arithmetic operator

Answer: Option D

5. Which sorting method is slowest

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

Answer: Option D

Read more from - Data Structure Questions Answers - Chapter 1