Question 1

Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?

Accepted Answer

A) The set of all strings containing the substring 00. 
B) The set of all strings containing at most two 0's. 
C) The set of all strings containing at least two 0's. 
D) The set of all strings that begin and end with either 0 or 1. 
A) The set of all strings containing the substring 00. 
B) The set of all strings containing at most two 0's. 
C) The set of all strings containing at least two 0's. 
D) The set of all strings that begin and end with either 0 or 1.

Question 2

Consider the following context free languages:
L1 = {0^i 1^j 2^k | i+j = k}
L2 = {0^i 1^j 2^k | i = j or j = k}
L3 = {0^i 1^j | i = 2j+1}
Which of the following option is true?

Accepted Answer

A) L1, L2 and L3 can be recognized by Deterministic Push down automata 
B) L1, L2 can be recognized by Deterministic Push down automata 
C) L1, L3 can be recognized by Deterministic Push down automata 
D) None of the above 
A) L1, L2 and L3 can be recognized by Deterministic Push down automata 
B) L1, L2 can be recognized by Deterministic Push down automata 
C) L1, L3 can be recognized by Deterministic Push down automata 
D) None of the above

Question 3

Consider three decision problems P1, P2 and P3. It is known that P1 is decidable and P2 is undecidable. Which one of the following is TRUE?

Accepted Answer

A) P3 is decidable if P1 is reducible to P3 
B) P3 is undecidable if P3 is reducible to P2 
C) P3 is undecidable if P2 is reducible to P3 
D) P3 is decidable if P3 is reducible to P2's complement 
A) P3 is decidable if P1 is reducible to P3 
B) P3 is undecidable if P3 is reducible to P2 
C) P3 is undecidable if P2 is reducible to P3 
D) P3 is decidable if P3 is reducible to P2's complement

Question 4

Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least.

Accepted Answer

A) N^2 
B) 2^N 
C) 2N 
D) N! 
A) N^2 
B) 2^N 
C) 2N 
D) N!

Question 5

Match all items in Group 1 with correct options from those given in Group 2.
List I &emsp;List II
p. Regular Expression &emsp; 1. Syntax analysis
q. Push down automata &emsp; 2. Code Generation
r. Dataflow analysis &emsp; 3. Lexical analysis
s. Register allocation &emsp; 4. Code optimization

Accepted Answer

A) P-4. Q-1, R-2, S-3 
B) P-3, Q-1, R-4, S-2 
C) P-3, Q-4, R-1, S-2 
D) P-2, Q-1, R-4, S-3 
A) P-4. Q-1, R-2, S-3 
B) P-3, Q-1, R-4, S-2 
C) P-3, Q-4, R-1, S-2 
D) P-2, Q-1, R-4, S-3

Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)0(0+1)0(0+1)*?

Consider the following context free languages: L₁ = {0^i 1^j 2^k | i+j = k} L₂ = {0^i 1^j 2^k | i = j or j = k} L₃ = {0^i 1^j | i = 2j+1} Which of the following option is true?

Consider three decision problems P₁, P₂ and P₃. It is known that P₁ is decidable and P₂ is undecidable. Which one of the following is TRUE?

Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least.

Match all items in Group 1 with correct options from those given in Group 2. List I List II p. Regular Expression 1. Syntax analysis q. Push down automata 2. Code Generation r. Dataflow analysis 3. Lexical analysis s. Register allocation 4. Code optimization

Formal Languages and Automata Theory: Part A

Compiler Construction and Parsing Algorithms

Compilation and Programming Languages

Filters

Exam 2: Formal Languages and Automata Theory: Part B

Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)*0(0+1)*0(0+1)*?

Consider the following context free languages: L1 = {0^i 1^j 2^k | i+j = k} L2 = {0^i 1^j 2^k | i = j or j = k} L3 = {0^i 1^j | i = 2j+1} Which of the following option is true?

Consider three decision problems P1, P2 and P3. It is known that P1 is decidable and P2 is undecidable. Which one of the following is TRUE?

Given an arbitrary non-deterministic finite automaton (NFA) with N states, the maximum number of states in an equivalent minimized DFA is at least.

Match all items in Group 1 with correct options from those given in Group 2. List I List II p. Regular Expression 1. Syntax analysis q. Push down automata 2. Code Generation r. Dataflow analysis 3. Lexical analysis s. Register allocation 4. Code optimization

Formal Languages and Automata Theory: Part A

Compiler Construction and Parsing Algorithms

Compilation and Programming Languages

Filters

Which one of the following languages over the alphabet {0,1} is described by the regular expression: (0+1)0(0+1)0(0+1)*?

Consider the following context free languages: L₁ = {0^i 1^j 2^k | i+j = k} L₂ = {0^i 1^j 2^k | i = j or j = k} L₃ = {0^i 1^j | i = 2j+1} Which of the following option is true?

Consider three decision problems P₁, P₂ and P₃. It is known that P₁ is decidable and P₂ is undecidable. Which one of the following is TRUE?