Navigate

Question Detail

A graph with one or more edges is at least

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

Answer: Option B

Similar Questions :

1. Merge sort uses

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

Answer: Option A

2. Preorder is

  • depth first order
  • breadth first order
  • topological order
  • linear order

Answer: Option A

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

  • PASCAL
  • FORTRAN
  • PL/I
  • BASIC

Answer: Option A

4. The complexity of Binary search algorithm is

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

Answer: Option B

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

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

Answer: Option B

Read more from - Data Structure Questions Answers - Chapter 1