Neelima Gupta
Department of Computer Science, University of Delhi
Teaching Time Table Calendar
Teaching at Epitech
Courses Taught During July 2013  November 2013
Syllabus
Fundamental Concepts: What is a graph (vertices, edges, neighbors, complement, coloring, connected components; Matrix representation (Isomorphism, subgraphs, bipartite, simple; complete and planer graphs); Paths, cycles, and trails; Bipartite graphs, Konig's theorem; Vertex Degrees and counting (Degree sequences); Directed graphs (outdegree, indegree, orientation, tournaments).
Reading Material:
Lecture Notes Under Construction

Lecture Notes Under Construction 
Course Taught During January 2013  May 2013
Syllabus
Overview: Counting, pegionhole principle, generating functions, recurrence relations, linear
recurrence relations with constant coefficients, homogenous solutions, particular solutions,
total solutions, solution by the method of generating functions. References
Lecture Notes of 2012 
Courses Taught During July 2012  November 2012
Syllabus
References
Lecture Notes of 2012

(NP Completeness and Approximation Algorithms) Syllabus
References
Lecture Notes of 2012 
Subjects Taught Previously
Undergraduate Level
 1989  2002: Systems Analysis and Design, Computer System Architecture, Programming languages from COBOL, Pascal to C, Discrete Structures, Data Structures, Algorithms, Theory of Computation/ Automata Theory, Statistical Techniques
Postgraduate Level
 2002  till date: Systems Programming, Data Communication and Computer Networks, Design and Analysis of Algorithms, Algorithms in Bioinformatics, NP Completeness and Approximation Algorithms.
MCS 101: Design and Analysis of Algorithms
Syllabus
References
Lecture Notes of 2011

Contents
References
Some Lecture Notes of Previous Years
