**1) Context free Grammar is ?**

**a. A Compiler**

**b. A language expression**

**c. A regular expression**

**d. None of these**

** **

**Answer = B**

**Explanation: Context free Grammar generate the context free languages. These are defined by the rule of the form A -> b Where A a non terminal and b is the string of terminals.**

**2) The idea of an automation with a stack as auxiliary storage… ?**

**a. Finite automata**

**b. Push down automata**

**c. Deterministic automata**

**d. None of these**

** **

**Answer = B**

**Explanation: Push down automata manipulate the stack, as a part of performing a transition.**

**3) A Pushdown automata is…..if there is at most one transition applicable to each configuration ?**

**a. Deterministic**

**b. Non Deterministic**

**c. Finite**

**d. Non Finite**

** **

**Answer = A**

**Explanation:If in every situation only one transition is available as continuation of computation, then the result is a deterministic push down automation (DPDA).**

**4) The graphical representation of the transition of finite automata is ?**

**a. Finite diagram**

**b. State diagram**

**c. Node diagram**

**d. E-R diagram**

** **

**Answer = B**

**Explanation: State diagram is called the graphical representation of Finite automata.**

**5) If two sets A and B have no common elements i.e (A intersection B) has no element then such sets are known as ?**

**a. Intersection**

**b. Union**

**c. Disjoint**

**d. Complement**

** **

**Answer = C**

**Explanation:If two sets have no element in common then they are called disjoint sets.**

**6) The domain D of the relation R is defined as the…. ?**

**a. Set of all elements of ordered pair which belongs to R**

**b. Set of all last elements of ordered pair which belongs to R**

**c. Set of all first elements of ordered pair which belongs to R**

**d. None of these**

** **

**Answer = C**

**7) ‘A language is regular if and only if it is accepted by a finite automation’ ?**

**a. The given statement is true**

**b. The given statement is false**

**c. The given statement is partially true**

**d. Sometime true, sometimes false**

** **

**Answer = A**

**Explanation: A regular language is accepted by the finite automation. Every regular language is context free.**

**8) Which of the following does not belong to the context free grammer?**

**a. Terminal symbol**

**b. Non-terminal symbol**

**c. Start symbol**

**d. End symbol**

** **

**Answer = D**

**Explanation:Context free grammar consist of terminal symbols, non terminal symbols, set of production rules, a start symbol but does not have any End symbol.**

**9) A regular grammar is a….. ?**

**a. Context free grammar**

**b. Non context free grammar**

**c. English grammar**

**d. None of above**

** **

**Answer = A**

**Explanation: Regular grammar is context free grammar. Such a grammar restricts its rules to a single non terminal on the left hand side and right hand side consisting of a single terminal.**

**10) The context free language are closed under… ?**

**a. Union**

**b. Kleene star**

**c. Concatenation**

**d. All of above**

** **

**Answer = D**

**Explanation: Context free language is closed under union, kleene star and concatenation.**