MA3001 · BS elective · 4 credits

Discrete Mathematics

Logic, sets, combinatorics, graphs and the discrete structures every computer scientist reasons about.

Instructor Prof. Meenakshi D'Souza Term As offered Prereq none

§ 1Calendar

  • Quiz 1—
  • Quiz 2—
  • End-term examination—

§ 2Previous Year Questions

No papers uploaded yet.

§ 3Resources

MA3001 · BS elective · 4 credits

Syllabus

The official course syllabus, transcribed from the IITM BS Data Science & Applications course booklet.

§ 1Course Description

This course introduces the mathematical foundations of Computer Science and Data Science, including sets, functions, sequences, logic, proofs, induction, recursion, combinatorics, relations, graph theory, and algebraic structures. This course shall develop the ability to model computational problems, reason rigorously, analyze discrete structures, and apply mathematical techniques to algorithms, data analysis, and real-world computing challenges.

Lectures-Tutorials-Practicals-Credits: 4-0-0-4

§ 2Faculty

  • Prof. Meenakshi D'Souza, Department of Computer Science and Engineering, IIIT Bangalore

§ 3Week-by-week

Week 1: Foundations of discrete mathematics; sets, set operations, functions, recursive functions, sequences, and summation techniques.

Week 12: Graph theory and algebraic structures; graphs, trees, semigroups, monoids, groups, homomorphisms, normal subgroups, and congruence relations.