Home
|
Research
|
Teaching
MA 519 Complexity Theory (L-T-P-C:3-0-0-6)
Course Syllabus:
MA 519
Course Instructor:
K. V. Krishna
, Office: E-208, Phone No: 2605
Texts/References:
M. Sipser, Introduction to the Theory of Computation, Thomson Asia, 1997.
J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Narosa, 1979.
C. H. Papadimitriou, Computational Complexity, Addison-Wesley, 1994.
Lecture Timings:
A1 Slot
Venue:
2101
Evaluation Policy:
Exam
Weightage
Date
Time
Quiz-1
: 10 %
:
:
Quiz-2
: 10 %
:
:
Mid-Sem. Exam
: 20 %
: 26-Feb-2023
: 1400-1600
Quiz-3
: 10 %
:
:
Quiz-4
: 10 %
:
:
End-Sem. Exam
: 30 %
: 06-May-2023
: 1400-1700
Assignments
: 10 %
Academic Calendar:
For the year 2023