M

Mr. Dubey • 65.25K Points
Coach 

Q. Consider the graph shown below. Which of the following are the edges in the MST of the given graph?

(A) (a-c)(c-d)(d-b)(d-b)
(B) (c-a)(a-d)(d-b)(d-e)
(C) (a-d)(d-c)(d-b)(d-e)
(D) (c-a)(a-d)(d-c)(d-b)(d-e)
Share
Explanation by: Mr. Dubey 
 the minimum spanning tree of the given graph is shown below. it has cost 56.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. How does the bias-variance decomposition of a ridge regression estimator compare with that of ordinary least squares regression?

Q. The must design and program the overlay structure.

Q. E.F.Codd developed the normalization process in the which early:

Q. ___________ is the collection of memory structures and Oracle background processes that operates against an Oracle database.

Q. Suppose we fit “Lasso Regression” to a data set, which has 100 features (X1,X2…X100). Now, we rescale one of these feature by mult

Q. ,"D") print(a)

Q. Which of the following file organization is most efficient for a file with a high degree of file activity?

Q. The internal representation of a file is given by ……..

Q. Which is the best definition of an interaction mode?

Q. Software does not-----------

Question analytics