Neeldhara
  • About
  • Research
    • Overview
    • People
    • Publications
    • Surveys
  • Teaching
    • Courses
    • Materials
  • Lists
    • Puzzles
    • Bookmarks
  • Exposition
    • Talks
    • Videos
  • Events
  • Blog

NPTEL | CS82 | Jan-Apr 2022

CS614. Advanced Algorithms

January — April 2023
About the Course

This is a course on algorithm design with a focus on issues of modeling and implementation. Each lecture will be focused entirely on one or two problems that reveal the use of a specific algorithmic technique. The techniques themselves are chosen to be in line with those covered in existing NPTEL courses on data structures and algorithms, so that students who complete those courses can find in this course a natural follow up.

Target Audience

This course is intended for anyone who wants to deepen their appreciation for algorithmic techniques that they have learned in a foundational course and/or would like to take a first step towards preparing for coding competitions such as the ICPC.

Prerequisites

This course assumes some background in the design and analysis of algorithm and a working familiarity with some programming language. Knowing C++ is useful but not required.

References

Books.

  1. Algorithms by Jeff Erickson
  2. Open Data Structures by Pat Morin
  3. Algorithms Illuminated by Tim Roughgarden
  4. Algorithm Design by J. Kleinberg and E. Tardos
  5. Problem Solving with Algorithms and Data Structures using C++ by Brad Miller, David Ranum, and Jan Pearce
  6. Problem Solving with Algorithms and Data Structures using Python by Brad Miller and David Ranum
  7. Think Data Structures by Allen B. Downey
  8. Some introductory notes on Design and Analysis of Algorithms (PDF) by Venkatesh Raman
  9. Competitive Programming (4th Edition) by Steven Halim, Felix Halim, and Suhendry Effendy
  10. Competitive Programmer’s Handbook by Antti Laaksonen

Other NPTEL Courses.

  1. DSA with Python by Madhavan Mukund
  2. DSA by Naveen Garg

YouTube Channels.

  1. Codechef
  2. Errichto
  3. William Lin
  4. William Fiset

Visualizations.

  1. Visualgo
  2. OpenDSA

Blogs.

  1. Petr Mitrichev
Timings and Venue

Lectures are pre-recorded. Any remote live sessions will be announced directly over email.

TAs

TBA

Evaluation policy

If you have taken up this course through Swayam, then you would need to be formally enrolled in the course, and register for the certification exam to get a certificate of completion for the course.

The grading policy is as follows.

  • 12.5% of the final grade comes from the weekly quiz-based assignments. The best 8 out of 12 scores are considered.
  • 12.5% of the final grade comes from the weekly programming assignments, where the weekly score is the average of the programming assignments every week. Again, only the best 8 out of 12 are considered.
  • 75% of the final grade comes from the final exam, which is held at a physical location and whose format is similar to the weekly quizzes. Please note that there are no programming-based assessments in the final exam.

Important Note. You will be eligible for a certificate only if average assignment score (quizzes and programming assignments combined) \geq 10/25 and exam score \geq 30/75. If one of the two criteria is not met, you will not get the certificate even if the final score is \geq 40/100.

Register

Sign up for the course from here. (Note: enrollment ends on 30 Jan 2023!)

Also, you might find the following links useful:

  1. Invitation to the Discord Community
  2. GitHub repository of solutions to the problems discussed in the lectures
  3. Link to YouTube Playlist for the course
  • Lectures
  • Assignments
  • Exams
Date Lecture Slides Notes Video
04 Jan, 2023 1. Ad-Hoc and Implementation

In this week, we explore some puzzle-based problems in competitive programming. These don’t require any specific algorithmic background, but instead rely on ad-hoc observations and often simple implementations.

No matching items

These are some practice assignments: the due date is simply the recommended completion deadline. There is no need to submit these assignments.

Issued Assessment Problems Solutions Due
11 Jan, 2023 Assignment 1

01 Feb, 2023
20 Feb, 2023 Assignment 2

20 Mar, 2023
03 Apr, 2023 Assignment 3

26 Apr, 2023
No matching items
Issued Assessment Problems Solutions Due
TBA Exam 1

-
TBA Exam 2

-
TBA Exam 3

-
No matching items

© 2022 • Neeldhara Misra • Credits •

 

Corrections? Please leave a comment here or a PR in this repository, thanks!

I’d rather be a failure at something I love than a success at something I hate.

George Burns

You live and you learn — at any rate, you live.

Douglas Adams

A problem worthy of attack proves its worth by fighting back.

Paul Erdos

×