Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10.

Size: px

Start display at page:

Download "Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10."

Rosa Booth
5 years ago
Views:

1 Code No: 134BD Set No. 1 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech. II Year II Sem., I Mid-Term Examinations, February FORMAL LANGUAGES AND AUTOMATA THEORY Objective Exam Name: Hall Ticket No. Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. A I Choose the correct alternative 1. Finite automata has [ ] A) Unlimited memory B) no memory at all C) limited memory D) None 2. PDA can recognize [ ] A) any grammar B) only CFG C) any unambiguous grammar D) only regular grammar 3. Given an arbitrary NFA with N states, the maximum number of states in an equivalent minimized DFA is at least [ ] A) N 2 B) N C) 2 N D) 2N 4. The recognizing capabilities of NDFSM and DFSM [ ] A) May be different B) must be same C) must be different D) none 5. The Union of two regular language is [ ] A) Regular B) Irregular C) Both A & B D) None 6. Which of the regular expression is not equivalent to the CFG S->aS bs a b [ ] A) (a+b) * B) (a+b) + C) (a+b)(a+b) * D) (a+b) * (a+b) 7. FORTRAN is a language. [ ] A) regular B) Context free C) context sensitive D) None 8. Which of the following regular expression identities are true? [ ] A) (r+s) * =r * B) (r * s * ) * = (r+s) * C) (r+s) * =r * +s * D) r * s * =r * +s * 9. Let S and T be languages over Σ={a,b} represented by the regular Expressions (a+b*)* and (a+b)* [ ] A) S T B) T S C) S =T D) S T=Ø 10. Which of the following is not a prefix of abc. [ ] A) Є B) a C) ab D) bc Cont.2

2 Code No: 134BD :2: Set No. 1 II Fill in the Blanks 11. Elimination of Є moves from NFA increases 12. For every context free language we can construct to accept the language. 13. In Moore machine represents the output alphabet. 14. NFA stands for 15. is a context free grammar to generate expression with balanced parenthesis. 16. If there is a unique LMD, the grammar is 17. Applying Pumping Lemma we can show that all languages are not regular (True/False). 18. Language L= {W/length (W) is prime} is 19. of a state is the set of states that can be reached by Є transitions. 20. The output in machine is associated with transition. -ooo-

3 Code No: 134BD Set No. 2 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech. II Year II Sem., I Mid-Term Examinations, February FORMAL LANGUAGES AND AUTOMATA THEORY Objective Exam Name: Hall Ticket No. Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. A I Choose the correct alternative 1. The recognizing capabilities of NDFSM and DFSM [ ] A) May be different B) must be same C) must be different D) none 2. The Union of two regular language is [ ] A) Regular B) Irregular C) Both A & B D) None 3. Which of the regular expression is not equivalent to the CFG S->aS bs a b [ ] A) (a+b) * B) (a+b) + C) (a+b)(a+b) * D) (a+b) * (a+b) 4. FORTRAN is a language. [ ] A) regular B) Context free C) context sensitive D) None 5. Which of the following regular expression identities are true? [ ] A) (r+s) * =r * B) (r * s * ) * = (r+s) * C) (r+s) * =r * +s * D) r * s * =r * +s * 6. Let S and T be languages over Σ={a,b} represented by the regular Expressions (a+b*)* and (a+b)* [ ] A) S T B) T S C) S =T D) S T=Ø 7. Which of the following is not a prefix of abc. [ ] A) Є B) a C) ab D) bc 8. Finite automata has [ ] A) Unlimited memory B) no memory at all C) limited memory D) None 9. PDA can recognize [ ] A) any grammar B) only CFG C) any unambiguous grammar D) only regular grammar 10. Given an arbitrary NFA with N states, the maximum number of states in an equivalent minimized DFA is at least [ ] A) N 2 B) N C) 2 N D) 2N Cont.2

4 Code No: 134BD :2: Set No. 2 II Fill in the Blanks 11. NFA stands for 12. is a context free grammar to generate expression with balanced parenthesis. 13. If there is a unique LMD, the grammar is 14. Applying Pumping Lemma we can show that all languages are not regular (True/False). 15. Language L= {W/length (W) is prime} is 16. of a state is the set of states that can be reached by Є transitions. 17. The output in machine is associated with transition. 18. Elimination of Є moves from NFA increases 19. For every context free language we can construct to accept the language. 20. In Moore machine represents the output alphabet. -ooo-

5 Code No: 134BD Set No. 3 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech. II Year II Sem., I Mid-Term Examinations, February FORMAL LANGUAGES AND AUTOMATA THEORY Objective Exam Name: Hall Ticket No. Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. A I Choose the correct alternative 1. Which of the regular expression is not equivalent to the CFG S->aS bs a b [ ] A) (a+b) * B) (a+b) + C) (a+b)(a+b) * D) (a+b) * (a+b) 2. FORTRAN is a language. [ ] A) regular B) Context free C) context sensitive D) None 3. Which of the following regular expression identities are true? [ ] A) (r+s) * =r * B) (r * s * ) * = (r+s) * C) (r+s) * =r * +s * D) r * s * =r * +s * 4. Let S and T be languages over Σ={a,b} represented by the regular Expressions (a+b*)* and (a+b)* [ ] A) S T B) T S C) S =T D) S T=Ø 5. Which of the following is not a prefix of abc. [ ] A) Є B) a C) ab D) bc 6. Finite automata has [ ] A) Unlimited memory B) no memory at all C) limited memory D) None 7. PDA can recognize [ ] A) any grammar B) only CFG C) any unambiguous grammar D) only regular grammar 8. Given an arbitrary NFA with N states, the maximum number of states in an equivalent minimized DFA is at least [ ] A) N 2 B) N C) 2 N D) 2N 9. The recognizing capabilities of NDFSM and DFSM [ ] A) May be different B) must be same C) must be different D) none 10. The Union of two regular language is [ ] A) Regular B) Irregular C) Both A & B D) None Cont.2

6 Code No: 134BD :2: Set No. 3 II Fill in the Blanks 11. If there is a unique LMD, the grammar is 12. Applying Pumping Lemma we can show that all languages are not regular (True/False). 13. Language L= {W/length (W) is prime} is 14. of a state is the set of states that can be reached by Є transitions. 15. The output in machine is associated with transition. 16. Elimination of Є moves from NFA increases 17. For every context free language we can construct to accept the language. 18. In Moore machine represents the output alphabet. 19. NFA stands for 20. is a context free grammar to generate expression with balanced parenthesis. -ooo-

7 Code No: 134BD Set No. 4 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech. II Year II Sem., I Mid-Term Examinations, February FORMAL LANGUAGES AND AUTOMATA THEORY Objective Exam Name: Hall Ticket No. Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 10. A I Choose the correct alternative 1. Which of the following regular expression identities are true? [ ] A) (r+s) * =r * B) (r * s * ) * = (r+s) * C) (r+s) * =r * +s * D) r * s * =r * +s * 2. Let S and T be languages over Σ={a,b} represented by the regular Expressions (a+b*)* and (a+b)* [ ] A) S T B) T S C) S =T D) S T=Ø 3. Which of the following is not a prefix of abc. [ ] A) Є B) a C) ab D) bc 4. Finite automata has [ ] A) Unlimited memory B) no memory at all C) limited memory D) None 5. PDA can recognize [ ] A) any grammar B) only CFG C) any unambiguous grammar D) only regular grammar 6. Given an arbitrary NFA with N states, the maximum number of states in an equivalent minimized DFA is at least [ ] A) N 2 B) N C) 2 N D) 2N 7. The recognizing capabilities of NDFSM and DFSM [ ] A) May be different B) must be same C) must be different D) none 8. The Union of two regular language is [ ] A) Regular B) Irregular C) Both A & B D) None 9. Which of the regular expression is not equivalent to the CFG S->aS bs a b [ ] A) (a+b) * B) (a+b) + C) (a+b)(a+b) * D) (a+b) * (a+b) 10. FORTRAN is a language. [ ] A) regular B) Context free C) context sensitive D) None Cont.2

8 Code No: 134BD :2: Set No. 4 II Fill in the Blanks 11. Language L= {W/length (W) is prime} is 12. of a state is the set of states that can be reached by Є transitions. 13. The output in machine is associated with transition. 14. Elimination of Є moves from NFA increases 15. For every context free language we can construct to accept the language. 16. In Moore machine represents the output alphabet. 17. NFA stands for 18. is a context free grammar to generate expression with balanced parenthesis. 19. If there is a unique LMD, the grammar is 20. Applying Pumping Lemma we can show that all languages are not regular (True/False). -ooo-

A Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 10.

A Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 10. Code No: 55050 Set No. 1 JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD III B.Tech. I Sem., I Mid-Term Examinations, September 2011 LINUX PROGRAMMING Objective Exam Name: Hall Ticket No. A Answer