BSc CSIT (TU) Science Theory of Computation (BSc CSIT, CSC257) Question Paper 2074
This is the official BSc CSIT (TU) (Science stream) Theory of Computation (BSc CSIT, CSC257) question paper for 2074, 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 2074 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
Define finite automata. Construct a DFA that accepts all strings over {0, 1} having an even number of 0's and an even number of 1's. Show the transition table and transition diagram.
What is a Non-deterministic Finite Automaton (NFA)? Construct an NFA that accepts the set of strings over {0, 1} ending with '01' and convert it into an equivalent DFA using the subset construction method.
State and prove the Pumping Lemma for regular languages. Using it, prove that the language L = { a^n b^n | n >= 0 } is not regular.
Section B: Short Answer Questions
Attempt any EIGHT questions.
Define alphabet, string, and language with examples.
Differentiate between DFA and NFA.
Construct a DFA that accepts all binary strings ending with '00'.
Explain epsilon-closure with a suitable example.
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).