Question
Which of the following problems is a decision problem?a) What is the smallest prime greater than n?b) Is a graph G bipartite?c) Given a set of strings, is there a finite-state automaton that recognizes this set of strings?d) Given a checkerboard and a particular type of polyomino (see Section 1.8), can this checkerboard betiled using polyominoes of this type?
Step 1
The answer to this problem is going to be a number. However, for a decision problem, the answer has to be yes or no. Therefore, this problem is not a decision problem. Hence, the answer to this problem is \textbf{No decision problem}. Show more…
Show all steps
Your feedback will help us improve your experience
Chris Trentman and 52 other Intro Stats / AP Statistics educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Which of the following problems is a decision problem? a) Is the sequence $a_{1}, a_{2}, \ldots, a_{n}$ of positive integers in increasing order? b) Can the vertices of a simple graph $G$ be colored using three colors so that no two adjacent vertices are the same color? c) What is the vertex of highest degree in a graph $G ?$ d) Given two finite-state machines, do these machines recognize the same language?
Modeling Computation
Turing Machines
Find a deterministic finite-state automaton that recognizes each of these sets. $$\begin{array}{ll}{\text { a) }\{0\}} & {\text { b) }\{1,00\}} \\ {\text { c) }\left\{1^{n} | n=2,3,4, \ldots\right\}}\end{array}$$
Finite-State Machines with No Output
Select the correct alternative from the given choices. An undirected graph $G$ has ' $n$ ' nodes. Its adjacency matrix is given by an $n \times n$ square matrix. (i) Diagonal elements are 0 's (ii) Non-diagonal elements are l's Which of the following is true? (A) Graph $G$ has no minimum spanning tree (B) Graph $G$ has a unique minimum spanning tree of $\operatorname{cost}(n-1)$ (C) Graph $G$ has multiple distinct minimum spanning trees, each of cost $(n-1)$ (D) Graph $G$ has multiple spanning trees of different cost.
Programming and Data Structures
Divide and Conquer
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD