MS 101 Algorithms Instructor Neelima Gupta nguptacs du

MS 101: Algorithms Instructor Neelima Gupta ngupta@cs. du. ac. in

Table of Contents About the course

Assumption/ Pre-requisite • Some exposure to – Algorithm development - at least sorting, searching and Graph Algorithms like DFS, BFS, MST, Djikstra’s Shortest Path. – Analysis of algorithms - at least sorting and searching ------- The Big O, Omega and Theta Notations – Proving the correctness of algorithms – Solving recurrence relations Those who do not have this background are requested to work harder in the initial weeks and come at par with the rest…If required we’ll review these topics in tutes.

Books • • • Jon Kleinberg and Eva Tardos, Algorithm Design, T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, Mc. Graw-Hill, 2002. Sara Baase, Computer Algorithms: Introduction to Design and Analysis, Addison Wesley, 1999 Vijay V. Vazirani, Approximation Algorithms, Springer-Verlag, France, 2006. F P Preparata and M I Shamos, Computational Geometry: An Introduction Springer, 1993.

Self Study • The course involves a lot of self-study. Off n On topics will be given for self-study which will be part of syllabus for exams.

The Course • Format – Three lectures/week – Four groups of Tutorials (details will follow) – Homework most weeks • Problem sets

Grading policy* – Homework Assignment : 15% – Minors : 35% – Major : 50% You’ll have to secure at least 40% marks in minors * Subject to change

Tutorial • • • Four groups will be formed. Group Leaders can be changed/rotated, if the need be First half an hr – students doubts will be taken( 2 marks out of 5 for attendance will be for the interaction during this period) Next half an hr – a problem will be given to be solved in 15 min + 15 min of evaluation ---- Please stick to time. . This will be graded, to be counted under homework assignment. Sometimes the problem/s may be given for home, but that’s only my decision. . No request will be granted in this regard. To be able to stick to timings. . I would request you to collect your doubts and mail to your group leader who will collect similar problems into one and mail the final list to me a day before at ngupta@cs. du. ac. in, FAILING which your doubts will not be taken up in the tutorial class.

ALL THE BEST