Solapur University MCA (Semester-IV) Paper on Finite Automata March 2019
| Sr. No. | Question |
| 1 | All possible subset of set is known as _______
(a) Sub set (b) Power set (c) Super set (d) None of these |
| 2 | Function which mapping one to one from input to output such function is known as _______ function
(a) Machine (b) State (c) Both (a) & (b) |
| 3 | Regular expression are
(a) Type 0 language (b) Type 1 language (c) Type 2 language (d) Type 3 language |
| 4 | Pumping lemma is used to proving given language is _____
(a) Irregular (b) Context sensitive (c) Restricted (d) None of these |
| 5 | If rightmost and leftmost production is single non-terminal then it is known as ______ production.
(a) Unit (b) Self (c) Cross (d) None of these |
| 6 | The language of PDA is _________
(a) Context free language (b) Regular language (c) Both (a) & (b) (d) None of these |
| 7 | A grammar that produce more than one parse tree for some sentence is called _______
(a) Context free (b) Regular (c) Ambiguous (d) None of these |
| 8 | The grammar in which right hand side production contains at most one non-terminal is called _______ grammer
(a) Context free (b) Context sensitive (c) Recursive (d) Regular |
| 9 | In PDA one situation has only one transition then it is known as ________
(a) TM (b) DPDA (c) NPDA (d) Stack |
| 10 | The _______ is accepted unrestricted grammar
(a) TM (b) PDA (c) DFA (d) None of these |
| 11 | The regular expression for Arden’s algorithm is
(a) Rij(K) (b) R=R+QP (c) R=Q+RP (d) None of these |
| 12 | PDA is more powerful than TM
(a) True (b) False |
| Published on 29th Sept 2021 | |
Leave a Reply