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:

NP-Complete-Lecture-By-Ankur-Gupta

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