Program: _Information Technology_ Engineering Curriculum Scheme: Rev2016/2012 Examination: First/Second/Third/Final Year Semester I/II/III/IV/V/VI/VII/VIII Course Code: _____ and Course Name: ____ Time: 1 hour Max. Marks: 50 ===================================================================== For the students:- All the Questions are compulsory and carry equal marks . Q1. Grammar that produce more than one Parse tree for same sentence is ___________ Option A: Ambiguous Option B: Unambiguous Option C: Complementation Option D: Concatenation Intersection Q2. Automaton accepting the regular expression of any number of a’ s is ___________ Option A: a* Option B: ab* Option C: (a/b)* Option D: a*b*c Q3. Grammars that can be translated to DFAs is ___________ Option A: Left linear grammar Option B: Right linear grammar Option C: Generic grammar Option D: All of the mentioned Q4. Which of the following allows stacked values to be sub-stacks rather than just finite symbols? Option A: Push Down Automaton Option B: Turing Machine Option C: Nested Stack Automaton Option D: None of the mentioned Q5. A non deterministic two way, nested stack automaton has n-tuple definition. State the value of n. Option A: 5 Option B: 8 Option C: 4 Option D: 10 Q6. A non deterministic two way, nested stack automaton has n-tuple definition. State the value of n. Option A: Embedded PDA Option B: Nested Stack automata Option C: DPDA Option D: Counter Automaton Q7. Which of the following language accepted by a Push down Automata? 1 | Page Option A: Type0 Option B: Type1 Option C: Type2 Option D: Type3 Q8. Given the following statements: (i) Recursive enumerable sets are closed under complementation. (ii) Recursive sets are closed under complements. Which is/are the correct statements? Option A: I only Option B: II only Option C: Both I and II Option D: Neither I nor II Q9. A push down automaton employs ________ data structure. Option A: Queue Option B: Linked List Option C: Hash Table Option D: Stack Q10. The value of n if turing machine is defined using n-tuples: Option A: 6 Option B: 7 Option C: 8 Option D: 5 Q11. RASP stands for: Option A: Random access storage program Option B: Random access stored program Option C: Randomly accessed stored program Option D: Random access storage programming Q12. Which of the following is not true about RASP? Option A: Binary search can be performed more quickly using RASP than a turing machine Option B: Stores its program in memory external to its state machines instructions Option C: Has infinite number of distinguishable, unbounded registers Option D: Binary search can be performed less quickly using RASP than a turing machine Q13. An FSM can be used to add how many given integers ? Option A: 1 Option B: 3 Option C: 4 Option D: 2 Q14. L = {aP | p ; } is prime is Option A: Regular Option B: not regular Option C: accepted by DFA Option D: accepted by PDA 2 | Page Q15. The basic limitation of finite automata is that Option A: It can’t remember arbitrary large amount of information. Option B: It sometimes recognize grammar that are not regular. Option C: It sometimes fails to recognize regular grammar. Option D: All of the mentioned Q16. Finite automata requires minimum _______ number of stacks. Option A: 1 Option B: 0 Option C: 2 Option D: 3 Q17. Assume the statements S1 and S2 given as: S1: Given a context free grammar, there exists an algorithm for determining whether L (G) is infinite. S2: There exists an algorithm to determine whether two context free grammars generate the same language. Which of the following is true? Option A: S1 is correct and S2 is not correct Option B: Both S1 and S2 are correct Option C: Both S1 and S2 are not correct Option D: S1 is not correct and S2 is correct Q18. δ*(q,ya) is equivalent to : Option A: δ((q,y),a) Option B: δ(δ*(q,y),a) Option C: δ(q,ya) Option D: independent from δ notation Q19. String X is accepted by finite automata if . Option A: δ*(q,x) E A Option B: δ(q,x) E A Option C: δ*(Q0,x) E A Option D: δ(Q0,x) E A Q20. Regular expression for all strings starts with ab and ends with bba is. Option A: aba*b*bba Option B: ab(ab)*bba Option C: ab(a+b)*bba Option D: ab+ab+ab Q21. If P & R are regular and also given that if PQ=R, then? Option A: Q has to be regular Option B: Q cannot be regular Option C: Q need not be regular Option D: Q has to be a CFL 3 | Page Q22. Consider the grammar given below E? E+E | E*E | E-E | E/E | E^E | (E) | id Assume that + and ^ have the same but least precedence, * and / have the next higher precedence but the same precedence and finally ^ has the highest precedence. Assume + and ^ associate to the left like * and / and that ^ associates to the right. Choose the correct for the ordered pairs (^,^), (-,-), (+,+), (*,*) in the operator precedence table constructed for the grammar. Option A: All < Option B: All > Option C: < >, = Option D: < > > > Q23. There are ________ tuples in finite state machine. Option A: 4 Option B: 5 Option C: 6 Option D: Unlimited Q24. Transition function maps. Option A: Σ * Q -> Σ Option B: Q * Q -> Σ Option C: Σ * Σ -> Q Option D: Q * Σ -> Q Q25. Number of states require to accept string ends with 10. Option A: 3 Option B: 2 Option C: 1 Option D: Can’t be represented 4 | Page .