Ankur Gupta

Ankur Gupta -

Video Lecture on P, NP and NP-Completeness Problems

This is my small effort to make the topic NP-Completeness clear to students studying Design and Analysis of Algorithms or preparing for GATE Computer Science. Please use the following link to download the video lecture:


It’s in compressed zip format. Therefore first decompress it using some zip utility and then click on the file “Launch.exe” to watch the video.


Source: Wikipedia

  • saransh.dave says:

    I think this topic is now removed from GATE syllabus. But anyways, it was nice to watch these lecture. It helped me in my college exams. Thanks.

    January 5, 2018 at 7:39 PM

Your email address will not be published. Required fields are marked *