Видео

🙏🙏🙏Namaskar Sir.Thanks a lot for this great lecture series on Algorithms.

amazing sir

Usually we take i and j values from 0 why to take from 1 in this question ?

kya chutiya tarika hai padhane ka yaar,koi rhythm hi nhi ban rha hai

❤❤❤❤

explaination 20% "clear ho gaya punchna" 80%

Sir watching in 2024 . Still your teaching feels very energetic, fresh, and bessttt

thank you sir....best teaching

1:13:25 resume

Nice sir...

Love it 😀❤

best digital logic playlist on youtube. hats off sir, best teaching

Just came here to revision 😊

Sir very very very very good concept❤❤❤❤❤

asymptotic notation kyu nhi padhaya sir ?

18:31 18:31 18:31 18:31

1:02:56

1:22:08 find time complexity question

❤❤❤

Sir aap bhut achha padhate hai

❤❤

Explanation: 20% Asking, smajh me aya? : 80%

Pankaj sir >>>>>>>>>>>>> anyone

thank you

1:05:30 this small details tells everything about sir , legend

Is this playlist completed with all topics of COA ?

Where is bellman ford and other remaining algorithms?

bahut slow content deliver karte ho sir,

time 43:27 wrong calculation. it will be .00256 m sec

Man karta hai like button to do like ker ker ke ker ke ker ker ke ker ker ke

Super se bhi uper ❤

38:09 सर से थोड़ी सी गलती हो गई है। R candidate key नही है। QR और RS दो candidate key आ रही है । Y(PR) तो BCNF में है । परंतु Relation Z(QRS) में FD set ( QR→S; R→P ) R→P BCNF में नही है क्योंकि R super key नही है । पर X और Z दोनों Dependency Preserving और Loss less है । पर BCNF नहीं इसलिए correct Ans II only

Good Rivision

maja aya sir thank you for explaining so much detail

bahut maja aa gya sir kyonki buffer hi c1 hai (gangadhar hi saktimaan hai ) ❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤🧡🧡🧡🧡🧡🧡🧡🧡🧡🧡🧡🧡🧡💝💚💚💚💚💚💚💚💚💚💚💚💚💙💙💙💙💙💜💜💜💜🤎🤎🤎🤎🤎🤎🤍🤍🤍🤍🤍🤍💕💕💕💞💞💞💞💞💞💓💓💓💓💓💓💗💗😽😽😽

❤❤❤

sirji besstt lecture, thank u so much

❤❤❤

Best lectures❤

This lecture is best lecture for computer architecture i have ever seen on youtube ......?

Gold hai ye ❤❤❤

Topological sort 9:35