holds in every instance in every instance in every
instance in every instance in every instance of every relation is this point
instance of every relation is this point clear let me
clear let me know okay so very simple point that this
know okay so very simple point that this trivial functional dependency this will
trivial functional dependency this will always be true this will always be true
always be true this will always be true in every instance of every relation so
in every instance of every relation so this is the concept of trivial
this is the concept of trivial functional dependency now tell me when
functional dependency now tell me when can I say a functional dependency is
can I say a functional dependency is non-trivial when can I say a functional
non-trivial when can I say a functional dependency is non-trivial please tell me
dependency is non-trivial please tell me what the definition of non-trivial
what the definition of non-trivial functional dependency the name itself is
functional dependency the name itself is telling you non-trivial means which is
telling you non-trivial means which is not trivial yes or no FD which is not
not trivial yes or no FD which is not trivial FD which is not trivial which is
trivial FD which is not trivial which is not trivial the name itself is telling
not trivial the name itself is telling you non-trivial functional dependency
you non-trivial functional dependency means an FD okay a functional dependency
means an FD okay a functional dependency which is not trivial for example okay uh
which is not trivial for example okay uh so in simple words I can say when can I
so in simple words I can say when can I say x determines Y is non-trivial tell
say x determines Y is non-trivial tell me when can I say this is a nontrivial
me when can I say this is a nontrivial FD when can I say this is non-trivial FD
FD when can I say this is non-trivial FD tell
tell me let me know I can say this is
me let me know I can say this is non-trivial FD if and only if X is not
non-trivial FD if and only if X is not superet of Y yes or no if and only if X
superet of Y yes or no if and only if X is not superet of Y okay then this will
is not superet of Y okay then this will be called non-trivial functional depend
be called non-trivial functional depend uh non-trivial functional dependency is
uh non-trivial functional dependency is this clear very simple point so remember
this clear very simple point so remember if it is not trivial then it is
if it is not trivial then it is non-trivial is this clear let me ask you
non-trivial is this clear let me ask you some questions for example let's assume
some questions for example let's assume r a b c d okay this relation I'm giving
r a b c d okay this relation I'm giving you now you tell me which is
you now you tell me which is non-trivial which FD is non-trivial some
non-trivial which FD is non-trivial some functional dependencies I'm giving you
functional dependencies I'm giving you and you tell me which of them is
and you tell me which of them is non-trivial which functional dependency
non-trivial which functional dependency is non-trivial for example let me give
is non-trivial for example let me give you some questions like a determining a
you some questions like a determining a let me ask you another question a
let me ask you another question a determining
determining B AB determining
AC a determining BC
BC a determining
a Ab CD determining AB okay tell me which of them is Trivial
AB okay tell me which of them is Trivial which of them is not trivial let me know
which of them is not trivial let me know which of them is Trivial which of them
which of them is Trivial which of them is not trivial which functional
is not trivial which functional dependenc is not trivial so you can see
dependenc is not trivial so you can see this is Trivial right yes or no this is
this is Trivial right yes or no this is Trivial this is a trivial this is
Trivial this is a trivial this is Trivial right agree so you can see this
Trivial right agree so you can see this is
is Trivial what about this this is also
Trivial what about this this is also trivial this is also trivial okay you
trivial this is also trivial okay you can see which is non-trivial you can see
can see which is non-trivial you can see this is non-trivial because this is not
this is non-trivial because this is not superet of
superet of BC this is non-trivial because you can
BC this is non-trivial because you can see this a this a this is not superet of
see this a this a this is not superet of ab this is
ab this is non-trivial this is Trivial this is
non-trivial this is Trivial this is non-trivial this is non-trivial is this
non-trivial this is non-trivial is this clear so which functional dependencies
clear so which functional dependencies are non-trivial the answer will be 2 3 4
are non-trivial the answer will be 2 3 4 5 6 yes or no the answer will be 2 3 4 5
5 6 yes or no the answer will be 2 3 4 5 6 2 3 4 5 6 these are the non-trivial is
6 2 3 4 5 6 these are the non-trivial is this point clear please tell me so very
this point clear please tell me so very simple non-trivial functional dependency
simple non-trivial functional dependency means a functional dependency which is
means a functional dependency which is not trivial
not trivial okay so this is the definition of
okay so this is the definition of trivial and non-trivial so what the
trivial and non-trivial so what the definition of trivial Alpha implies beta
definition of trivial Alpha implies beta is Trivial if Alpha is superet of beta
is Trivial if Alpha is superet of beta Alpha is a superet of beta or I can say
Alpha is a superet of beta or I can say beta is a subset of alpha yes or no so
beta is a subset of alpha yes or no so Alpha implies beta that is Trivial if
Alpha implies beta that is Trivial if and only if beta is a subset of alpha or
and only if beta is a subset of alpha or I can say LHS is a superet of rhs yes or
I can say LHS is a superet of rhs yes or no LHS is superet of rhs remember if you
no LHS is superet of rhs remember if you have this functional dependency then
have this functional dependency then this Alpha this Alpha will be called LHS
this Alpha this Alpha will be called LHS and this beta will be called rhs is this
and this beta will be called rhs is this clear please tell me is this clear now
clear please tell me is this clear now tell me if I give you this functional
tell me if I give you this functional dependency if I give you this functional
dependency if I give you this functional dependency now tell me who is LHS who is
dependency now tell me who is LHS who is LHS if I give you this functional
LHS if I give you this functional dependency who is LHS remember this is
dependency who is LHS remember this is same as B determining a these are same
same as B determining a these are same so remember this B will be the LHS okay
so remember this B will be the LHS okay so here remember this is the LHS
so here remember this is the LHS and remember this a will be the
and remember this a will be the rhs okay so very simple point so
rhs okay so very simple point so remember whenever you have a functional
remember whenever you have a functional dependency Alpha implies beta then this
dependency Alpha implies beta then this Alpha will be LHS and beta will be rhs
Alpha will be LHS and beta will be rhs okay so very simple point so we have
okay so very simple point so we have seen what is a trivial functional
seen what is a trivial functional dependency trivial functional dependency
dependency trivial functional dependency means this is a subset of this I can say
means this is a subset of this I can say this rhs is subset of LHS yes or no rhs
this rhs is subset of LHS yes or no rhs is subset of LHS this is called trivial
is subset of LHS this is called trivial functional dependency otherwise if a
functional dependency otherwise if a functional dependency is not trivial
functional dependency is not trivial then it is non-trivial yes or no so you
then it is non-trivial yes or no so you can see so you can see this that if a
can see so you can see this that if a functional dependency is not trivial
functional dependency is not trivial okay otherwise it will be non-trivial
okay otherwise it will be non-trivial okay so either a functional independency
okay so either a functional independency will be trivial or it will be
will be trivial or it will be non-trivial very simple point now let me
non-trivial very simple point now let me tell you one more concept that is given
tell you one more concept that is given Inman book see this is not given in
Inman book see this is not given in other books only in the man book this is
other books only in the man book this is given that is something called compl
given that is something called compl completely non-trivial okay this concept
completely non-trivial okay this concept this concept is given in the ulman book
this concept is given in the ulman book this concept is given in the man book
this concept is given in the man book only this definition this is just a
only this definition this is just a definition nothing else okay this is
definition nothing else okay this is given in only in thean book this is not
given in only in thean book this is not given in the N this is not given in cour
given in the N this is not given in cour this is not given in I can say rurak
this is not given in I can say rurak Krishna but this is only given in the
Krishna but this is only given in the man but this is also very simple when
man but this is also very simple when can I say completely non-trivial
can I say completely non-trivial completely non-trivial that means LHS
completely non-trivial that means LHS and rhs they are disjointed completely
and rhs they are disjointed completely non-al what that means that means LHS
non-al what that means that means LHS and rhs they are disjointed means they
and rhs they are disjointed means they have nothing common they have nothing
have nothing common they have nothing common this will be called completely
common this will be called completely non-trivial okay so this is just a
non-trivial okay so this is just a definition nothing else so you can see
definition nothing else so you can see trivial means what trivial means trivial
trivial means what trivial means trivial means these B's these are subset of A's
means these B's these are subset of A's non-trivial means non-trivial means that
non-trivial means non-trivial means that it is not trivial okay non-trivial that
it is not trivial okay non-trivial that means it is not trivial and what is
means it is not trivial and what is completely non-trivial that means LHS
completely non-trivial that means LHS and rhs they have nothing
and rhs they have nothing common is this clear see what the
common is this clear see what the definition of trival please tell me if
definition of trival please tell me if if I give you a functional dependency X
if I give you a functional dependency X determining y when can I say it will be
determining y when can I say it will be trivial let me know when can I say it
trivial let me know when can I say it will be
will be trivial when can I say this is Trivial
trivial when can I say this is Trivial this will be trivial if this LHS is
this will be trivial if this LHS is superet of rhs okay very simple when can
superet of rhs okay very simple when can I say this is
I say this is non-trivial when can I say this is
non-trivial when can I say this is non-trivial when can I say this will be
non-trivial when can I say this will be non-trivial non-trivial means X is not
non-trivial non-trivial means X is not superet of Y yes or no simply in simple
superet of Y yes or no simply in simple words in simple words in simple words
words in simple words in simple words not
not trivial okay in simple words I can say
trivial okay in simple words I can say not trivial and when can I say it is
not trivial and when can I say it is completely
completely non-trivial when can I say it is
non-trivial when can I say it is completely
non-trivial when can I say that it is completely non-trivial when can I say
completely non-trivial when can I say that is completely non-al
that is completely non-al this we will say that when X
this we will say that when X intersection Y is empty when they have
intersection Y is empty when they have nothing common they have nothing common
nothing common they have nothing common X comma y are completely disjointed okay
X comma y are completely disjointed okay that means X comma y have nothing
that means X comma y have nothing common have nothing
common okay so their intersection is five in this situation we will call it
five in this situation we will call it completely non-trivial so these are the
completely non-trivial so these are the three definitions okay quite easy quite
three definitions okay quite easy quite easily you can see okay so very simple
easily you can see okay so very simple now let's move on now let's see this
now let's move on now let's see this question tell me the answer for this
question tell me the answer for this question what the answer for this
question what the answer for this question regarding trivial functional
question regarding trivial functional dependencies which best describes
dependencies which best describes completely non-trivial the question is
completely non-trivial the question is asking for the definition of completely
asking for the definition of completely non-trivial so what is the definition of
non-trivial so what is the definition of completely non-trivial if a functional
completely non-trivial if a functional dependency X to Y holds where X
dependency X to Y holds where X intersection Y is five yes this is the
intersection Y is five yes this is the definition of completely non-trivial yes
definition of completely non-trivial yes or no this is the definition of
or no this is the definition of completely non- trial tell me tell me
completely non- trial tell me tell me this is the definition of what this
this is the definition of what this statement this is statement if a
statement this is statement if a functional dependency holds where Y is
functional dependency holds where Y is subset of X this is your trivial
subset of X this is your trivial functional
functional dependency this is your trivial
dependency this is your trivial functional dependency what about this
functional dependency what about this last one what about this last one tell
last one what about this last one tell me this last one what about the last one
me this last one what about the last one the last one is
the last one is non-trivial the last one is non-trivial
non-trivial the last one is non-trivial this is non-trivial functional
this is non-trivial functional dependencies okay and this middle one
dependencies okay and this middle one what is this middle one this is your
what is this middle one this is your completely
non-trivial this is your completely non-trivial so can I say this is
non-trivial so can I say this is non-trivial also can I say every
non-trivial also can I say every completely non-trivial that is
completely non-trivial that is non-trivial every completely non-trivial
non-trivial every completely non-trivial is non-trivial also yes of course yes of
is non-trivial also yes of course yes of course right okay so remember this is
course right okay so remember this is non-trivial also this implies
non-trivial also this implies non-trivial also okay this implies
non-trivial also okay this implies non-trivial also okay so very simple
non-trivial also okay so very simple point so this is the definition of
point so this is the definition of trivial this is the definition of
trivial this is the definition of non-rival and this is the definition of
non-rival and this is the definition of completely non-trivial so this is the
completely non-trivial so this is the idea okay let's move on
idea okay let's move on now now I want to tell you one thing a
now now I want to tell you one thing a misconception I want to tell you maybe
misconception I want to tell you maybe some of you have seen this word
some of you have seen this word semi-trivial have you seen this
semi-trivial have you seen this word maybe you have seen this word on
word maybe you have seen this word on the YouTube or maybe in some other uh
the YouTube or maybe in some other uh know standard resources okay maybe you
know standard resources okay maybe you have seen
have seen this in some coaching Institute maybe
this in some coaching Institute maybe you have seen this so let me tell you
you have seen this so let me tell you this does not exist in the standard
this does not exist in the standard resources this semi-trivial no such
resources this semi-trivial no such concept exist in standard resources so
concept exist in standard resources so this is not a standard concept okay so
this is not a standard concept okay so anyway I'm just see some students are
anyway I'm just see some students are saying that uh they are reading dbms for
saying that uh they are reading dbms for the first time that is good okay that is
the first time that is good okay that is good whatever I'm teaching you I'm
good whatever I'm teaching you I'm telling you I'm teaching you from the
telling you I'm teaching you from the standard resources for every concept I'm
standard resources for every concept I'm giving you multiple I can say screenshot
giving you multiple I can say screenshot of standard resources ulman nagak
of standard resources ulman nagak Krishna okay all the standard resources
Krishna okay all the standard resources we are covering but I'm telling you that
we are covering but I'm telling you that in some in some coaching institutes this
in some in some coaching institutes this type of Concepts this type of concepts
type of Concepts this type of concepts are taught okay this semi-trivial
are taught okay this semi-trivial functional dependency this is taught but
functional dependency this is taught but let me tell you no such concept exist in
let me tell you no such concept exist in any standard resource there is no
any standard resource there is no standard resource containing this type
standard resource containing this type of concept okay so very simple Point
of concept okay so very simple Point okay this semi-trivial functional
okay this semi-trivial functional dependency this type of concept does not
dependency this type of concept does not exist in the standard resources okay so
exist in the standard resources okay so whatever we have seen that that is from
whatever we have seen that that is from the standard resources trivial
the standard resources trivial functional dependency non-trivial
functional dependency non-trivial functional dependency everything that we
functional dependency everything that we have seen okay is this clear let me
have seen okay is this clear let me know now one more topic one small topic
know now one more topic one small topic that is another notation for functional
that is another notation for functional dependencies this is another notation
dependencies this is another notation this is another way of uh I can say
this is another way of uh I can say describing the functional dependency
describing the functional dependency what is this another notation this is
what is this another notation this is just a notation nothing else remember
just a notation nothing else remember this is just a alternative notation for
this is just a alternative notation for functional dependency what this notation
functional dependency what this notation says this notation says that see if you
says this notation says that see if you have this functional dependency a
have this functional dependency a determines B then you can you can you
determines B then you can you can you can describe this like this see okay A B
can describe this like this see okay A B C D what you can do you can put like
C D what you can do you can put like this that a like this okay see very
this that a like this okay see very simple this is just a notation these two
simple this is just a notation these two things are same these two things are
things are same these two things are same for example if you want to describe
same for example if you want to describe a determines BC how will you do that if
a determines BC how will you do that if you want to describe a determines BC how
you want to describe a determines BC how will you do that this LHS this LHS you
will you do that this LHS this LHS you will do like this and for the rhs you
will do like this and for the rhs you will put the arrow okay for the rhs you
will put the arrow okay for the rhs you will put the arrow like this is this
will put the arrow like this is this clear this is just a notation this is
clear this is just a notation this is just an alternative notation nothing
just an alternative notation nothing else please tell me did you understand
else please tell me did you understand this this is just an alternative
this this is just an alternative notation that this functional dependency
notation that this functional dependency you can represent like this okay so what
you can represent like this okay so what is here see what is happening means
is here see what is happening means basically I'm saying that LHS implies
basically I'm saying that LHS implies rhs this you can this you can denote
rhs this you can this you can denote like this in LHS let's assume you have
like this in LHS let's assume you have for example in LHS let's assume you have
for example in LHS let's assume you have AB determining let's assume CD okay
AB determining let's assume CD okay let's assume you have AB determining CD
let's assume you have AB determining CD then how will you denote it then how
then how will you denote it then how will you represent it a b CDE e how will
will you represent it a b CDE e how will you represent it very simple this is
you represent it very simple this is your LHS right this is your LHS so for
your LHS right this is your LHS so for this LHS you will use without Arrow okay
this LHS you will use without Arrow okay you will use it without Arrow you will
you will use it without Arrow you will show it without Arrow okay you will show
show it without Arrow okay you will show it without Arrow you will be shown okay
it without Arrow you will be shown okay without Arrow show without Arrow what I
without Arrow show without Arrow what I can say I can say that show this without
can say I can say that show this without Arrow show without arrow in this
Arrow show without arrow in this notation in this alternative
notation in this alternative notation alternative notation okay so in
notation alternative notation okay so in this alternative notation this LHS will
this alternative notation this LHS will be shown without Arrow okay for the LHS
be shown without Arrow okay for the LHS you don't have to put the arrow and for
you don't have to put the arrow and for the rhs you will put the arrow okay show
the rhs you will put the arrow okay show with
with arrow show with
arrow show with arrow so this is the notation see what
arrow so this is the notation see what is what will happen this is how you will
is what will happen this is how you will do so this is how you will do okay so
do so this is how you will do okay so something like this or what you can do
something like this or what you can do something like this you can do that like
something like this you can do that like this and then you will put Arrow
this and then you will put Arrow here is this clear please tell me is
here is this clear please tell me is this understood let me know so like this
this understood let me know so like this you can denote so remember this you will
you can denote so remember this you will put without arrow and this you will put
put without arrow and this you will put with arrow is this understood okay so
with arrow is this understood okay so very
very simple for example let's see this if
simple for example let's see this if this diagram is given to you then what
this diagram is given to you then what are the functional dependencies if this
are the functional dependencies if this diagram is given to you then what are
diagram is given to you then what are the functional
the functional dependencies from this diagram what are
dependencies from this diagram what are the functional
dependencies functional dependencies in part A what are the functional
part A what are the functional dependencies for example look at this
dependencies for example look at this see this is without Arrow right yes or
see this is without Arrow right yes or no this is without Arrow correct this is
no this is without Arrow correct this is without Arrow so what that means this is
without Arrow so what that means this is without arrow and these are Arrow Arrow
without arrow and these are Arrow Arrow Arrow Arrow okay so what I can say I can
Arrow Arrow okay so what I can say I can say SSN determines these four things yes
say SSN determines these four things yes or no okay SSN determines these four
or no okay SSN determines these four things so remember what this will mean
things so remember what this will mean what this entire thing this entire thing
what this entire thing this entire thing what this means this entire thing look
what this means this entire thing look at this entire thing okay this entire
at this entire thing okay this entire thing what this means this means that
thing what this means this means that SSN determines this is LHS basically
SSN determines this is LHS basically basically this means LHS this means LHS
basically this means LHS this means LHS and these arrows these are rhs so I can
and these arrows these are rhs so I can say SSN implies e
say SSN implies e name okay e name comma B date birthday
name okay e name comma B date birthday birthday date comma
birthday date comma address and comma D number
address and comma D number okay so like this so this is your
okay so like this so this is your functional dependency is this clear let
functional dependency is this clear let me know very simple right yes or no so
me know very simple right yes or no so remember this without Arrow this is your
remember this without Arrow this is your LHS and this Arrow these are your rhs so
LHS and this Arrow these are your rhs so like this you can say okay so this is
like this you can say okay so this is how you can do so very simple so this
how you can do so very simple so this means SSN implies this SSN this implies
means SSN implies this SSN this implies these things okay what about this next
these things okay what about this next one what about this
one see what about this one look at this and tell me what about this one here you
and tell me what about this one here you can again notice this is without Arrow
can again notice this is without Arrow right this is your LHS there is no Arrow
right this is your LHS there is no Arrow okay these are not connected c c see
okay these are not connected c c see okay this is separate it's not connected
okay this is separate it's not connected is this clear these are separate okay
is this clear these are separate okay this look at this look at this this is
this look at this look at this this is separate so here you can see that what
separate so here you can see that what this will be this will be that D number
this will be this will be that D number I can say d number implies what D number
I can say d number implies what D number implies D
implies D name d name
name d name comma D manager name d manager s name uh
comma D manager name d manager s name uh SSN D manager
SSN D manager SSN okay so this is the meaning I hope
SSN okay so this is the meaning I hope you understood similarly can you do for
you understood similarly can you do for the next one for the next how many fds
the next one for the next how many fds are there in the second one in the
are there in the second one in the second one how many fds are there look
second one how many fds are there look at the second one there are total three
at the second one there are total three fds okay what is the first FD okay let's
fds okay what is the first FD okay let's look at this second one in this what is
look at this second one in this what is FD number one FD number one what is that
FD number one FD number one what is that that is your LHS is this LHS is
that is your LHS is this LHS is combination of SSN comma p number yes or
combination of SSN comma p number yes or no combination of this implies
no combination of this implies ours okay very simple what is your FD
ours okay very simple what is your FD number two what is your functional
number two what is your functional dependency two that is SSN implies e
dependency two that is SSN implies e name SSN implies
name SSN implies eame okay what is your FD number three
eame okay what is your FD number three what is your FD number three that is p
what is your FD number three that is p number implies that is p number implies
number implies that is p number implies P name comma P
P name comma P location okay so is this clear let me
location okay so is this clear let me know so you have three functional
know so you have three functional dependencies fd1 fd2 fd3 so this is your
dependencies fd1 fd2 fd3 so this is your alternative notation nothing else very
alternative notation nothing else very simple this is very simple okay so this
simple this is very simple okay so this is your diagram notation you can read
is your diagram notation you can read okay you can check
okay you can check it now tell me the answer for this one
it now tell me the answer for this one what are the functional
what are the functional dependencies in this you find functional
dependencies in this you find functional dependencies how many functional
dependencies how many functional dependencies are given in this in this
dependencies are given in this in this diagram how many functional dependencies
diagram how many functional dependencies are given find functional
are given find functional dependencies so tell me what are the
dependencies so tell me what are the functional dependencies given by this
functional dependencies given by this diagram so you can see this functional
diagram so you can see this functional dependency tell me what this functional
dependency tell me what this functional dependency let me know this functional
dependency let me know this functional dependency is AB
dependency is AB determining c d e FG yes or no a
determining c d e FG yes or no a determining CD F EFG this is your this
determining CD F EFG this is your this is your functional dependency what is
is your functional dependency what is this functional dependency this
this functional dependency this functional dependency this is your a
functional dependency this is your a determining D what is this functional
determining D what is this functional dependency this is your e determining G
dependency this is your e determining G okay and finally what is this functional
okay and finally what is this functional dependency this is your C determining
dependency this is your C determining B okay understood so this notation is
B okay understood so this notation is this notation clear please tell me this
this notation clear please tell me this notation is it
notation is it clear
clear okay so let's solve this question tell
okay so let's solve this question tell me the answer for this
me the answer for this question a very nice question to help
question a very nice question to help you understand what is functional
you understand what is functional dependency what the meaning of
dependency what the meaning of functional
functional dependency understand the meaning of
dependency understand the meaning of functional dependency so there is a
functional dependency so there is a relation apply application form you know
relation apply application form you know okay so like for example when you will
okay so like for example when you will apply for the colleges after the gate
apply for the colleges after the gate exam you will apply for the colleges
exam you will apply for the colleges counseling you will do the counseling
counseling you will do the counseling right okay so this is your apply now SSN
right okay so this is your apply now SSN means student student serial number okay
means student student serial number okay this is your student serial number this
this is your student serial number this is like AAR card number something like
is like AAR card number something like that okay this is your student serial
that okay this is your student serial number so I can say this is like your
number so I can say this is like your AAR card number so you can say this is
AAR card number so you can say this is your student serial number this is
your student serial number this is unique right okay so anyway so this is
unique right okay so anyway so this is your student serial number next this is
your student serial number next this is your college name what is the c name the
your college name what is the c name the C name this is your college
C name this is your college name this is your college name okay now
name this is your college name okay now the question is saying which Real World
the question is saying which Real World situation is captured by this functional
situation is captured by this functional dependency which Real World situation is
dependency which Real World situation is captured by this functional dependency
captured by this functional dependency this functional dependency is given to
this functional dependency is given to you now tell me which Real World
you now tell me which Real World situation is captured by this functional
situation is captured by this functional dependency tell me what this functional
dependency tell me what this functional dependency says when you say that
dependency says when you say that SSN college name this combination
SSN college name this combination determines date okay means if this
determines date okay means if this combination is same please understand if
combination is same please understand if this combination is same then date will
this combination is same then date will be same if if if this combination is
be same if if if this combination is same then date will be same what that
same then date will be same what that means what that means for example let's
means what that means for example let's assume you uh let's assume okay let me
assume you uh let's assume okay let me take moit okay for example moit is
take moit okay for example moit is applying okay let's moit is applying for
applying okay let's moit is applying for it Bombay okay college name is it Bombay
it Bombay okay college name is it Bombay okay moit applies for I Bombay now in I
okay moit applies for I Bombay now in I Bombay for multiple courses you can
Bombay for multiple courses you can apply yes yes or no you can apply for
apply yes yes or no you can apply for multiple courses agree with me okay for
multiple courses agree with me okay for multiple courses you can apply for
multiple courses you can apply for example let's measure you can see this
example let's measure you can see this is your measure that is given to you
is your measure that is given to you okay measure so for multiple courses you
okay measure so for multiple courses you can apply now what moit is doing for
can apply now what moit is doing for computer science also he applies okay
computer science also he applies okay for maybe I can say for artificial
for maybe I can say for artificial intelligence also he applies okay okay
intelligence also he applies okay okay maybe he also applies for I can say uh
maybe he also applies for I can say uh Compu CDs okay so in I Bombay I think
Compu CDs okay so in I Bombay I think there is no CDs that is in Bangalore
there is no CDs that is in Bangalore anyway so you can see M applies for it
anyway so you can see M applies for it Bombay now you tell me this combination
Bombay now you tell me this combination whenever this combination is same date
whenever this combination is same date must be same agree with me do you agree
must be same agree with me do you agree with me do you agree with me that
with me do you agree with me that whenever this combination is same if
whenever this combination is same if this combination is same this
this combination is same this combination is same so this date must be
combination is same so this date must be same this date this must be same so okay
same this date this must be same so okay so let me say like for example for
so let me say like for example for April okay so you can see something like
April okay so you can see something like this I hope you you understood so you
this I hope you you understood so you can see that so from here what I can say
can see that so from here what I can say from here what I can say I can say that
from here what I can say I can say that for a particular College a particular
for a particular College a particular student can apply in all the courses on
student can apply in all the courses on a fixed date yes or no means if you take
a fixed date yes or no means if you take a student you take and a college you
a student you take and a college you take if this combination you take a
take if this combination you take a student plus combination uh sorry
student plus combination uh sorry student plus College this combination
student plus College this combination you take now for this combination all
you take now for this combination all the application forms they must be
the application forms they must be submitted on the same date yes or no do
submitted on the same date yes or no do you agree with me yes or no so remember
you agree with me yes or no so remember if moit wants to apply for it Bombay
if moit wants to apply for it Bombay then he has to apply for all the courses
then he has to apply for all the courses he has to apply on the same date do you
he has to apply on the same date do you agree is this clear please tell me this
agree is this clear please tell me this is the meaning yes or no so I can say I
is the meaning yes or no so I can say I can say that every application form from
can say that every application form from a student see every application from a
a student see every application from a student from a student to a specific
student from a student to a specific College must be on the same date this is
College must be on the same date this is the answer answer is option D is this
the answer answer is option D is this clear let me know now can you give me a
clear let me know now can you give me a situation which you will violate option
situation which you will violate option ABC can you violate option
ABC can you violate option ABC let's try to violate option ABC see
ABC let's try to violate option ABC see option A saying a student can only apply
option A saying a student can only apply for one college nothing like that yes or
for one college nothing like that yes or no nothing like that you can apply for
no nothing like that you can apply for multiple colleges you can apply for
multiple colleges you can apply for multiple colleges for example moit can
multiple colleges for example moit can apply for moit can apply for ISC Bank
apply for moit can apply for ISC Bank also okay for ISC Bangalore for computer
also okay for ISC Bangalore for computer science he can apply okay on some on
science he can apply okay on some on some other date or maybe same date does
some other date or maybe same date does not matter okay on same date also you
not matter okay on same date also you can apply but the point is that same
can apply but the point is that same student can apply for different colleges
student can apply for different colleges yes or no is this clear let me
yes or no is this clear let me know so very simple point so I can say
know so very simple point so I can say option A that is gone option A is gone
option A that is gone option A is gone is this clear a student can only apply
is this clear a student can only apply for one college that is not correct what
for one college that is not correct what about this one a student can apply to
about this one a student can apply to each College only once is this true is
each College only once is this true is this true that a student can apply to
this true that a student can apply to each College only once no you can notice
each College only once no you can notice moit can apply for I Bombay three times
moit can apply for I Bombay three times but on the same date yes or no you can
but on the same date yes or no you can apply three times but on the same date
apply three times but on the same date the date must not change yes or no you
the date must not change yes or no you should not change the date so moit can
should not change the date so moit can apply for it Bombay three times four
apply for it Bombay three times four times any number of times
times any number of times but on the same date the date must be
but on the same date the date must be same okay because for this combination
same okay because for this combination the date must be same if this
the date must be same if this combination is same then this value must
combination is same then this value must be same so this is the idea I hope you
be same so this is the idea I hope you understood so option b that is also gone
understood so option b that is also gone okay now what about option C A student
okay now what about option C A student must apply for all colleges on the same
must apply for all colleges on the same date a student must apply for all
date a student must apply for all colleges on the same date that is also
colleges on the same date that is also not correct for ISC Bangalore you can
not correct for ISC Bangalore you can apply on 10th April for it Bombay you
apply on 10th April for it Bombay you can apply on 4th April yes or no so this
can apply on 4th April yes or no so this is the idea is this
is the idea is this clear okay now let me tell you actually
clear okay now let me tell you actually normally it happens that ISC forms will
normally it happens that ISC forms will come before it Bombay forms okay so
come before it Bombay forms okay so application form of ISC Bangalore that
application form of ISC Bangalore that will come before your gate result okay
will come before your gate result okay so before your gate result remember when
so before your gate result remember when your gate result will come before that I
your gate result will come before that I application forms will be out okay so
application forms will be out okay so anyway now let's move
anyway now let's move on let's see this tell me the answer for
on let's see this tell me the answer for this
question tell me the answer for this question consider relation a b CDE e
question consider relation a b CDE e with functional dependencies these are
with functional dependencies these are the functional dependencies that are
the functional dependencies that are given to you suppose that there are
given to you suppose that there are atmost three different values for a b
atmost three different values for a b and d there are atmost three different
and d there are atmost three different values for a b d what is the maximum
values for a b d what is the maximum number of different values for E okay
number of different values for E okay the question is saying maximum three
the question is saying maximum three different values you have for a maximum
different values you have for a maximum three different values for B maximum
three different values for B maximum three different values for D now the
three different values for D now the question is asking maximum how many
question is asking maximum how many different values e can have is this
different values e can have is this clear did you understand the question
clear did you understand the question that a can have maximum three different
that a can have maximum three different values B can have maximum three
values B can have maximum three different
different values and D can have maximum three
values and D can have maximum three different values now the question is
different values now the question is asking that how many Ma maximum
asking that how many Ma maximum different values e can have so let's see
different values e can have so let's see this these functional dependencies are
this these functional dependencies are already given to you okay so first you
already given to you okay so first you check for C how many maximum different
check for C how many maximum different values C can have tell me see very
values C can have tell me see very simple point this relation is given to
simple point this relation is given to you A B CDE e okay and this functional
you A B CDE e okay and this functional dependency is given to you a determining
dependency is given to you a determining C first you tell me how many maximum how
C first you tell me how many maximum how many different values C can have now
many different values C can have now this is my question maximum how many
this is my question maximum how many different values C can
different values C can have maximum how many different
have maximum how many different values C can have this attribute C can
values C can have this attribute C can have tell
have tell me maximum how many different values C
me maximum how many different values C can have tell me see very simple Point
can have tell me see very simple Point very simple point that notice this this
very simple point that notice this this functional dependency is given to you
functional dependency is given to you okay this functional dependenc is given
okay this functional dependenc is given to you this a b c this functional
to you this a b c this functional dependenc is given to you so what you
dependenc is given to you so what you can do
can do for different combinations you can you
for different combinations you can you can put different values yes or no I
can put different values yes or no I want maximum number of values for C what
want maximum number of values for C what I want please understand I want maximum
I want please understand I want maximum different values for C I want different
different values for C I want different different values for C remember what I
different values for C remember what I want I want different different values
want I want different different values for C okay now you tell me one thing
for C okay now you tell me one thing this functional dependency is given to
this functional dependency is given to you if I give if I give you two
you if I give if I give you two different
different combinations I am giving you two
combinations I am giving you two different combinations is it mandatory C
different combinations is it mandatory C must must be different is it mandatory C
must must be different is it mandatory C must be different please tell me is it
must be different please tell me is it mandatory C must be different C okay it
mandatory C must be different C okay it is not mandatory C may or may not be
is not mandatory C may or may not be different yes or no for different
different yes or no for different combinations for different combinations
combinations for different combinations this C can be same or this C can be
this C can be same or this C can be different okay these are different
different okay these are different combinations so this C can be same or
combinations so this C can be same or different yes or no this C can be same
different yes or no this C can be same or different but what I want see this C
or different but what I want see this C can be same or different but what I want
can be same or different but what I want tell me but what I want I want maximum
tell me but what I want I want maximum different values so what I will do I
different values so what I will do I want maximum different values okay
want maximum different values okay remember what I want I want maximum
remember what I want I want maximum different values for
different values for C okay so this is what I
C okay so this is what I want I want maximum different values
want I want maximum different values this is the important part so what I
this is the important part so what I will do I will make sure that c has
will do I will make sure that c has different values so for every
different values so for every combination I will put a different value
combination I will put a different value okay for this combination different
okay for this combination different value for this combination different
value for this combination different different value okay for this
different value okay for this combination for this combination
combination for this combination different value is this clear for every
different value is this clear for every different combination I will put a
different combination I will put a different value for this combination
different value for this combination different value and so on so tell me how
different value and so on so tell me how many different combinations of a comma B
many different combinations of a comma B are there okay and so on you can see and
are there okay and so on you can see and so on okay you can easily see how many
so on okay you can easily see how many different combinations for a comma B
different combinations for a comma B please tell me like this you can create
please tell me like this you can create combinations for a comma B A2 B2 A2 B3
combinations for a comma B A2 B2 A2 B3 then A3 B1 and so on right yes or no is
then A3 B1 and so on right yes or no is this clear so tell me how many different
this clear so tell me how many different combinations are there for ab this AB
combinations are there for ab this AB this has three into three different
this has three into three different combinations these many different
combinations these many different combinations are
combinations are possible clear yes or no that means nine
possible clear yes or no that means nine nine different combinations are possible
nine different combinations are possible because a has three values B has three
because a has three values B has three values this is already given to you in
values this is already given to you in the question that a has three different
the question that a has three different values maximum three different Valu
values maximum three different Valu values for a maximum three different
values for a maximum three different values for B so they have three
values for B so they have three different different values now I can
different different values now I can simply say so they have total nine
simply say so they have total nine different combinations yes or no total
different combinations yes or no total nine different combinations are there
nine different combinations are there for ABC ab so total for C how many
for ABC ab so total for C how many different values possible nine yes or no
different values possible nine yes or no so I can say maximum nine different
so I can say maximum nine different values
values possible nine different values
possible nine different values possible values possible for C
possible values possible for C okay for this C maximum nine different
okay for this C maximum nine different values are possible now the question is
values are possible now the question is asking for D now the question is asking
asking for D now the question is asking for D and remember this CD determines e
for D and remember this CD determines e uh CD determines e and the question is
uh CD determines e and the question is asking for E okay the question the
asking for E okay the question the question you can see the question is
question you can see the question is asking for
asking for E so tell
E so tell me what will the answer now you can
me what will the answer now you can easily see this CD determines e this
easily see this CD determines e this combination determines e
combination determines e now you can see this has nine different
now you can see this has nine different values yes or no this has nine different
values yes or no this has nine different values this has three different values
values this has three different values so how many different combinations are
so how many different combinations are possible so tell me how many different
possible so tell me how many different combinations are possible for CD how
combinations are possible for CD how many CD combinations are possible please
many CD combinations are possible please tell me so you can see 9 into 3 that
tell me so you can see 9 into 3 that will be 21 okay 9 into 3 that will be
will be 21 okay 9 into 3 that will be sorry that will be 27 27 different
sorry that will be 27 27 different combinations are possible yes or no
combinations are possible yes or no different CD combinations
different CD combinations possible CD combinations possible these
possible CD combinations possible these many different CD combinations are
many different CD combinations are possible so tell me how many e combin
possible so tell me how many e combin how many e values are possible how many
how many e values are possible how many e values are possible for every
e values are possible for every combination you give a different value
combination you give a different value for every combination you give a
for every combination you give a different value E1 E2 and so on okay for
different value E1 E2 and so on okay for every combination what you will do you
every combination what you will do you will give a different value so very
will give a different value so very simple so finally here answer will be
simple so finally here answer will be maximum 27 different values
possible okay so this is your answer so for this question the answer will be
for this question the answer will be 27 is this understood so this is another
27 is this understood so this is another very simple question but I hope you
very simple question but I hope you understood the concept of functional
understood the concept of functional dependency is this clear the concept of
dependency is this clear the concept of functional dependency is this clear
functional dependency is this clear please tell me everything that we have
please tell me everything that we have seen so far is that clear every concept
seen so far is that clear every concept did you understand what is functional
did you understand what is functional dependency what is Trivial functional
dependency what is Trivial functional dependency non-trivial functional
dependency non-trivial functional dependency functional dependency is
dependency functional dependency is defined for the schema functional
defined for the schema functional dependency is not defined on the
dependency is not defined on the instance okay remember if you say that
instance okay remember if you say that functional dependency is Satisfied by
functional dependency is Satisfied by the schema then it means all the
the schema then it means all the instances will satisfy functional
instances will satisfy functional dependency okay remember function
dependency okay remember function dependency or any Integrity constant
dependency or any Integrity constant they are defined on the
they are defined on the schema okay so very simple all the
schema okay so very simple all the concepts we have seen in the next
concepts we have seen in the next lecture we will study rules for
lecture we will study rules for functional
functional dependencies so this topic we will study
dependencies so this topic we will study in the next lecture okay thank you
in the next lecture okay thank you everyone
Click on any text or timestamp to jump to that moment in the video
Share:
Most transcripts ready in under 5 seconds
One-Click Copy125+ LanguagesSearch ContentJump to Timestamps
Paste YouTube URL
Enter any YouTube video link to get the full transcript
Transcript Extraction Form
Most transcripts ready in under 5 seconds
Get Our Chrome Extension
Get transcripts instantly without leaving YouTube. Install our Chrome extension for one-click access to any video's transcript directly on the watch page.
Chrome Extension