Lattice (GATE Problems) - Set 1

preview_player
Показать описание
Discrete Mathematics: Lattice (GATE Problems) - Set 1
Topics discussed:
1) GATE 2008 (IT) problem based on Lattices.
2) GATE 2017 problem based on Lattices.

Music:
Axol x Alex Skrindo - You [NCS Release]

#DiscreteMathematicsByNeso #DiscreteMaths #PartialOrdering #Lattice
Рекомендации по теме
Комментарии
Автор

Solved both the questions on my own. Thanks to your teaching only.

rajeshprajapati
Автор

at 3:40, shouldn't the greatest lower bound (GLB) of (d, e) be a?
Here is my working -
1. The lower bounds of d and e are b, c, a
2. As b and c are incomparable, they cannot be greatest lower bound
3. As a relates to both d and e transitively and also a relates to b and c (which fulfills the criteria for greatest lower bound), we can say a is the greatest lower bound?

PuffinParrot
Автор

You are very very very professinal teacher thank you very much you helped me a lot, but may sir upload more than one video a day, please. I need you to reach graph theory as i am a university student and my next exam include this topic, please.

jacobzixuan
Автор

I think even if transient state exists we may declare the Hassle diagram a lattice.
As the transient state is not a hindrance in the LUB or GLB generation.

suindude
Автор

So if we generate in the transient elements with GLB and LUB we may find a lattice.

suindude
Автор

The last diagram there is intermediate has an element so there can be a chance of not being a lattice.

suindude
Автор

aoa sir, sir plzz ap ek apni vlog link banayein takhe hum wahan se apke discret maths notes download kar sakhey apne paas plzz?

kainaatmakhani