We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
+ Link For Assignments, GDBs & Online Quizzes Solution |
+ Link For Past Papers, Solved MCQs, Short Notes & More |
Dear Students! Share your Assignments / GDBs / Quizzes files as you receive in your LMS, So it can be discussed/solved timely. Add Discussion
How to Add New Discussion in Study Group ? Step By Step Guide Click Here.
All Current Final Term Papers Spring 2013
From 20 Jul , 2013 to 31 Jul 2013 Spring 2013
PLZ Share Ur Papers Files Also where u Study
Tags:
+ How to Follow the New Added Discussions at Your Mail Address?
+ How to Join Subject Study Groups & Get Helping Material? + How to become Top Reputation, Angels, Intellectual, Featured Members & Moderators? + VU Students Reserves The Right to Delete Your Profile, If?.
+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)
+ Click Here to Search (Looking For something at vustudents.ning.com?) + Click Here To Join (Our facebook study Group)nice, group
1 .how topological sort work? explain
2. the graph of kruskal's algorithm
3. question about railyway track from lahore to islamabad which method gud for less track
4. quick sort
5. floyd marshall alogirthm
6. minimum spanning trees problems
7. floyd marshall running time and space used
8. free tree
9. what are total number of entries in metrix for edit distance
few mcqs from mooaz file
ahsan thanks & best of luck for ur result
Attention Related Final Term papers Spring 2013: All Fellows You don’t need to go any other site for current Final Term papers Spring 2013, Because All discussed data/sharing of our members in this discussion are going from here to other sites. You can judge this at other sites yourself. So don’t waste your precious time with different links.
Today my paper cs 502
Total Q 52
MCQ 40
4Q 2 marks
4Q 3marks
4Q 5 marks
Few mcq from moaaz
Ans yes or no and briefly explain.
Give an example of reduction ? 3 (5)
Enjoy kro bacho.
parsa adil thanks for sharing ..keep it up
Attention Related Final Term papers Spring 2013: All Fellows You don’t need to go at any other site for current Final Term papers Spring 2013, Because All discussed data/sharing of our members in this discussion are going from here to other sites. You can judge this at other sites yourself. So don’t waste your precious time with different links.
please any body tell me is peper mian true false bhe atay hian ya neh
MY TODAY PAPER CS502-FUNDAMENTALS OF ALGORITHMS
Total Questions: 52
Total Marks: 80
Total MCQs: 40 (Each of 1 Mark)
Total Short Questions: 4 (Each of 2 Mark)
Total Short Questions: 4 (Each of 3 Mark)
Total Long Questions: 4 (Each of 5 Mark)
SOME QUESTIONS DON’T REMEMBER
ANS: There is no relationship between no. of edges and cycles (Page 131)
ANS: 1. don’t go through vertex k at all.
2 .Do go through vertex k (Page 162)
3 Consider the case of 3 matrices: A1 is 5 × 4, A2 is 4 × 6 and A3 is 6 × 2 The multiplication can be carried out as ((A1A2)A3) The cost of is? (2 MARKS)
ANS: ((A1A2)A3) = (5 · 4 · 6) + (5 · 6 · 2)= 180 (Page 84)
4.. What the time is dominated by sorting if the graph is sparse? (2 MARKS)
ANS: Θ(E log E) = Θ(E log V ) (Page 149)
5.. Consider a digraph G = (V, E) and any DFS forest for G. G has a cycle if and only if the DFS forest has a back edge? (3 MARKS)
ANS: Proof: If there is a back edge (u, v) then v is an ancestor of u and by following tree edge from v to u, we get a cycle (Page 131)
6.. Variants of shortest path solution briefly? (3 MARKS)
ANS: There are a few variants of the shortest path problem.
Single-source shortest-path problem: Find shortest paths from a given (single) source vertex s 2 V to every other vertex v 2 V in the graph G.
Single-destination shortest-paths problem: Find a shortest path to a given destination vertex t from each vertex v. We can reduce the this problem to a single-source problem by reversing the direction of each edge in the graph.
Single-pair shortest-path problem: Find a shortest path from u to v for given vertices u and v. If we solve the single-source problem with source vertex u, we solve this problem also. No algorithms for this problem are known to run asymptotically faster than the best single-source algorithms in the worst case.
All-pairs shortest-paths problem: Find a shortest path from u to v for every pair of vertices u and v. Although this problem can be solved by running a single-source algorithm once from each vertex, it can usually be solved faster.
7.. Express the Harmonic series in summation form and also with capital theta notation? (3 MARKS)
ANS:
8.. What do you mean by polynomial time algorithm? Explain what kind of problems can be solved by using polynomial time algorithm? (3 MARKS)
ANS: A polynomial time algorithm is any algorithm that runs in time.
A problem is solvable in polynomial time if there is a polynomial time algorithm for it. (Page 131)
9.. What is the cost of the following graph? (5 MARKS)
ANS: Cost =33 (Page 142)
REMEMBER ME IN YOUR PRAYERS
Rameez Tariq thanks for sharing ur paper..keep it up
Attention Related Final Term papers Spring 2013: All Fellows You don’t need to go at any other site for current Final Term papers Spring 2013, Because All discussed data/sharing of our members in this discussion are going from here to other sites. You can judge this at other sites yourself. So don’t waste your precious time with different links.
THANKS G
thanks to all of you
© 2020 Created by + M.Tariq Malik. Powered by
Promote Us | Report an Issue | Privacy Policy | Terms of Service
VU Students reserves the right to delete profile, which does not show any Activity at site nor has not activity more than 01 month.
We are user-generated contents site. All product, videos, pictures & others contents on vustudents.ning.com don't seem to be beneath our Copyrights & belong to their respected owners & freely available on public domains. We believe in Our Policy & do according to them. If Any content is offensive in your Copyrights then please email at m.tariqmalik@gmail.com or Contact us at contact Page with copyright detail & We will happy to remove it immediately.
Management: Admins ::: Moderators
Awards Badges List | Moderators Group
All Members | Featured Members | Top Reputation Members | Angels Members | Intellectual Members | Criteria for Selection
Become a Team Member | Safety Guidelines for New | Site FAQ & Rules | Safety Matters | Online Safety | Rules For Blog Post