An Easy Way to understand P, NP, NP-Complete, NP-Hard

In the course of Design and analysis of algorithms students have difficulty in understanding the computational classes P, NP, NP-Complete, and NP-Hard. Going through this lecture one can easily understand these classes. It also, introduces how one problem reduces to others.
On going through this lecture one will have an understanding of these computational classes, and will be familiar with the hardness of some problems in these classes.
This video is for the educational purpose, For exploiting the full benefit of this lecture it is recommended to watch it in full from beginning to the end if your time permits.

OUTLINE:
0:00 - Introduction and about Class P problems
2:58 - Notion of non-deterministic algorithms and their complexity
14:31 - Discussion of Class NP with example
25:22 - NP-Complete, and NP-Hard computational classes
47:00 - Clique Decision, and Max Clique Problems
1:00:49 - Concluding Remarks

CONNECT:
If you enjoyed this video, please like it and subscribe to this channel

Видео An Easy Way to understand P, NP, NP-Complete, NP-Hard канала Dr G L Prajapati