BSc CSIT (TU) Science Theory of Computation (BSc CSIT, CSC257) Question Paper 2075
This is the official BSc CSIT (TU) (Science stream) Theory of Computation (BSc CSIT, CSC257) question paper for 2075, as set in the regular annual examination. It carries 60 full marks and a time allowance of 180 minutes, across 12 questions. On Kekkei you can attempt this Theory of Computation (BSc CSIT, CSC257) past paper online with a timer, get instant AI feedback and step-by-step solutions, and track the topics where you lose marks — completely free. Whether you are revising for your BSc CSIT (TU) Theory of Computation (BSc CSIT, CSC257) exam or solving previous years' question papers, this 2075 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
Define context-free grammar (CFG). Convert the following CFG into an equivalent grammar in Chomsky Normal Form (CNF): S -> ASA | aB, A -> B | S, B -> b | epsilon.
What is a Pushdown Automaton (PDA)? Design a PDA that accepts the language L = { a^n b^n | n >= 1 } and trace its moves for the string 'aabb'.
Define a Turing Machine formally. Design a Turing Machine that accepts the language L = { a^n b^n c^n | n >= 1 } and explain its working with a transition diagram.
Section B: Short Answer Questions
Attempt any EIGHT questions.
Write a regular expression for strings over {0,1} that contain at least one '0' and at least one '1'.
State Arden's theorem and explain its use in obtaining a regular expression from a finite automaton.
What is an ambiguous grammar? Show with an example that a grammar is ambiguous.
Eliminate left recursion from the grammar A -> Aa | b.
Explain the conversion of a CFG into Greibach Normal Form (GNF).
Define instantaneous description (ID) of a PDA and explain acceptance by final state and by empty stack.
Explain the working of a multi-tape Turing Machine.
What is a Universal Turing Machine? Explain its significance.
Differentiate between recursive and recursively enumerable languages.