Teachings
"The thing I loved the most - and still love the most about teaching - is that you can connect with an individual or a group, and see that individual or group exceed their limits."
— Mike Krzyzewski
Graduate Courses for MS/PhD in Computer Science (MSCS/PhDCS)
The following courses are those that are regularly handled by the laboratory. Further details on the courses can also be found at the university course catalog.
Download: MSCS/PhDCS Curriculum
CS 204 - Theory of Computation
CS 208 - Complexity Theory
CS 210 - Advanced Algorithms and Data Structures
CS 214 - Parallel Algorithms
CS 290 - Advanced Topics in Theoretical Computer Science
Algorithmics for Hard Problems (2nd Sem, AY 2008-2009)
Grammar, communication, and languages (2nd Sem, AY 2009-2010)
Models of computation and complexity measures (2nd Sem, AY 2010-2011)
CS 297 - Special Topics
Models for biological processes (1st Sem, AY 2007-2008)
Computer aided argumentation and non-monotonic reasoning (1st Sem, AY 2008-2009)
Data visualization (2nd Sem, AY 2008-2009)
Automata, grammar, and communication (1st Sem, AY 2009-2010)
Special topics in communication complexity (2nd Sem, AY 2009-2010)
Formal models and computability (2nd Sem, AY 2010-2011)
Communication complexity (2nd Sem, AY 2011-2012)
Natural computing and process calculi (2nd Sem, AY 2013-2014)
Formal models and computability (1st Sem, AY 2014-2015
CS 301 - Communication Complexity
CS 315 - Algorithms in Bioinformatics
CS 397 - Special Topics
Models of computations (1st Sem, AY 2011-2012)
Natural and unconventional computing models (1st Sem, AY 2012-2013)
Undergraduate Courses for BS in Computer Science (BSCS)
The following undergraduate courses are regularly handled by the laboratory. Further details on the courses can also be found at the university course catalog.
Download: BSCS Curriculum
CS 30 - Discrete Mathematics for Computer Science I
CS 31 - Discrete Mathematics for Computer Science II
CS 32 - Data Structures and Algorithms I
CS 33 - Data Structures and Algorithms II
CS 130 - Mathematical Methods in Computer Science
CS 133 - Automata Theory and Computability
CS 135 - Algorithm Design and Analysis
CS 165 - Database Systems
CS 198 - Special Problems I
CS 199 - Special Problems II