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

www.bit.ly/vucodes

+ Link For Assignments, GDBs & Online Quizzes Solution

www.bit.ly/papersvu

+ 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

+ 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?


See Your Saved Posts Timeline

Views: 5728

.

+ 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)

Replies to This Discussion

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

 

  1. How the generic greedy algorithm opreats in minimum spanning tree?
  2. How Dijkstra’s algorithm operates?
  3. what is the running time of the Dijkstra algorithm?
  4. if problem A reduces (is polynomial –time reducible) to problem B and B is N-P complete then A is N-P complete.

Ans yes or no and briefly explain.

  1. what is the idea behind  in counting sort algorithm , to sort the elements  without comparisons in linear time?
  2. Consider a digraph G=V,E and any DFS forest for G  prove that G has a cycle if and only if the  DFS  forest has a back edge. (3)
  3. what is all pairs shorests paths problem also describe Floyed- warshall algoriyhm? (3)
  4. what are the application of edit distance technique . Three names? (3)
  5.  what do u mean by polynomial time algorithm .Explain  what kind of polynomial  can be solved by polynomial?(3)
  6.  show the result  of topological sort graph. ? graph dia hova tha. (5)
  7. According to Dijkstra algorithm write the pseudo code to relax a vertex./(5)
  8. why we need reduction? 2

              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

thanks for sharing, mera tuesday ko hai :/

MY TODAY PAPER CS502 (ANSWERS WITH REFERENCE)
Attachments:

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

 

  1. Is there any relationship between number of back edges and number of cycles in DFS? (2 MARKS)

ANS: There is no relationship between no. of edges and cycles   (Page 131)

 

  1. How do we compute  assuming we already have the previous matrix? (2 MARKS)

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

RSS

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

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

.