I was watching this video.... suddenly मुझे लगा कि क्यों ना एकबार Comments के उपर guidelines को पढ़ ले..... I couldn't stop laughing after reading your guideline Sir 😂..... Hats off !
What is POSET? Draw the Hasse diagram representing the positive divisions of 36 (i.e., D36). Also find out minimal, maximal, greatest, and least elements. sir please solve these type of problem
sir please solve this question🙏🙏🙏🙏🙏🙏🙏 Q. Implement Dijkstra's algorithm step by step on the 8 following graph to find the minimum distance and path from vertex 0 to vertex 4. If weight of edge 7 to 6 is changed from 1 to -1. Will Dijkstra algorithm work on this graph? Justify your answer
I hope you found the answer to your question, I won't be able to help with the first part of the question, but for the second part the answer is no, Dijkstra's algo won't work if the value is changed from 1 to -1 because of the greedy nature of the algo. Making a weight negative lessens the reward so the algo won't take the same route, even if it's the shortest path. In general, Dijkstra's algo fails in the cases of negative weights. (Do correct me if I am wrong somewhere).
Amazing sir ji , kya mast samjhaya hai , mujhe dar lag raha tha ki msc ko kyse nikalungi but ab lag raha hai first division le aaungi , bahut bahut dhanyavad sir aapki video bahut jada helpful hai, please sir msc ka aur video laiye na 🙏🙏🙏🙏
abhi mere paas pese hote to aapko 10000 rs thanks kar deta ! aap itna accha padhate ho ! thank you so much sir ! par aap bhot jaldi padhate ho thoda har kisi cheej ke peeche reason bhi bataya karo ! accha rahega !
Sir I had a doubt so referred online and your definition of Lattice is wrong , the definition is existence of GLB and LUB for all pairs , simply there can be several lower bounds but greatest of them is just one if exists , ( example for LUB of a and b , c and d seem to be at the same level but as in poset every element is comparable and c is lesser than d, c would be GLB ) ..
Now this was literally the best video on posets, lattices, hasse.
Who is watching this video 1 day before the paper?😂
Thanks for 128 likes
5 hrs before
Me
I'm watching today after an hour is my exam 😂
Me 😂
1 hour before paper
I was watching this video.... suddenly मुझे लगा कि क्यों ना एकबार Comments के उपर guidelines को पढ़ ले..... I couldn't stop laughing after reading your guideline Sir 😂..... Hats off !
😂😂😂
Legends here morning of the exam😂
So relatable
Haha so true
Real😂
Sir it's really helpful but at some point in the lisst it's really confusing 😅😅 and sir if possible plz explain it little slow 🦥 thanks sir ❤️
hey boomer - youtube has feature to make video slower - i myself listen in 1.75x
@@movocode same
Here me playing this at 2x
Bhai 0.75x per speed kerle
Me watching at 2x😂😂
in 4 hrs i have exam of this subject.For last moment student you teaching work as a miracle
@@Abdullahk11304 yup bro
Best lecture ever 💪
val lagil sir agole aru dibo buli akha thakil
Sir G sach mai jitni apki tareef ki jaye utni kam
Aap ne buht buht zayda meri help ki shukeriya ❤❤
Sir you're a blessing for every student. And it's understandable with so much ease. Jitna thank you bole kam h
sir you look like puneet superstar!!
🤣🤣
😂😂😂
unique means different .... right?
Thanks 👍 sir
Sir bahut gazab aur itna easy kaise samjha lete hai aap hazaro dilo me sir ke liye jagah h
thanks guruji best video on youtube👍👍👍👍
Hello sir... BCA ka DM bhut hard tha college me bilkul smjh nhi aata tha aapke video ki help se pass ho gai thank you so much 😊
Sir aap jaise teacher ko Dekh ke teacher banne ka man karta hain
What is POSET? Draw the Hasse diagram representing the positive divisions of 36
(i.e., D36). Also find out minimal, maximal, greatest, and least elements.
sir please solve these type of problem
If a relation set 'R' is reflexive, antisymmetric and transitive then set R is POSET...
that's a famous question, you need to draw directly writing all the relations with 1-36
Understood all points rapidly.... thanks
Sir, you are great. Your teaching method is very effective and great🤗.....
Before 1day of exam
Thanks sir ji
Thank you sir it's very helpful
Thank you so much sir ☺️ directed graph per bhi video banayiye sir.
Thank you so much Sir 🙏🙏 You are really helped me to got it...
Right, Right, Right, Right........ 🙂🙂
@@yuvanshdhuwariya7 right
@@Velvett_Thunder😂😂
Thank you sir , watching just a day before our exam!!
sir,apke videos ke vajah se mera accha revision ho gaya.
sir please solve this question🙏🙏🙏🙏🙏🙏🙏
Q. Implement Dijkstra's algorithm step by step on the 8
following graph to find the minimum distance and path
from vertex 0 to vertex 4.
If weight of edge 7 to 6 is changed from 1 to -1. Will
Dijkstra algorithm work on this graph? Justify your answer
I hope you found the answer to your question, I won't be able to help with the first part of the question, but for the second part the answer is no, Dijkstra's algo won't work if the value is changed from 1 to -1 because of the greedy nature of the algo. Making a weight negative lessens the reward so the algo won't take the same route, even if it's the shortest path. In general, Dijkstra's algo fails in the cases of negative weights. (Do correct me if I am wrong somewhere).
Amazing sir ji , kya mast samjhaya hai , mujhe dar lag raha tha ki msc ko kyse nikalungi but ab lag raha hai first division le aaungi , bahut bahut dhanyavad sir aapki video bahut jada helpful hai, please sir msc ka aur video laiye na 🙏🙏🙏🙏
Qwerty
Sir owsam 👍🏻👍🏻👍🏻
great efforts for basics msc student❤ thank you sir
Thank you saaaaaar 😊
आपका बहुत बहुत आभार व्यक्त करता हूं
Thanks 👍
Handwriting ⬇️⬇️⬇️
Thanks from heart ❤
Very nice
Getting your point sir 😃😄
Thanks for the easiest explanation 🗿
Nice lecture sir
Crystal clear sir…….thanks sir for making this topic video classes…GOD SAI BLESS YOU 😍😍
Nicest❤
BESTTTT LECTURE THANK YOU SIR
Osme ❤
Great Explanation sir
Thnk u so much sir
Today my exam and me Watching 2x 😅😅😅
NICE BRO🥰😍
Jenwin SIR. Maja aa gya bro
Thanku sir🙏
gzb❤❤🎉😊
Super sir 🔥
thank you sir
😍🤓
great sir
thankyou so much sir ❤ very best
Thnks sir happy guru pudima
Tq this is so helpful!!
sir you are a god
Before 2 hr of the exam 😂
saviour
Tommmorrow my exam but I watching before night
Too good explanation sir❤
Nice lecture
Excellent
Thank You very much sir for explaining us in a very good manner and we understand in a good manner and very fast
Sir I have one doubt that at this duration 26:34 secs , 2 and 6 lub wouldn't be 6 ?
Thank you very much sir ...
A day before exam
superbbbbb!!!!
👌👌👌👌👌awosam
1 day before exam
🤗🤗🤗🤗🤗
Thanks sir I am the student of bca and these videos is helpful for ma
thanks for helping in exams last day 😌😌
Sir discrete mathematics all topic kab tak ho jayenge
Sir upper bound aur lower bound ki Definition m x€A ki jagah x€p hoga na
Thanks sir
Thank you so much
Superb explanation
Sir in the last question of lattice the relation will not be transitive so it would not be poset.
29:40 agar Hume 6&4 lete toh humare lower bound toh 2 ajata sir ??? Bss yhi thoda sa confusion hai baki sab top samjhaya
Thank 😊 you ❤ 😘 sir 😊
Is this enough for mca exam?
Abhi dekh raha hun 2 bje paper hai aktu😂😂😂😂😂😂
Ese likh sakte hain right right... Right😊
Thanks a lot sir for this series
aisa lg rha h sir khud bhi sikh rhe h :D
abhi mere paas pese hote to aapko 10000 rs thanks kar deta ! aap itna accha padhate ho ! thank you so much sir ! par aap bhot jaldi padhate ho thoda har kisi cheej ke peeche reason bhi bataya karo ! accha rahega !
At the part 23:37 , the diagram which is lattice.. how c is the unique.. can u explain how it is unique..?
@@Payal_Ojha because we are searching for greatest lower bound and c is above a that's why it is considered as unique greatest lower bound
Because we are searching for greatest lower bound and c is above a that's why it is considered as unique greatest lower bound
Thank you anukriti but my semester has over a year ago and you are late now but I'm thankful for your help
Last night preparation 😂
Sir yah Jo lower bond aur upper bound wala topic hai usmein jo aapane example diya hai usmein relation kya hai is diagram me
Right
Kya 5 6 7 ke lower bound me 4aur 8 aayenge kya ❤
sir please complete this course
Thek h bhai ok bhai
Lower bound and upper bound should be unique means sirf ek hee ho skta h???
Sir I had a doubt so referred online and your definition of Lattice is wrong , the definition is existence of GLB and LUB for all pairs , simply there can be several lower bounds but greatest of them is just one if exists , ( example for LUB of a and b , c and d seem to be at the same level but as in poset every element is comparable and c is lesser than d, c would be GLB ) ..
Sir agar Lattice ke question 3 mai hum (1,2) ka pair le tab uska least upper bound toh (6,4) hoga toh woh lattice kaise hai?
(6,4) nahi lekin 2 aayega lup kyuki 1 bhi 2 se relate karge and 2 bhi khud se relate karega. Starting mein reflexive property padhai thi uski vajah se
2hr before exam 😂
right
Thank you sir, lovely videos , exams saver😇
Show that every chain is distributive lattice