Your videos are incredible! They greatly improve my understanding of concepts. Thank you so much for creating all of this fantastic content!! I have one request: I am an IB student who has taken computer science at the higher level. It would be fantastic if you could create videos related to the IB curriculum. IB COMP.SCI has almost no resources. And if you decide to create videos for them, they will benefit the entire student body... I hope this message reaches you and that you take action. Thxs.
Hello sirr, if we check HG, FB, EC then how these vertexs are following (U->V) case, Please clarify. I dont see any edge in these cases and the as per the rules of topological sorting, they should be travesing from H->G, F->B, E->C
all the conditions should be satisfied in the sorted sequence, but if there is no constraint then any order can be used (e.g. in this case, H and G have no edge so HG or GH anything is fine, similar for F and B, but if there is edge then it must follow in the order) This is exactly why the ordering is non-unique.
Sir pls vo hemeltenion cycle, coloring of graph, transitive closure, network flow algorithm, tractable and intractable problem aur advance topic pe bhi video bando jaldi jaldi pls sir 🙏
Tq u sir...ek request h..ap concepts ko pseudo code ke sath explanation Diya kro... It will get more idea about coding also...n how it works in computer...
Celebrated my New Year while watching this Masterpiece❤🔥
Bro go get a life
Get a life bro👍🏻
Brow💀
Your life is sad
Thank you Sir for such Amazing Explanation
Helped me last minute before my exam 👍👍👍
Your videos are incredible! They greatly improve my understanding of concepts. Thank you so much for creating all of this fantastic content!! I have one request: I am an IB student who has taken computer science at the higher level. It would be fantastic if you could create videos related to the IB curriculum. IB COMP.SCI has almost no resources. And if you decide to create videos for them, they will benefit the entire student body... I hope this message reaches you and that you take action. Thxs.
ua-cam.com/video/mnunYoIDMNo/v-deo.html
Legend are coming on the of day of exam 🥳😂😂😂
bara hoja bhai
😂😂😂😂😂😂😂😂😮😮😮😮😢😢😢
Thank for such interactive explanation sir !
very easy and basic clearance,, good
Thank youh so muchh sir !
you have a great study technique .
Easy to understand video. Thanks for the efforts.
B
Hello sirr, if we check HG, FB, EC then how these vertexs are following (U->V) case, Please clarify. I dont see any edge in these cases and the as per the rules of topological sorting, they should be travesing from H->G, F->B, E->C
all the conditions should be satisfied in the sorted sequence, but if there is no constraint then any order can be used
(e.g. in this case, H and G have no edge so HG or GH anything is fine, similar for F and B, but if there is edge then it must follow in the order)
This is exactly why the ordering is non-unique.
Thanks sir
Great insight!!
You can also use indegree of the vertices,whichever vertex has 0 indegree then put that in the ordering and so on
That's bfs or kahn algorithm
@@Anonymous____________A721 nope that is topological sorting, u can refer the textbook Design and Analysis of algorithms By Anny leviten
Theory of computation pr ek acchi playlist bana Dona
Thanks a lot brother!
Thank you sir you are the best
You did great sir 🐱
Timing mst hai, tomorrow I have exams video he nhi mil rha tha ✌️
ua-cam.com/video/UgFNam-Ghpk/v-deo.html
us moment hogaya
Nice
Sir pls vo hemeltenion cycle, coloring of graph, transitive closure, network flow algorithm, tractable and intractable problem aur advance topic pe bhi video bando jaldi jaldi pls sir 🙏
bhai ek saal hogaya 😢
Thank you Thank you soo much sir❤❤
Sir IA ke liye course launch kroge kya sir.
Hmm Rajasthan vale wait kr rhe hai
Are wow just two weeks ago 👍👍👍👍
Nice Sir 😊
thank you Sirrrrrrrrw
Thank you ❤sir
Mast hai ji
Thnku so much 🤎
Thank you so much😊
Dhanyawad sirji
Tq u sir...ek request h..ap concepts ko pseudo code ke sath explanation Diya kro... It will get more idea about coding also...n how it works in computer...
First time seeing you in specs 🤭
Great as always 😎👍
ua-cam.com/video/UgFNam-Ghpk/v-deo.html
sir H does not go to G right ? isnt it wrong i am confused
shouldnt B come before F as the indegree of F is 1 whereas indegree of B is 0?
But sir our lecturer said that we need to always must start with that vertex whose indegree is 0 Is it not right plz say
Yes 🙂! That's source removal algo for topological sorting. And the vdo is on DFS algo for topological sorting.
Sir Pls share some basic on understanding AI.
ua-cam.com/video/mnunYoIDMNo/v-deo.html
Watching before 15 minutes
11:11 🤣🤣
?
Thank U Sir🙏🙏🙏🙏🙏
H-G to koi path hi nhi hai fir h first position pe kaise aagya. Plz anyone give me answer my questiin
Sir... Please give last minute notes for closed under inverse and homomarphism in TOC
ua-cam.com/video/UgFNam-Ghpk/v-deo.html
Watching 1 hour before exam
In this example how H comes before G
👍
here!
Aaj 10 baje mera exam he 😅
Pass ho gayi kya
Amazing teacher🤌
Sir lekin hor g to nahi h valid
Integral University
Exam after 1 Hours🙂💔
Exams after 2 hours
Kuch bhi kahoo but sir ko itna pataa h kon kitna paani h 😂 line padh kar bata dete h ki hmee samj nhi aayi h 🤣🤣
Hlo
ek line ka answer likhenge tho marks nhi denge hamare college mai :_(
time wasted
Why?
@@pokemonmastergaming2782wrong bataya hai
Your brain need to update
ya sa bhi ne samajh Paya Na to kahin se bhi samajh Nahin Sakta bro
@@mani_fitness03actually the method is wrong
Source Removal algo
ua-cam.com/video/UgFNam-Ghpk/v-deo.html