Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?

Yes
May be Yes or No
None

Correct Answer: No

Explanation:

No.Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn’t mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.

← Previous Question Next Question→

More Questions from Database

Which of the following products implemented the CODASYL DBTG model?
Which of the following indicates the maximum number of entities that can be involved in a relationship?
A reason for using an SQL view to hide columns is:
Which of the following occurs when a transaction rereads data it has previously read and finds modification or deletions caused by a committed transaction?
SQL Server program code that is executed instead of an SQL command that needs to be processed is called
The expression FOR XML RAW tells SQL Server to:
The "curse of dimensionality" relates to which problem of using operational data for BI reporting?
A report generated by a reporting system is delivered to the appropriate users via a user-accessed Web site. This system uses which of the following report modes?
The first step in database development is which of the following?
In enterprise data modeling, which is incorrect?

Discussion & Comments

No comments yet. Be the first to comment!

Join Discussion