X

Selected Topics in Algorithms

By Prof. Palash Dey   |   IIT Kharagpur
Learners enrolled: 163
ABOUT THE COURSE:
Every application area of computer science and engineering demands efficient design of algorithms. Indeed an efficient algorithm for a problem may take much less time even on a old computer than an inefficient algorithm for the same problem running on the fastest computer on the earth. In basic data structure and algorithm course, we learn elementary techniques like greedy algorithms, divide and conquer, dynamic programming, etc. In this course, we will learn more advanced algorithm design techniques.

INTENDED AUDIENCE: Under-graduate and post-graduates

PREREQUISITES: Knowledge of basic algorithms

INDUSTRY SUPPORT: All software companies especially google,microsoft,etc.
Summary
Course Status : Upcoming
Course Type : Elective
Duration : 12 weeks
Start Date : 23 Jan 2023
End Date : 14 Apr 2023
Exam Date : 29 Apr 2023 IST
Enrollment Ends : 30 Jan 2023
Category :
  • Computer Science and Engineering
Credit Points : 3
Level : Postgraduate

Page Visits



Course layout

Week 1: Network Flows, Ford-Fulkerson Algorithm, Edmond-Karp Algorithm
Week 2: Max-Flow Min-Cut Theorem, Application of Network Flows, Edmond’s Matching Algorithm
Week 3: Randomization as Algorithm Design Technique, Karger’s Min Cut Algorithm, Randomized Algorithm for 2-SAT
Week 4: Polynomial Identity Testing, Schwartz-Zippel Lemma Application of PIT: Perfect Bipartite Matching
Week 5: Elementary Concentration Inequalities: Markov, Chebyshev, Chernoff-Hoeffding
Week 6: Markov Chain, Random Walks, Monte Carlo Method, DNF Counting
Week 7: NP-Completeness
Week 8: Approximation Algorithm: Vertex Cover, Set Cover, Travelling Salesman Problem APTAS for Bin Packing
Week 9: FPTAS for Knapsack, Linear Programming Basics
Week 10: Designing Approximation Algorithms using Linear Programs: Rounding, Primal-Dual Schema
Week 11: Parameterized Algorithms: Fixed Parameter Tractable Algorithms, Kernelization, Bounded Search
Week 12: Iterative Compression, Color Coding

Books and references

1. Approximation Algorithms by Vijay V. Vazirani
2. Introduction to Algorithms by Cormen, Leiserson, Rivest, and Stein
3. Parameterized Algorithms by Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk, Pilipczuk, and Saurabh
4. Probability and Computing by Mitzenmacher and Upfal

Instructor bio

Prof. Palash Dey

IIT Kharagpur
Prof. Palash Dey is an Assistant Professor in the Department of Computer Science and Engineering at Indian Institute of Technology, Kharagpur since 2018. Before joining IIT Kharagpur, he was a post-doctoral INSPIRE faculty in TIFR, Mumbai for one year. He finished his Ph.D. and M.E. from the Department of Computer Science and Automation at Indian Institute of Science, Bangalore in 2017 and 2013 respectively. Prior to that, he finished his B.E. from the Department of Computer Science and Engineering at Jadavpur University in 2010. His primary field of research is algorithmic game theory. He is broadly interested in theoretical computer science.

Course certificate

The course is free to enroll and learn from. But if you want a certificate, you have to register and write the proctored exam conducted by us in person at any of the designated exam centres.
The exam is optional for a fee of Rs 1000/- (Rupees one thousand only).
Date and Time of Exams: 29 April 2023 Morning session 9am to 12 noon; Afternoon Session 2pm to 5pm.
Registration url: Announcements will be made when the registration form is open for registrations.
The online registration form has to be filled and the certification exam fee needs to be paid. More details will be made available when the exam registration form is published. If there are any changes, it will be mentioned then.
Please check the form for more details on the cities where the exams will be held, the conditions you agree to when you fill the form etc.

CRITERIA TO GET A CERTIFICATE

Average assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the course.
Exam score = 75% of the proctored certification exam score out of 100

Final score = Average assignment score + Exam score

YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.

Certificate will have your name, photograph and the score in the final exam with the breakup.It will have the logos of NPTEL and IIT Kharagpur .It will be e-verifiable at nptel.ac.in/noc.

Only the e-certificate will be made available. Hard copies will not be dispatched.

Once again, thanks for your interest in our online courses and certification. Happy learning.

- NPTEL team


MHRD logo Swayam logo

DOWNLOAD APP

Goto google play store

FOLLOW US