Instructor: Purandar Bhaduri
Email: pbhaduri
Phone: ext 2360
Teaching Assistants: TBD
Syllabus
- Set theory: sets, relations, partially ordered sets, functions, countability, Lattices and Boolean algebras
- Logic: formulae, interpretations, methods of proof, soundness and completeness in propositional and predicate logic
- Combinatorics: permutations, combinations, partitions, recurrences, generating functions. Catalan, Fibonacci, harmonic and Stirling numbers
- Graph Theory: paths, connectivity, subgraphs, isomorphism, trees, complete graphs, bipartite graphs, matchings, colourability, planarity, digraphs
Resources
- Textbooks:
- Mathematics for Computer Science by Eric Lehman, F. Thomson Leighton, and Albert R. Meyer, 2018. It can be freely downloaded from the given link.
- A Walk Through Combinatorics: An Introduction To Enumeration And Graph Theory by Miklos Bona, 4th Edition, World Scientific, 2016.
- Online Resources:
- Notes on Set Theory for Computer Science by Glynn Winskel.
- Lecture Notes by Stephen Cook CSC 438F/2404F: Computability and Logic Fall, 2017. We will use the part on Propositional Calculus and Predicate Calculus.
- MIT OpenCourseWare - Mathematics for Computer Science based on the first textbook.
Evaluation
- Quizzes: 15%
- Midsem: 35%
- Endsem: 50%
Contact
For any questions regarding the course, use the MS Teams group for this class. You can also schedule an appointment in my office by email.