ans 1 . option b a complete graph with even vertices is bi partite as we can partition them into 2 sets such that no two vertices in the same set have an edge between them 2. ans 2 answer floor 19*19/4 = 90 so ans is 90 lovely video also questions added at last is a good idea to test whether we understand the concept or not .thanks keep uploading keep motivating , also could you please kindly upload a video regarding gate2019 correct answers thanks
Respected sir,i learned a lot from you..i have to give gate 2019 but unfortunately i missed my gate exam.i am from Srinagar Kashmir,due to bad weather,the only road which connects Kashmir to rest of india was blocked due to which i didn't reach on time in the exam hall.. Now i want to give gate exam in 2020,plz sir made more nd more video sothat we may score more
Sir please start series on optimization and LPP as it is there in the syllabus of NTA UGC NET. I hope many people will be advantageous in that case. U are doing great job. Thank u so much. 😊
Sir thank you for the wonderful explanation, it's my humble request to make videos on Graphs topic from Data Structures separately and also on Graphs of Algorithms separately
@@priyankakalra8584 I might be late to reply...but the rule of bipartite is the number of vertices need to be divided equally,ie vertex set which is even is made into 2 sets, it's ALWAYS Bipartite, not in the case of odd , tho
Q1) B) A cyclic graph with even vertices is always bipartrate. As it can always be partitioned into two sets of vertices having edges only to each other. Q2) A) 90 E(max) = ⌊n² / 4⌋ Number of maximum edges = ⌊19² / 4 ⌋ = ⌊361 / 4⌋ = 90
sir in bipartite graph we are taking two set of vertices say V1 and V2 then V1 or V2 which contains vertices but not adjacent to its own set vertices but other set vertices then can we say that the V1 and V2 are the null graphs????????
why is it that i watch your videos and feel like why i did not visit this channel before? I mean when i watch other channels, i understand very less but opposite happens here.
Let's get An example. See of you have 2 set of vertices. In va set you have 2 vertex And in set 2 you have 2 vertex. you have to connect those 2 set in bipartite graph. And now you can see 1 number of vertex is connected with other 2 vertex (set 2). Now you have check the cycle graph. That is why option B is correct. If you understand thank you. If you don't understand i am sorry.
2^32 mod 5 =(2^10 × 2^10 × 2^10 × 2^2) mod 5. As we calculate : (2^10) mod 5 = 4. So, we can write :( 4 × 4 × 4 × 4) mod 5 = 256 mod 5 = 1. Thus, Answer is 1.
Q1 = B option
Q2 = n2/4 19^2/4 90.25 we have to take floor value so 90 (A)
ans 1 . option b a complete graph with even vertices is bi partite as we can partition them into 2 sets such that no two vertices in the same set have an edge between them
2. ans 2 answer floor 19*19/4 = 90 so ans is 90
lovely video also questions added at last is a good idea to test whether we understand the concept or not .thanks keep uploading keep motivating , also could you please kindly upload a video regarding gate2019 correct answers thanks
How many edges will be there in set v1 and v2 in question1 for option b
@@aryan2228 since its a cyclic graph both the set will have equal number of vertices
2nd one wrong formulae right answer haha
@@novaegionformula bhi right hai or answer bhi chutiye
Time stamps
1:14 Null graph
2:27 cyclic graph
4:16 Bipartite graph
That last note about degree depending on other vertex set vertices was awesome
youtube have few teachers only on which we learners can trust .sir you are one of them .thankxx a lot sir for evrything
Simply awesome...itni clarity k sath smjhate hain sir😊
The way you make the topic easier and clear, that is awesome 👌Sir
Respected sir,i learned a lot from you..i have to give gate 2019 but unfortunately i missed my gate exam.i am from Srinagar Kashmir,due to bad weather,the only road which connects Kashmir to rest of india was blocked due to which i didn't reach on time in the exam hall.. Now i want to give gate exam in 2020,plz sir made more nd more video sothat we may score more
Sir please start series on optimization and LPP as it is there in the syllabus of NTA UGC NET. I hope many people will be advantageous in that case. U are doing great job. Thank u so much. 😊
Sir thank you for the wonderful explanation, it's my humble request to make videos on Graphs topic from Data Structures separately and also on Graphs of Algorithms separately
That's good that you have added questions in the end
to test our understanding ability
I am addicted to your videos.❤️
Could you please upload more videos regarding spanning trees ,binary trees and methods to find minimal spanning trees.
Sir ap kmal k teacher h boht acha smjhaty h
Finally i understand the Bigraph from your video.....After too much struggle .
Kudos Sir, you are doing great job. I have learnt alot from you, God bless you :)
which of the following is true ? ans - a cyclic graph with even vertices is always bipartite.
12:52 a) 90
answer should be 90 for maximum number of edges for a bipartitie graph with 19 vertices
Yup
my reason behind passing in gtu is this channel
Q-(1).
(A) - False.
(B) - True.
(C) - True. ( becoz of self loop)
(D) - False.
Q-(2).
Ans - 90.
1st method : by formula - lower value of N^2/4.
2nd method :
1st case : 9 × 9 = 81.
2nd case : 9 × 1 = 9.
Total : 81 + 9 = 90 Edges.
No, Q1)C) False.
There's no self loop in a null graph.
can you please elaborate q1. i am not getting how option b is true
@@priyankakalra8584 I might be late to reply...but the rule of bipartite is the number of vertices need to be divided equally,ie vertex set which is even is made into 2 sets, it's ALWAYS Bipartite, not in the case of odd , tho
Thank you very much. You are a genius. 👍👍🔝🔝👌👌🙏🙏
Apki videos amazing h.. 💯🙌
❤❤❤
Q1) B) A cyclic graph with even vertices is always bipartrate.
As it can always be partitioned into two sets of vertices having edges only to each other.
Q2) A) 90
E(max) = ⌊n² / 4⌋
Number of maximum edges = ⌊19² / 4 ⌋ = ⌊361 / 4⌋ = 90
What is difference between bipartite and complete bipartite?
If one vertex is not used in both sets then it will be considered bipartite but not in complete bipartite
Now i come to know that this is bipartite graph after too much struggle 👍👍
For some people its complete graph😄
@@GateSmashers i mean bipartite portion only😂👍
sir in bipartite graph we are taking two set of vertices say V1 and V2 then V1 or V2 which contains vertices but not adjacent to its own set vertices but other set vertices then can we say that the V1 and V2 are the null graphs????????
Sir you are a legendary
Very nice explaination sir thank you so much
Sir u r the best
thx sir....blessed to hv ur lectures...plz cover ugc net cs syllabus..
1-b
2-a
why is it that i watch your videos and feel like why i did not visit this channel before? I mean when i watch other channels, i understand very less but opposite happens here.
Sir G null graph aur Empty graph do alag concepts hai...aapne empty graph ki definition null graph ko di
Do you have a video on Quotient graph?
Sir graph ka theorem Playlist kijiye nah
1 -> option B
2-> option A
1-b and 2-a(90)
Thank You Sir for This Wonderful Explanation
Answers
1) Only B is True
2) 90
Thank you sir...
Cyclic graph will be directed or undirected
Option A. 90 edges
1)Ans B
2)Ans A = 90
1 - B
2 - A 90
Those who came only to know about bipartite graphs can skip straight to 4:20
Thank u so much sir 😊
a ) True b) false c) false d) false Q : 90 is it correct sir
First question ,option Second and second question answer is 90
thanks
90 possible edges in bipartite graph
Q1-b
Q2-a
Thanks sir g 👍
Answers
B cylic graph of even degre is bipartite
A. 90
Sir please aap ik video mathmatics discreet structure ki per unit par most important questions ki bna dijiye
Thanku sir🙏
is this playlist covered whole syllabus of GATE CS from graph theory?
No
Option A-90
Answer 1 - d
2 - a
Q1.(b), Q2. (a)
thnk u sirrrrrr
Q1)C
Q2)A
Great ❤
1: A-F,B-T, C-F,D-F 2: 90
Q1 answer option 2
Ans -2(91)
koi first question kas answer bataega with explanation jo sir ne end me pucha hai pls
what is the answer to the questions?
Thank you Sir🙏🙏🙏
Sir tell the answer please... timing 12:35
ans1= (B) true
ans2= 90
Ans2: 90
B & A..... correct option
Option (B) is true
B and 90
Q2 90
Nice
1st ans. a,c,d is incorrect and opsition b is correct in some condition but not always
2nd ans. 90
Question answer???plzz
Sir start karo Cyber security chapter na video
Last minute pdhai apke channel se
Sir ap next video mein ans telly kra dya kre
option B
Can anyone please explain me why the option b is correct in question 1 ?
Let's get An example.
See of you have 2 set of vertices.
In va set you have 2 vertex
And in set 2 you have 2 vertex. you have to connect those 2 set in bipartite graph. And now you can see 1 number of vertex is connected with other 2 vertex (set 2). Now you have check the cycle graph. That is why option B is correct.
If you understand thank you.
If you don't understand i am sorry.
can null graph be called 0-regular graph?
Sir ky aap online classes leti hai agr nhe leti please meri online class li jie please🙏 mai maths mai bht week ho please🙏
1B
2A
defination of bipartitie:inplace of" to "there should be" TWO"
Middle finger mam and f u
Sir , how do we solve such questions : Q) 2^32 mod 5
its 4
@@SHASHANKRUSTAGII please elaborate.
2^32 mod 5 =(2^10 × 2^10 × 2^10 × 2^2) mod 5.
As we calculate : (2^10) mod 5 = 4.
So, we can write :( 4 × 4 × 4 × 4) mod 5 = 256 mod 5 = 1.
Thus, Answer is 1.
@@hmsongs44 Thanks
@@GATE-xd9iq welcome
1----A and B are true
C and D false
2----90 will be correct answer
Sir please make a video on line and chordal graphs 😢
In the second question answer will be 180
Self referential note:
Walk : Vertex✓, Edge ✓
Trail : Vertex✓, Edge × ; Closed Trail aka Circuit
Path : Vertex × (Except 1st and last Vertex) ; Closed Path aka Cycle
Q1. Option C is correct (verified from geeksforgeeks)
Q2. Option D is correct
Very dedicated
Option d or a
sir plz make videos on algo and computer organization
anyone please tell answer of 1st ques. m not getting it
B,90 ANS.
91 is the answer
Answers??
que 2
Ans A
Sir the both answer is A
Please reply me
Ques2 ans. 90