Which of the following problems is a well-known NP-Complete decision problem?

Options

  • A. Graph Coloring with at most 3 colors
  • B. Binary Search
  • C. Finding the maximum element in an array
  • D. More than one of the above
  • E. None of the above

Correct Answer (Detailed Explanation is Below)

A. Graph Coloring with at most 3 colors

Detailed Explanation

  • 3-Coloring: Deciding whether a graph can be colored using at most three colors such that adjacent vertices have different colors is NP-Complete.
  • Binary Search: Runs in O(log n) time on sorted data.
  • Maximum Element: Can be found in O(n) time.