We have been working very hard since 2009 to facilitate in your learning Read More. We can't keep up without your support. Donate Now.

www.vustudents.ning.com

 www.bit.ly/vucodes + Link For Assignments, GDBs & Online Quizzes Solution www.bit.ly/papersvu + Link For Past Papers, Solved MCQs, Short Notes & More

# CS502- Fundamentals of Algorithms GDB Fall 2018

GDB                                                                                               Dated:Jan 30, 19

 Dear Students, Graded discussion (GDB) will be launched on 6th February, 2019 and it will remain open for two days. You can post your comments on the below mentioned topic till 7th February, 2019. Topic: Travelling Salesman Problem (TSP) is a classic algorithmic problem in the field of computer science, where a set of cities and distance between every pair of cities are given and it is required to find the shortest possible route that visits every city exactly once and returns to the starting point. In terms of optimal solution, greedy algorithms are used for solving TSPs, but it becomes more complex and takes exponential time when numbers of vertices (i.e. cities) are very large.  Being an algorithm analyst what do you think, "If TSP problem is solved by using dynamic programming approach, will it provide feasible solution better than greedy approach?  Justify your answer with very well defined and sound reasoning in either case.  A concise, coherent and to the point comment is preferred over lengthy comment having irrelevant details. Your comment must not be more than 4-5 lines. Comments, posted on regular Lesson MDB or sent through email will NOT be considered in any case.  For any queries please email at CS502@vu.edu.pk Best of Luck! Regards, CS502 Team

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

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

Views: 1658

### Replies to This Discussion

Our main purpose here discussion not just Solution

We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>

Discussed & be touched with this discussion. After discussion a perfect solution will come in a result at the end.

Note:-

For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.

For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.

&

.... How to Find Your Subject Study Group & Join ....

P.S:    Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”

## Latest Activity

Mani Siddiqui Ex posted a discussion

### convocation

41 minutes ago
1 hour ago
꧁༺~₦๏๏ℝ~༻꧂ updated their profile
2 hours ago
Muhammad Bilal liked Zoey D's discussion Ek masoomana sawal ...(¬‿¬)
10 hours ago
Mr A updated their profile
11 hours ago
12 hours ago
Sana Sunny ツ liked +M.Tariq Malik's discussion Project Report On E-Business
12 hours ago
12 hours ago

1

2

3

## HELP SUPPORT

This is a member-supported website. Your contribution is greatly appreciated!