Fall 2006
ASSIGNMENT 08(cs502)
(Fundamental of Algorithms)
Maximum Marks: 30
Upload Date: January 20, 2007
Due Date: January 25, 2007
INSTRUCTIONS
Dear Student read the following instructions before attempting to solve this assignment
1. In order to attempt this assignment you should have full command on first 43 Lectures
2. Try to get the concepts, consolidate your concepts and ideas from these questions which you learn in
Lecture # 38 to Lecture # 43
3. In order to solve this assignment you have strong concepts about following topics
 Bell man Ford Algorithm
 Dijkstra’s Algorithm
 Floyd Warshall Algorithm
4. You should concern recommended books for clarify your concepts as handouts are not sufficient.
5. Try to make solution by yourself and protect your work from other students. If we found the solution files
of some students are same then we will reward zero marks to all those students.
6. You are supposed to submit your assignment in Word format any other formats like scan images, PDF
format etc will not be accepted and we will give zero marks to these assignments.
7. Assignments through e-mail are not acceptable after due date (If there is any problem in submitting your
assignment through LMS, you can send your solution file through email with in due date). You are
advised to upload your assignment at least two days before Due date.
Page 1 of 3
Virtual University of Pakistan
Fall 2006
Question 1:
Marks=10
Run Bellman-Ford algorithm on the following graph to compute shortest paths from node A to all other
nodes.
Question 2:
Marks=10
Use the Dijkstra’s algorithm to compute shortest paths from source node A to all other nodes in the
following graph
Question 3:
Marks=10
Compute all-pairs shortest paths using Floyd-Warshall algorithm on the following path. Show all
intermediate iterations
Page 2 of 3
Virtual University of Pakistan
Fall 2006
Whish you best of LUCK for your Final Exams
Page 3 of 3
Virtual University of Pakistan