(A) x≥3/2,y≥0
(B) x>3/2,y<=0
(C) x≥3/2,y≤0
(D) x≤3/2,y≤0
Ans:-D
Explanation:-
Since i am not such a mathematical person, i am just giving you the link from where you can get the explanation for this answer. The same problem along with how to arrive at the answer is given in purple math. The link is,
http://www.purplemath.com/modules/fcns2.htm
5. Maximum number of edges in a n- Node undirected graph without self loop is
(A) n2
(B) n(n-1)
(C) n(n + 1)
(D) n(n-1)/2
Ans:-D
Explanation:-
Theorem.
In an undirected simple graph with N vertices without loops, there are at most N(N-1)/2 edges.
This can be proved by induction.
This can also be verified by drawing some simple graphs of 2,3, 4 and 5 vertices. But No multiple edges. So the answer is option D.
No comments:
Post a Comment