• Discrete Mathematics
• CS201 at IITG by R. Inkulu

---

• Proofs
  • Propositions      [R]:
  • A few proof techniques      [R]:
  • A few proof strategies      [R]:
  • More on quantifiers      [R]: 33-35, 43-51, 60-68




• --- as the course progress, topics covered in lectures are listed here ---



---



• This is a core course for second-year undergrads. It introduces basic discrete mathematical structures commonly used across all subareas of computer science while emphasizing proofs. The significant topics covered include the following -
  
  Proof techniques, equivalence relations, partially ordered sets, (in)finite sets, (un)countable sets, special functions, asymptotic growth of functions, setting up recurrences, solving recurrences, generating functions, counting principles, special numbers, discrete probability, and graph theory.
  
  All through, these are all motivated by famous problems and theorems.



• Texts:
• Discrete Mathematics and its Applications by Kenneth H. Rosen, Eighth Edition.   [R]
• Introduction to Graph Theory by Douglas B. West, Second Edition.   [W]
• [Additional resources are provided where necessary.]


• Prereqs: High school math, CS101.


• Lectures are held in 5104 in Slot A: Tue 9-9:55 am, Wed 10-10:55 am, Th 11-11:5510-10:55 am.
  
• The academic calendar is here.


• Teaching Assistants: aditis1001@, anandps@, vishnu.g@, h.simhadri@, j.architha@.
• The set of guidelines for TAs is here.


• The grading is relative, and it is based on the total marks obtained in the following:
  
  

  exam1	14 points	10 am to 11:40 am on 16th Aug (Sat) in 5001 & 5002
  mid-sem	18	2 hours; refer to institute time table
  exam3	15	10 am to 11:40 am on 18th Oct (Sat) in 5001 & 5002
  end-sem	25	3 hours; refer to institute time table
  surprise (4 to 6)	3*(≥4)	15 minutes each; not scheduled beforehand
  homework	0	one/two problems posted after every lecture
  class participation	4	-

• Attendance at each lecture, out of 125 registrants, is here.

---