---------- Forwarded message ----------
From: Kharal Zada <mc090404549@vu.edu.pk>
Date: Wed, Feb 9, 2011 at 7:44 PM
Subject: Help cs502 plz solve these MCQs
To: vu-askari <vu_askari@googlegroups.com>, vuzs@googlegroups.com, vu-it-section <vu-it-section@googlegroups.com>
1. although it requires more complicated data structures, Prim's algorithm for a minimum spanning tree is better that Kruskal's when the graph has a large number of vertices.
From: Kharal Zada <mc090404549@vu.edu.pk>
Date: Wed, Feb 9, 2011 at 7:44 PM
Subject: Help cs502 plz solve these MCQs
To: vu-askari <vu_askari@googlegroups.com>, vuzs@googlegroups.com, vu-it-section <vu-it-section@googlegroups.com>
1. although it requires more complicated data structures, Prim's algorithm for a minimum spanning tree is better that Kruskal's when the graph has a large number of vertices.
TRUE
FALSE
2. If a graph has v vertices and e edges then t obtain a spanning tree we have to delete
v edges.
v -e + 5 edges
v + e edges
None of these
--
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best.
Please visit www.vuaskari.com, get registered for old papers, quiz, assignments and GDBs...
You received this message because you are subscribed to the Google
Groups "VU ASKARI" group.
To post to this group, send email to askarivu@googlegroups.com
For more options, visit this group at
http://groups.google.com/group/askarivu?hl=en?hl=en
Comments
Post a Comment