1 / 8

MCA 301: Design and Analysis of Algorithms

MCA 301: Design and Analysis of Algorithms. Instructor Neelima Gupta ngupta@cs.du.ac.in. Table of Contents. About the course Mathematical Induction Asymptotic Notation. Assumption/ Pre-requisite. Some exposure to Algorithm development - at least sorting and searching

lis
Télécharger la présentation

MCA 301: Design and Analysis of Algorithms

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. MCA 301: Design and Analysis of Algorithms Instructor Neelima Gupta ngupta@cs.du.ac.in

  2. Table of Contents • About the course • Mathematical Induction • Asymptotic Notation

  3. Assumption/ Pre-requisite • Some exposure to • Algorithm development - at least sorting and searching • Growth Functions: The Big O, Omega and Theta Notations • Mathematical Induction • Solving recurrence relations We will review these topics but will go a little fast … Those who do not have this background are requested to work harder in the initial weeks and come at par with the rest

  4. The Course • Purpose: a rigorous introduction to the design and analysis of algorithms • Not a lab or programming course • Not a math course, either • Textbook: • Introduction to Algorithms, Cormen, Leiserson, Rivest, Stein, second edition, a good book you must have in your library • Introduction to Algorithms : Saara Base • 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.

  5. The Course • Format • Three lectures/week • Two groups of Tutorials (details will follow) • Homework most weeks • Problem sets • Maybe occasional programming assignments • Two Minors + one final exam(Major)

  6. Grading policy • Homework Assignment : 15% • Minor 1: 15% • Minor 2: 15% • Major : 50% • Attendance : 5%

  7. Tutorial • Group 1 : Roll No 1-15, Group leader – Roll No 1 • Group 2 : Roll No 16-30, Group leader – Roll No 16 • Group Leaders can be changed/rotated, if the need be • Tute 1– students doubts will be taken • Tute 2– a problem will be given to be solved. 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.

  8. ALL THE BEST

More Related