Multiple Choice
Consider the following two problems on undirected graphs:
?: Given G(V,E) , does G have an independent set of size |v|-4?
?: Given G(V,E) , does G have an independent set of size 5?
Which one of the following is TRUE?
A) ? is in P and ? is NP-complete
B) ? is NP complete and ? is in P
C) Both ? and ? are NP-complete
D) Both ? and ? are in P
Correct Answer:
Verified
Correct Answer:
Verified
Q3: Consider the languages: L<sub>1</sub> ={a^n b^n c^m
Q4: Consider the languagesL<sub>1</sub>={0^{i}1^{j}|i != j},L<sub>2</sub>={0^{i}1^{j}|i = j},L<sub>3</sub>
Q5: Let L<sub>1</sub> be a recursive language. Let
Q6: A minimum state deterministic finite automation accepting
Q7: If s is a string over (0
Q9: Consider the set of strings on
Q10: For S € (0+1)* let d(s)denote the
Q11: Consider the language L<sub>1</sub>,L<sub>2</sub>,L<sub>3</sub> as given below.<br>L<sub>1</sub>={0^{p}1^{q}
Q12: Consider the following statements about the context
Q13: The minimum state automaton equivalent to the