Theory of Computation (CSC 262) is a core Fourth Semester subject in Tribhuvan University’s BSc CSIT program (current / new course code). It covers automata theory and formal languages—finite automata, regular expressions, context-free grammars, push-down automata, Turing machines, and undecidability/intractability—with programming labs for DFA/NFA/PDA/TM.
On this page you’ll find the official CSC 262 syllabus. Downloadable notes PDFs will be added when a reliable CSIT notes set is available (CSIT Tutor currently lists syllabus and past papers only for this subject).
Note: Older batches may still see CSC 257 on past papers; the syllabus content is largely the same. CSC 262 is the current code under the revised grading system.
What you’ll learn
- Sets, alphabets, strings, and languages as foundations for automata
- DFA, NFA, ε-NFA, Moore/Mealy machines, and minimization
- Regular expressions, pumping lemma, and regular-language properties
- CFG/CFL, parse trees, CNF/GNF, and push-down automata
- Turing machines, Church–Turing thesis, undecidability, and complexity basics
Course snapshot
- Code: CSC 262 (current) · formerly CSC 257
- Program: BSc CSIT · Fourth Semester
- Board: Tribhuvan University (IOST)
- Nature: Theory + Lab · Credit hours: 3
- Marks: 60 (theory) + 20 (practical) + 20 (internal)
Start with the syllabus for unit-wise hours. Share or contribute notes if you have a solid TOC PDF for CSIT.