Theory of computation
Previous year question paper with solutions for Theory of computation
Our website provides solved previous year question paper for Theory of computation . Doing preparation from the previous year question paper helps you to get good marks in exams. From our TOC question paper bank, students can download solved previous year question paper. The solutions to these previous year question paper are very easy to understand.
These Questions are downloaded from www.brpaper.com You can also download previous years question papers of 10th and 12th (PSEB & CBSE), B-Tech, Diploma, BBA, BCA, MBA, MCA, M-Tech, PGDCA, B-Com, BSc-IT, MSC-IT.
Print this page
- Define context sensitive language.
- Give formal definition of Turing Machine.
- What are context free languages?
- What is post correspondence problem?
- Define terminal and non-terminal symbol.
- What is Griebach Normal Form?
- Give example of language that is recursive
- How Turing machine is different from FA and PDA in terms of capability?
- Define Decidability.
- Define Transition system.
- Construct a Grammar which generates all even integer’s upto 998.
- If each of the production in a grammar has some variable on its RHS, what can you say about L(G)?
- Describe the following set by Regular Expression {01,10}
- Define a Derivation Tree.
- Compare the computational powers of Pushdown Automata and Finite Automata.
- Define LR(k) grammars
- Define Pumping Lemma.
- Give two properties of Regular Languages
- Give the representation of Turing machine by Instantaneous Descriptor
- Define Finite Automaton
- What are various properties of transition function?
- Define grammar and language
- Differentiate between left and right context in languages
- Define yield and ambiguity in CFG
- Give example of NULL and UNIT productions
- Define PDA
- Define the term acceptability in PDA
- Give instantaneous description of turing machine
- Differentiate between DFA and NDFA