Question 5423 – UGC NET CS 2011 Dec-Paper-2

Question 10750 – Programming

Question 5423 – UGC NET CS 2011 Dec-Paper-2

Question 10750 – Programming

Question 5421 – UGC NET CS 2011 Dec-Paper-2

Maximum number of edges in a n-Node undirected graph without self loop is

Correct Answer: D

Question 5 Explanation:

The set of vertices has size n, the number of such subsets is given by the binomial coefficient C(n,2)⋅C(n,2) = n(n-1)/2

A

n²

B

n(n-1)

C

n(n+1)

D

n(n-1)/2

0 0 votes

Article Rating

Subscribe

0 Comments

Inline Feedbacks

View all comments

0

Would love your thoughts, please comment.x

()

error: Alert: Content selection is disabled!!