• Math for CS
• CS514 at IITG by R. Inkulu
• info   lectures

---

• This course is for first-year computer science grad students. It intends to review various discrete mathematical structures typically presented in undergrad courses. The topics to be covered are commonly used in every subarea of computer science: propositions, proof techniques and strategies, greatest common divisor, prime numbers, congruences, primality testing, equivalence relations, partial orderings, cardinality of sets, asymptotic growth of functions, recurrences, special sequences and summations, generating functions, partial recursive functions, principles of counting, pigeonhole principle, occupancy problems, combinatorial arguments, special numbers, discrete random variables, discrete probability distributions, tail bounds, and all these are motivated by famous problems and theorems.



Instructor


• R. Inkulu
  
  rinkulu at iitg dot ac dot in
  
  Office: H-005. To meet, please email beforehand.
  


Prerequisites


• High school math, and any elementary course on discrete math in undergrad studies.


Schedule of lectures


• Slot ?:
  
  Academic Calendar
  
  There could be at most four additional lectures; videos of these will be posted on MS Stream.
  
  Classroom: ?.


Teaching Assistants


• ?,   ?,   ?.
  


Texts


• See here.


Grading (6 credits)


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



• exam1	15 points	10 am to 11:30 am on 17th Aug (Sat) am in ?
  mid-sem	18	2 hours; refer to institute time table
  exam3	20	10 am to 12 pm on 19th Oct (Sat) in ?
  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	-

---