Question 1

Choose the incorrect statement:

Accepted Answer

A) (a+b)aa(a+b)generates Regular language. 
B) A language consisting of all strings over ?={a,b} having equal number of a's and b's is a regular language 
C) Every language that can be expressed by FA can also be expressed by RE 
D) None of these 
A) (a+b)aa(a+b)generates Regular language. 
B) A language consisting of all strings over ?={a,b} having equal number of a's and b's is a regular language 
C) Every language that can be expressed by FA can also be expressed by RE 
D) None of these

Question 2

Consider three problems P1, P2 and P3. It is known that P1 has polynomial time solution and P2 is NP-complete and P3 is in NP. Which one of the following is true.

Accepted Answer

A) P3 has polynomial time solution if P1 is polynomial time reducible to P3 
B) P3 is NP complete if P3 is polynomial time reducible to P2 
C) P3 is NP complete if P2 is reducible to P3 
D) P3 has polynomial time complexity and P3 is reducible to P2 
A) P3 has polynomial time solution if P1 is polynomial time reducible to P3 
B) P3 is NP complete if P3 is polynomial time reducible to P2 
C) P3 is NP complete if P2 is reducible to P3 
D) P3 has polynomial time complexity and P3 is reducible to P2

Question 3

Which one of the following is the strongest correct statement about a finite language Lover a finite alphabet ??

Accepted Answer

A) L is undecidable 
B) L is recursive 
C) L is a CSL 
D) L is a regular set 
A) L is undecidable 
B) L is recursive 
C) L is a CSL 
D) L is a regular set

Question 4

Which of the following statements are TRUE?
(1) The problem of determining whether there exists a cycle in an undirected graph is in P.
(2) The problem of determining whether there exists a cycle in an undirected graph is in NP.
(3) If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.

Accepted Answer

A) 1, 2 and 3 
B) 1 and 2 only 
C) 2 and 3 only 
D) 1 and 3 only 
A) 1, 2 and 3 
B) 1 and 2 only 
C) 2 and 3 only 
D) 1 and 3 only

Question 5

The set strings of 0's and 1's with atmost one pair consecutive one's-

Accepted Answer

A) (0+1)*(01)(10)(0+1)* 
B) (0+1)*(01)*(10)(0+1)* 
C) (0+1)*(01)(10)*(0+1)* 
D) (0+!)(01)*(10)*(0+1) 
A) (0+1)*(01)(10)(0+1)* 
B) (0+1)*(01)*(10)(0+1)* 
C) (0+1)*(01)(10)*(0+1)* 
D) (0+!)(01)*(10)*(0+1)

Choose the incorrect statement:

Consider three problems P1, P2 and P3. It is known that P1 has polynomial time solution and P2 is NP-complete and P3 is in NP. Which one of the following is true.

Which one of the following is the strongest correct statement about a finite language Lover a finite alphabet ??

The set strings of 0's and 1's with atmost one pair consecutive one's-

Formal Languages and Automata Theory: Part A

Formal Languages and Automata Theory: Part B

Computational Theory : Grammar, Language, and Complexity

Automata and Turing Machines

Filters

Exam 4: Omputer Science and Theory of Computation

Choose the incorrect statement:

Consider three problems P1, P2 and P3. It is known that P1 has polynomial time solution and P2 is NP-complete and P3 is in NP. Which one of the following is true.

Which one of the following is the strongest correct statement about a finite language Lover a finite alphabet ??

The set strings of 0's and 1's with atmost one pair consecutive one's-

Formal Languages and Automata Theory: Part A

Formal Languages and Automata Theory: Part B

Computational Theory : Grammar, Language, and Complexity

Automata and Turing Machines

Filters