Home
|
Research
|
Teaching
MA 351 Theory of Computation (L-T-P-C:4-0-0-8)
Course Syllabus:
MA 351
Course Instructor:
K. V. Krishna
, Office: E-208, Phone No: 2605
Texts/References:
J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Narosa, 1995.
H. R. Lewis and C. H. Papadimitriou, Elements of the Theory of Computation, Pearson Education, 1998.
M. Sipser, Introduction to the Theory of Computation, Thomson, 2004.
P. Linz, An Introduction to Formal Languages and Automata, Narosa, 2007.
D. C. Kozen, Automata and Computability, Springer-Verlag, 1997.
Lecture Timings and Venue:
C1 Slot ( Mon: 1500-1555, Tue: 1400-1455, Thu: 1700-1755, Fri: 1600-1655)
Room No. 5104
Evaluation Policy:
Exam
Weightage
Date
Time
Quiz-1
: 10 %
: 27-Jan-25
: 1800-1855
Quiz-2
: 10 %
: 07-Feb-25
: 1800-1855
Mid-Sem. Exam
: 20 %
: 26-Feb-25
: 1400-1600
Quiz-3
: 10 %
: 21-Mar-25
: 1800-1855
Quiz-4
: 10 %
: 07-Apr-25
: 1800-1855
End-Sem. Exam
: 30 %
: 30-Apr-25
: 1400-1700
Classroom assessment: 10%
Academic Calendar:
For the year 2025
Attendance (as on 26/01/2025):