The document provides information about the Theory of Computation course offered as part of the B.Tech program. The course aims to teach students about basic concepts of automata theory including finite automata, regular languages and expressions, context free grammars, pushdown automata, and Turing machines. The course is divided into 5 units that cover these topics over 45 instructional hours. The expected learning outcomes are for students to understand theoretical concepts of automata, apply automata to regular languages, apply context free grammar normalization, understand PDA and Turing machines, and apply concepts of decidability and tractability. References for two textbooks and three other reference books are also provided.