This course is an advanced form of an introductory algorithms course, and is meant to have a thorough grounding in core Algorithms required for pursuing PG degree in Computer Science. The course covers topics such as asymptotic notation, recurrence relation, graph algorithms, heaps, dynamic programming, greedy algorithms, divide and conquer, NP-completeness where the undergraduate contents of each topic is first reviewed in a fast-paced manner, and is followed by some advanced content.

- Undergraduate Algorithms course

Open only to M.Tech. and Ph.D. students (recommended for students with inadequate background in Algorithms).

1. The student is able to design and analyse algorithms using techniques like divide and conquer, greedy and dynamic programming.

2. The student is able to use standard data structures like heaps, trees and graphs for designing algorithms.

3. The student is able to prove NP-completeness of problems using reductions.

4. The student is familiar with modern techniques to handle intractable problems like randomization, approximation, backtracking search.

Evaluation will be based on in-class short online quizzes (to be taken during lectures and tutorials), group homeworks, closed-book online proctored midsem and endsem exams. We will follow a flexible policy to let students focus more on exams or homeworks, as per their choice.

The following algorithm will be used to calculate your cumulative score out of a **total 100**.

**QUIZ**: 10 highest quiz scores, each worth 1%**HOMEWORKA (before midsem)**:- Done in a group of 2: 12 highest HQ scores before midsem, each worth 1.5%
- Done individually: 9 highest HQ scores before midsem, each worth 2%

**HOMEWORKB**: 8 highest HQ scores after midsem, each worth 1.5%- Done in a group of 2: 12 highest HQ scores before midsem, each worth 1.5%
- Done individually: 6 highest HQ scores before midsem, each worth 2%
**MIDSEM**: worth 25%**ENDSEM**: worth 35%- To pass the course, at least 30% overall and at least 30% in the largest of midsem & endsem is required.

Quizzes during lectures will happen via Google Forms and are of short duration (2-5 minutes). They are used to test if students are following the concept. There could be multiple quizzes (or, none) in a lecture and the average score of an individual will be used as the final score for that quiz.

All office hours will take place on the Meet Link given on Classroom.

**Debajyoti Bera -** dbera@

**Debnath Kundu** - debnath22026@

**Akshara Nair** - akshara22008@