M

Mr. Dubey • 52.30K Points
Coach 

Q. The total number of edges in a complete graph of n vertices is _________.

(A) n
(B) n/2
(C) [n(n-a)]/3
(D) [n(n-a)]/2
Correct : Option (D)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. is an embedded system which meshes the computing process with the physical world in the form of an interactive as well as intelligent system

Q. A domain is atomic if elements of the domain are considered to be units.

Q. The main contents of the routing table in datagram networks are ___________

Q. Given an input arr = {2,5,7,99,899}; key = 899; What is the level of recursion?

Q. Memory unit is one part of

Q. The addition of two decimal digits in BCD can be done through

Q. Features being classified is __________ of each other in Naïve Bayes Classifier

Q. Which of the following is NOT a category of entities?

Q. Which Design Pattern should you use when an application uses a large number of objects and the storage costs are high because of the sheer quantity of

Q. A magnitude comparator is defined as a digital comparator which has