We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>

Looking For Something at vustudents.ning.com? Click Here to Search

Assignment No. 04
Semester: Fall 2015

CS502: Fundamentals of Algorithms


Total Marks: 20


Due Date:10/02/2016


Please read the following instructions carefully before submitting assignment:

It should be clear that your assignment will not get any credit if:

  • The assignment is submitted after due date.
  • The submitted assignment does not open or file is corrupt.
  • Solution is copied from any other source.


The objective of this assignment is to;

  • Learn the working of Kruskal’s and Prim’s algorithm to find a minimum spanning tree



Consider the following graph and apply Kruskal’s and Prim’s algorithm to find a Minimum Spanning Tree (MST) (Take vertex A as starting node for Prim’s Algorithm).















Solution Guidelines:

  1. 1.      You have to apply BOTH algorithms separately to find minimum spanning tree.
  2. 2.      In both algorithms, you are required to show first THREE steps of constructing MST and then show the FINAL MST.
  3. 3.      Calculate total cost of final MST for both algorithms.


You are required to submit your solution through LMS as MS Word documentcontaining your answer.




+ Click Here To Join also Our facebook study Group.

..How to Join Subject Study Groups & Get Helping Material?..

See Your Saved Posts Timeline

Views: 9167


+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)


Replies to This Discussion

 dono MST tree ka ans same ana chahe. ye lein correct solution.





Latest Activity

© 2019   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service