My teacher told me that DAA is the most toughest subject in CSE but sir u made it so easy.

@isaicsefxec6721

3 жыл бұрын

💯

@russellfernandez57

3 жыл бұрын

Was surfing my way through KZread and stumbled here. What's DAA?

@soumyadeeproy9638

3 жыл бұрын

@@russellfernandez57 Design and Analysis of Algorithm

@noobbot6556

3 жыл бұрын

Your teacher is an idiot

@PulkitMalhotra

3 жыл бұрын

@@noobbot6556 i think his teacher's teacher is not a good teacher

Damn reading those techmax for 3 hours and couldn't understand the problem, later Switching into your channel and problem gets solved in 10 mins. Thank you sir.

@abhimanyuchauhan1014

6 жыл бұрын

thanks

@ji3g4j6jo3p

6 жыл бұрын

The power of KZread (and Indians teaching math)

@sumedhdeshpande3420

5 жыл бұрын

dont read local authors read standard textbooks for algorithm read cormen only that will help you for long run......

@aaakashkumar

5 жыл бұрын

@@sumedhdeshpande3420 I don't think job sequencing in there in Cormen 🤔

@Bradcopo

5 жыл бұрын

yeah watching teaching videos are really powerfull for this kind of subjects

Best Teaching Methodology ever...right from school days no teacher taught so well till my engineering last year...Hatsoff sir...Thank you so much sir...even a non engineering guy would understand every concept that u teach 👍

in college everyone says this subject is tough, but u made it look effortless. DAMN GREAT :)

@jay-rathod-01

3 жыл бұрын

They are deceiving your mind so that there is less competition in the placement interviews. See how kind I am😎😅

@shivakarthikrathod2026

2 жыл бұрын

you r feeling easy because he didnt explaned the code he only explaned concept

@abdulfahad4498

2 жыл бұрын

@@shivakarthikrathod2026 after understanding concept u can easily write the code.

Abdul Bari sir is one of the best teachers I have ever seen in Algorithms. Thanks sir. :)

@pankajacharjee8742

Жыл бұрын

Could you mention some others?

@NEXC

10 ай бұрын

gate smashers & Jenny @@pankajacharjee8742

you already covered everything in my syllabus 😂😂 thank you sir.i joined mca in the correct time

@kushnayak1619

4 жыл бұрын

stop

@ashwinverma2030

12 күн бұрын

What are you doing right now?😅 It's been 5 years.

Sir please come to our college I will fight for you with my HOD every day I was wasting 1 hour of time in my class.. Instead I can watch your videos and improve my skills in Algorithms

@samjebaraj24

4 жыл бұрын

oh shit ,i waste samme 1 hr daily !!!!!!!!!!!!!!

@bhupendra8429

4 жыл бұрын

😂😂

@GoliBodhini

3 жыл бұрын

Hhaha well said..🎉

For those who are confused let me clear a thing that the J2 have deadline of 2 but it can be finished in 1 so J2 is there in the first slot to get the maximum profit.. Trick: write the max profit(J1) to it's exact deadline (2) so you can get a space(0-1) to write the next highest profit(J2) to get the overall max profit.

@starkendeavours7072

2 жыл бұрын

Thank you, I understood.❤‍🔥💞

@mumbaikachallenge5526

2 жыл бұрын

Thanks man!

@illumeful

2 жыл бұрын

thanks :)

@SandeepKaur-vj3xc

10 ай бұрын

But job3 has maximum profit why it is ignore???and give to time slot j4

@garvSensei999

10 ай бұрын

​@@SandeepKaur-vj3xc In problem no:1- J1 has max profit of 20 and time slot is 2 so put J1 in slot [1-2] Now after J1; J2 has max profit of 15 and time slot is 2 so the only available slot till 2 is [0-1] because [1-2] slot is already occupied by J1 so J2 will have [0-1] Now after J1 & J2; J3 has max profit of 10 but the time slot is 1 i.e. [0-1] which is already occupied by J2 so we ignore J3 because there is no available slot for J3. Now after J1, J2, J3; J4 has max profit of 5 and time slot is 3 so we have available slot of [2-3] so J4 will be given slot [2-3]. That's it, Hope you understood.

Insane how easy and intuitive this is once an expert teacher explains it.

Best speed for watching your videos is 1.25 sir ji ! Very nice explanation!

@rishabhvanwani

4 жыл бұрын

2x

@yvesjordannguejip5487

4 жыл бұрын

Watching at 1.5x

@Brightmoon853

5 күн бұрын

I'm watching this video in 1.75x

I have always hated computer science subjects until I found this channel. Keeping it simple and interesting. I have always relied on his classes when it comes to my exams. It is really good. Great work, sir .

Great ! You are a great Teacher. Thanks for saving my Design and analysis of Algorithm Paper. #Respect

Literally the best channel, seeing each and every concept that we feel difficult,reminds us that we can learn daa subject easily with your channel thanks a lot sir 🙏😊

Thank you for making DAA this much easy ☺You got my respect sir..

Great work abdul sir. Highly appreciated. Your method of explaining problems is superb. 😄

Thank you so much Sir...Every college should have great teacher like you!!

Best teacher ever!!! Literally all subjects needed for university!

Thank you, sir. I and my friends understood the problem we were facing for the past 24 hours.

i have seen many other videos from other channels, but you are the best professor for this subject. thanks for all the efforts sir from bottom of the heart. may ALLAH bless u with mercies.🤩🤩

why does this feel so easy when he teaches

@zenilkapadia7572

3 ай бұрын

Cool!!

Amazing teaching skill , before watching the videos my thinking is DAA is very tough also teachers says it is very tough but you make daa very easy and easily understood the concept , now time I am watching your java le tures on udemy Such a great teacher, thank you sir

Thank you... I've watch some of your tutorials & I find it very very very very helpful & interesting to watch

Thank you sir. You pulled this problem smoothly. Much respect😊

I have started admiring your teaching skills. Thanks for such a good video.

Thank you sir for all the lectures.... you are the best

This is one of the best playlist for algorithms. Thank you sir!!

Thank you for the video. Loved the way you explained it. :)

best explanation on online platform, thank you sososo much ♥

its the best explanation i found from entire youtube. Thank you sir. i like to make a suggestion that. you can add the algorithm and its complexity analysis in a separate video. it will be help full for students to get the fullest of this algorithm

Oh bhai bhai... i could not understand my college lecture on this topic but this teacher made it really easy to understand..... thanks sir....... i don't know why everyone is having problem of not understanding the college lectures.....

@RizZxProd

4 ай бұрын

bcoz most of the lecturers just care about the money and not about educating the students ! It's the education system's fault in our country. Lecturers be like even if the Student fails they'd say they taught it and Indian parents def won't believe if their kids say that teachers are not teaching properly 🤷

Thank you sir for explaining in such a simple and effective manner

Thank you so much for such good explanation. Really helped me understand the concept.

Thank u So much Abdul Sir Really i felt easy after seeing this video i learnt in 10 mins thank u sir

With no single dout u clear the every single topic sir, thank goodness I can learn so fast from you...

You're really a good instructor. I can understand the problem and its solution. Thank you so much

you are a great teacher sir, that to you understanding all these concepts are really easy, I have also taken you course on udemy that was a really amazing course.

I ever seen like you sir chanceless how i will explain your way of teaching hats off you sir am preparing for net exam kindly update more videos relevant net exam

Thank you sir. Pls can you include an algorithm design for your solution? Thank you

excellent sir with good examples and it is very easy to understand .

sir take my salam from Bangladesh....your teaching style is one of the best style in my life...i just gave up on this topics...Allah helped me. May Allah bless you.

To make things clear and understand why Greedy approach is used I'll re-define the problem/solution Imagine you have N jobs and each jobs takes 1 hour to complete. Each job has certain profit associated with it. Being greedy I'll sort(max-min) the jobs based on profits. I'll start with the job which gives maximum profit and continue to work until the last waiting job (based on availability of the slot) can be completed

@surajmahato2557

5 жыл бұрын

😂😂😂

@anshsachdeva1061

5 жыл бұрын

thankyou, even though it has no new info, the way you emphasized on 1 hour made me re-watch that part and helped me understand.

@nchsrimannarayanaiyengar8003

5 жыл бұрын

Dear Rahul singh Can you send me the problem and the solution please

@vimalsheoran8040

4 жыл бұрын

Thanks, helped me with the notes.

@amaleenazhar8253

4 жыл бұрын

i still cannot understand how he arrange the job by look at the weight. can you explain it to me please..

Thank you sir for the easy explaination!!

Hello sir, sir i am big fan of yours i love the way you explain each and every concept. Sir i have a request that Plzz bring a video on job sequencing with deadline on penalties. If you do so i am going to be greatfull of yours till my entire life.

You are really great man.My Daa mam said it in a different way.I didnt understand after doing it so many times.But you rocked it

i proudly say i am regular student of sir not only youtube as well as in udemy i bought course of c++,and data structure thank you sir make jsuch a great content on both paltfrom.

This is one of the best playlist for DAA. thankk you soo much sir😊

thank you so much sir .your way of teaching is fantabulous.

Thank you so much sir for such simple explanation of this seemingly complex problem

you are the hero sir...thnx fr this,very nice explanation,,well deserved a thumbs up for you,,,please keep going:- JAI HIND:-)

It's very useful thank you sir 😊

student: sir data structure is so tough that I usually feel disappointed while understanding certain concepts respected prof abdul bari sir: okay, just hold the camera and tell me ur problem

awsome teaching style sir. Sir, please make a series od Data structures

Thank u very much for these videos👍

Thank you very much sir ! Keep up the good work.

Salute Sir! Beautifully Explained!!

Thank you sir.. very GOOD explanation and i hope you continue with more videos

Thank you sir ..your teaching is very very easy to understand and to the point 🙏

great service in the form of Lucid explanation Sir

Thanks for the videos! Can you please explain to me why, after placing J1 and J2 in the first 2 slots, we cant pick J3 which is the 3rd biggest profit and interchange it with J1? If we pick J3 and do it first instead of J1, during the slots [9-10], we can get bigger profit, 20+15+10. Please answer, thanks a lot in advance!

@emprost-kun2388

3 жыл бұрын

Because as per greedy approach you have to choose maximum profit first then go to the lower ones, and that's how the order goes J1 has the biggest profit so we'll prefer it first, same for all as well.

Thank you sir for such a nice video. Please explain the scenarios in which Dynamic Programming is used and those where greedy approach is used? Lots of confusion is created regarding selection of the approach while dealing with the new problem statement. Thanks in advance.

Your videos have saved me for Advanced Data Structures! :D

Noo words sir seriously ur awesome n genious .......helping many people through ur videos thank uu

Very nice video.. easy to understand. Keep it up sir. Looking forward for more videos.

Tq sir ur teaching helps us a lotzzz ,the way u teach us is really perfect

Sir, please make videos on all CSE core subjects

Your wisdom is immeasurable Sir.

Very very thankful to you sir because your way of teaching is very very superb and more understandable Why don't u teach any core languages like java,phython,AI,mechine learning,c etc.

Sir very nice videos ....thank you sir ...thank you very much ....😃😃😃😃

Really very informative lecture of greedy algorithms....

Sir, you are best teacher❤️

Jezakallah - thank yo so much for the amazing excellent lectures

U made it look so reliable to understand .u r great

for those who r still confused about why did he put j2 in the first slot, only keep this thing in mind, "each and every job takes only 1 unit of time irrespective of the deadline". rest is self explanatory for sure. and also this man is giving away DAA knowledge for absolutely free and at no extra cost that ur understanding. HE IS GOAT. Ma man teaches DAA like its water and u only have to drink it, lmfao.

sir please also mention it algorithm and with its time complexity

The way u explain the DSA problem is superb sir. Can you please make some SystemDesign vedios as well.

I salute u sir the tone of ur voice let me understand the topic easily 😚😎😎😎😎😎

Respected sir, you are the GOAT (Greatest of All Time). Thank you!

@gabriele2291

4 жыл бұрын

lol (laughing over lad), imo (in my opinion) this cmnt (comment) is very n1 (nice one) listen to me ikr (i keep it real) so please GOAT (get outta town) bro (brother)

If we select the job in decreasing order then we have to take its deadline also with it or not sir please rply....??

Very nicely explained sir.

frankly speaking you are my real teacher.also you are my knowledge father

Good Explanation Sir

Your videos are 1000 times effective than sitting hours together in front of the books sir. Thank you very much sir you have made it very easy to understand

Good explanation sir! I will follow ur videos

You made everything easy. excellent teaching sir

I have exam tommorrow you made me undestand the concepts u easy.thanku so much sir

Nicely and peacefully explained ❤️❤️🙏

Your class is verry much effective.. Thank u sir😍😊

you really deserve a best teacher award sir ... very useful lectures ... thanks a lot

Thanks for the simple explanation sir.... Was Helpful for my internals😁

@IrfanShaikh-nb1ud

6 жыл бұрын

Abdul Bari vtu University sir.... BYRE GOWDA INSTITUTE OF TECHNOLOGY

Thank u i understand very well

Toughest topic--> very easy Only because of you sir, Thank you...

Very helpful sir with excellent examples

Best lecture available on internet

Thanks for explaining this sir. I have one question. How do we solve this problem assuming that all jobs are not done in 1 unit of time? some may take 2, some 3 and some 4.

Sir thanks alot, u jst keep things simple and clr

Easy method to solve problems . Thanks sir .

your skill of teaching is on next level....

Best Sir . Thanks for giving useful Concept.

Thanks for your sharing. If you prove these algorithm in these video, we will learn more.

Thank you, I was having issue understanding the meaning/representation of a deadline. For those having the same issue, it means for example if Job X has a deadline 3, it means it can be done in 1 or 2 or 3 and it cannot pass 3 e.g: 0__1__2__3 if we try to place it at the 3__4 position it will pass the deadline assume that the job as a length duration of 1 unit