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.

Total 52 questions

40 questions (MCQs) = mostly from past 70%

Now Subjective portion

Q41: What greedy thing to do in djikstra's algorithm (2Marks)

Q42: What is 2-dimentional maximum problem (2marks)

Q43: In strong component problem what complete refers to? (2marks)

Q44: What is the decision problem L1 in polynomial time reduction to decision in problem L2? (2Marks)

Q45: Variant shortest path problems at least three? (3Marks)

Q46:What is MST problem? (3Marks)

Q47: f(n)=logbase2n means log2n agr 8 times increase karein tau change aaye ga? (3Marks)

Q48: Aik paragraph tha jis main raiwlay kee train ka zikr that k agr train Islamabad se Lahore chale tau konsa track suitable hoga means k agr 2 track hain aik train lahore se Islamabd ja rahi hai aik track pe aur 2nd track pe wohi train islamabad se Lahore aa rahi hai means parallel track hai dono.So which algorithm is suitable for this scenario?? i.Prims algorithm? ii Dijkstra's Algorithm? ya phir Bellman Ford Algorithm?? (3Marks)

Q49 same as above question bss city changed thee aur one way track tha. Which algorithm is suitable for this scenario?? just mention name and little bit expalin why we choosed this algorithm??? (5Marks)

Q50: solve this expression by O, f(n)=n/log2n+nlog(log2n) (5marks)

Q51: pseudo code of DFS Timespace & Relax vertex ? (5marks)

Q52:aik graph given tha but uss pe DFS apply karna tha (5marks)

FINISH PRAY 4 ME PLZZZZZZZZZZZZZZZZZZZZZZZZ

+ 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: 1197

.

+ 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

Steve fox thanks for sharing ur paper & best of luck 

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. (Other sites Admins/mods Copy from here & posted at their sites with fake IDs or original name: p). you can judge this at other sites yourself. So don’t waste your precious time with different links.

But Steve fox & 

Dear Fellows,

All of you are requested, Please post Only One Discussion For Current Final Term papers Spring 2013 and everyone reply/share/discussed his/her data on that same discussion, so that all members get data & discuss easily on Current Final Term papers Spring 2013.

So please don’t post two or more discussions for one Current Final Term papers Spring 2013, hope you’ll understand and cooperate with us.

Already started link for current Final Term papers 

http://vustudents.ning.com/group/cs502fundamentalsofalgorithms/foru... 

SALAM TO ALL

MCQ'S MAXIMUM MOIZ FILE K THAY

MUST PREPARE ALLTHEOREMS

BEST OF LUCK

MUHAMMAD AHMAD thanks for info 

Thanks for sharing dear.

my today paper:

define 2-D maxima?

what is forward edge?

what is polynomial time problem?

radix sorting

lemma and its prove?

kruskal's algorithm time?

make spanning tree?

digraph with vertex and without vertex?

FM2390 thanks for sharing ur paper 

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. (Other sites Admins/mods Copy from here & posted at their sites with fake IDs or original name: p). you can judge this at other sites yourself. So don’t waste your precious time with different links.

95% MCQ's are from Moaaz's File and 70% Subjective are also.

Some Subjective are:

1 Forward and backward edges

2: Alphabetic Radix sort

3: Strong component of graph.

4: Variants of shortest path solution briefly?

5: aik pseudo code likhna tha wo bhool gia

6: Polynomial time solution for what kind of problems?

Best of Luck dear

Thanks for sharing papers

plz any one answer mera kal paper hai 7 bjy

in the above shard paper by M.Tariq Malik

Q.6Polynomial time solution for what kind of problems?

Answer:

Class P:

This is the set of all decision problems that can be solved in a polynomial time.

 

Class NP hard:

In spite of all its name ,to say that is a problem is in NP-hard does not mean that it is hard to solve.Rather,it means that if we could solve this problem in polynomial time ,then we could solve all NP problems in polynomial times. Note that for a problem to NP hard, it does not have to be in the class NP.

PLZ any one guide me which is the solution of polynomial time

Class P or Class NP-Hard

waiting reply

 

.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

  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)

RSS

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

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

.