Whenever I am frustrated with my college CS professors and the way they explain topics I type "Abdul Bari" on youtube and never get disappointed! Thank you! You are a great teacher and person for doing this!
Everyone will get interest in study if this type of teaching will be there in every class then students will study with curiosity and the classes will not be bunked by the students. Thank you so much sir. Love the explanation!
Imagine your child, your grand child, any kid from the whole lineage going to Computer science . The link to this video is a treasure map for them. Great video indeed ! Thank you for all your effort, dedication and passion. You are making a difference at a global level.
You are the most amazing CS professor honestly. Your ability to explain such hard concepts and make them so understandable is a gift. I thank you to the bottom of my heart. Was so frustrated with my theory of computation class and because I didn't understand anything my professor was saying in this topic, a professor with multiple researches and PHDs. God bless you and your family. You re an awesome teacher!
No comments... It's Amazing,., this is one of the toughest topics in my Algorithm course.,U made it simple ... Now One comment is not enough to describe how easy it is . love your lectures. keep doing more videos. Thank you sir..
One of the finest explanations I've come across RU-vid. There are other videos with better jazz (animations/funny quips etc), but none take their time in explaining a complex computer science concept so patiently. Well done! Thank you so much for your time...
I believe any difficult subject becomes boring or non-understandable to someone if the teacher fails to explain it in the way you did. It just increased my potential to think of new discoveries. I really hope that teachers like you are discovered by us very soon because just like NP, gems like you are already there in our environment, we just need to discover them!
Sir. You earned respect. You know how a student can learn. They way you explain everything is too good and understandable. I wish all students get a chance to come across prof. like you. Thank you sir.
i feel so sad about those got graduated 4 years ago without knowing what exactly these things are.may god bless this man to live longer and teach us more and more and more
I am really becoming perfect in algorithms and data structures because of watching these videos from best lecture Abul Bari sir. I am grateful to you for support and explanation.
I have tried so many time to understand p, np etc but everytime the professors tried to scare us as if I had to be a PhD to even begin to understand what it all means. You cleared it up in a second. I am not even a CS guy, I just like learning about random things. Thanks a lot.
Sir.U are just simple awesome.I haven't read this course thoroughly through out my semester.I had watched your videos 2 days before the exam and I'm able to attempt the question paper incredibly good.Thank u so much sir🙏. Hat's off for to your teaching.Great explaination.
I have gone through many books for this topic... But i never felt easy then... You are the only person who can convert NP topics to P topics👏👏thank you sir
This is the most straightforward, easy explanation I have ever heard on this topic. The way you explained it has intrigued me to learn more about this topic and not just dread it for exams. Thank you for this.
I watched 2 lectures amounting to 2.5 hours from my Algorithms class and I got much less out of that - than I did from this video. 30 minutes is very worth it. Thank you so much.
U r the best teacher sir.I have also taken ur course of DSA of Udemy.U r genius sir.U can teach the toughest of concept with absolute simplicity.keep on making such videos sir it is the most useful for students
The way you explained Satisfiability and related it to 0/1 knapsack was blown up my mind. You just made complex terms very easy. I learn much in your classes rather than university. Thank you sir.
One moment I was watching a poker tournament and a moment later I'm into this youtube rabbit hole and it has brought me here. Incredible. This stuff is fascinating, and I don't understand a thing about it.
It's fascinating how humans are proving the existence of better solutions that we may find for these problems in the near future. Seems like a huge and significant step. Understood in one go. God gifted teacher.
I am an undergrad at IIT. Mindblowing explanation Abdul bari sir !. I have completed 2 courses made by you about to finish 3rd !!. You will be remembered FOREVER, You actually increased my confidence exponentially in programming!
Hats off to you Sir! You yourself proved what you claimed! Till I heard you about this topic through this video, the whole concept was just unknown oh no, unimaginable to understand I mean Non-Deterministic and now after listening to you it has become too simple that now we started playing with polynomial time requirements and deterministic. Simply great Sir. Awesome, amazing, ... falling short of words to thank you Sir for all the services you are rendering to the society by making people to believe that they can do wonders which they never had even dreamt that they could do so. I mean converting NP to P!!!!
Great explanation I have ever seen ! You are really a great teacher in this planet . Million of love, respect and Salam for you sir ! From Dhaka, Bangladesh!
I'm shaking my head in disbelief... why aren't you my professor for EVERYTHING? This is how someone explains something! Wow. Bless you, bless you, bless you. Thanks a ton.
the problems which are solved in less number of time gave us the whole support and much better understanding for solving these logcal problems.Resprct sir, Salute You for giving such abrilliant and nice explaination about these problems in such a nice way 🙏
Hell of an explanation. I was trying to get my head around in P, NP, Np-Hard, and Np-Complete problems for the last one day with no progress. This video made it all clear. Great job. Became a fan of this channel...
I got your course, watched nearly every video for my algorithms class & passed. Now I am doing another course where we actually looked at reductions and P & NP. I never understood even the slightest thing in class. This is amazing!
Usually people with this kind of knowledge don't have time to be on RU-vid, I thank you very much for your clear explanation and hopefully, I will see more and more videos of you with time. I have a small request though, if you would please put some references at the end of each video so that people who are interested in a subject can read more or cite a reference if needed.. Also, is it possible that you explain some metaheuristic methods in the future? it would be great.. thanks a lot
I've never seen such an amazing yet simple yet descriptive tutorial for NP Complete and NP Hard. Kudos to you sir!! You're a savior for CS enthusiasts.
man this is so much better than my lecturer, he assumes we are geniuses and i don't even know what he is muttering in class, the way he explained is just too technical
This was beautifully explained. The simplicity slices through confusion, and I was able to follow. You also inspired me to research this theory deeper! A fantastic teacher!!!
Don't underestimate this teacher due to his indian accent, he makes PERFECT sense ! Thank you for making this subject accessible to the likes of us - we are very grateful that you would freely provide such quality material.
Thanks a lot sir..... You really are life saver for thousands of engineering students out there trying to understand and strong their grasp on algorithms..... I haven't seen a teacher like you.... And you teach all of this for free..... You really are a gift from God in my engineering years....
Hello, I would like to send you a giant THANK YOU. Your videos helped me pass my algorithms class and allowed me to graduate college! You have an amazing skill for explaining complicated concepts in a clear and concise way. I am so grateful my dad showed me your RU-vid channel. Thank you again!
awesome ... very well explained , i was trying to clear my concepts of Np hard and Np complete since many days, i have gone through so many videos.. but sir u made it really easy for us thanks alot
Hello Sir, truely appreciated the clarity of explanation, and the content, It was awesome easy to understand one difficult concept. I will follow all other of your Lectures
Thankyou very much sir, me and all of my friends watch your videos. To be honest I have my exam tomorrow morning😅 Your style of teaching is really amazing, I already had the notes of this topic with me as my teacher provided them, I even tried to read them but it all seemed so confusing and out of place that i ended up quitting in between. But now i feel really confident for my exam. Thanks and regards☺
Your way of guiding and teaching us is amazing .... i coverd may whole analysis course just from your channel and thankxxx to be with us.. from Abbottabad
Satisfiability is non-deterministic because it is part of a class of algorithms that cannot be solved quickly but can be verified/checked quickly. It means we hope to one day "fill-in the blanks" to make it polynomial and deterministic. If somebody gave you a boolean satisfiability problem and asked you to solve it, it would take you a very long time to solve it depending on how many variables were involved. But if somebody gave you a boolean satisfiability problem AND gave you the answer to the problem, well, then you could quickly check that the given solution is indeed correct. When I say it would take you a very long time I mean it would take you longer than polynomial time. It would be exponential time. When I say it would take a very short amount of time, or you could do so quickly, I mean it would take you polynomial time or less. I hope this helps.
Thanks alot. I understood this topic after 17 years of completion of my masters. Wish all teachers are like you then no one will find algorithms topic difficult. Hats of you.
I was just going to increase the playback speed to 2X and then you said if you are in a hurry then don't watch 😂😂, so i watched it in normal speed and understood everything , thank you guru ji 💙💙
Love from Nepal. May god bless you eternally sir. You have given the wonderful contents absolute free of cost, which requires a great sacrifice!! hats off to you
To all who have been here before me, to all who have watched these videos one day before their algorithm exams, know that the torch is being passed on and the tradition is being kept alive. I hope to make the indians who make these tutorials proud, like you have done when it was your turn to tackle this course. Wish me luck, and I wish all who come after me luck as well. Let's do this!
I have just completed M.Sc(Mathematics with Application in Computer Science). I am preparing for a job interview.Your classes are helpful for me Thanks,Sir
I had seen multiple videos for the P and NP problem but believe me, I was unable to understand a single word. I randomly find his video and when he said if u r in hurry don't watch it, I knew there is something in it and now after half an hour I know what is P, NP, NP-hard, Complete. Sir, u deserve a standing ovation (y). Outstanding. Thank u so much for teaching.
I am glad that I can understand Hindi and Indian accent. I am a student in the US but I always watch your video before class to prepare myself for lecture. You are genenious sir. We appreciate your effort.
