BSc CSIT (TU) Science Theory of Computation (BSc CSIT, CSC257) Question Paper 2078
This is the official BSc CSIT (TU) (Science stream) Theory of Computation (BSc CSIT, CSC257) question paper for 2078, 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 2078 paper is a great way to practise under real exam conditions.
Section A: Long Answer Questions
Attempt any TWO questions.
State the Halting Problem of a Turing Machine. Prove that the Halting Problem is undecidable. Differentiate between decidable and undecidable problems with examples.
Explain the Chomsky hierarchy of languages with the corresponding grammars and recognizing machines. Discuss the closure properties of context-free languages.
Define the complexity classes P and NP. Explain NP-completeness and the concept of polynomial-time reduction with the example of the Satisfiability (SAT) problem.
Section B: Short Answer Questions
Attempt any EIGHT questions.
What is a Universal Turing Machine? Explain its significance.
Differentiate between recursive and recursively enumerable languages.
Define Mealy and Moore machines and differentiate between them.
Explain the closure properties of regular languages.
What is the membership problem? Explain the CYK algorithm in brief.
Construct an NFA for the regular expression (0+1)*1.
Explain Rice's theorem in brief.
Define alphabet, string, and language with examples.
Differentiate between DFA and NFA.