We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
+ Click Here To Join also Our facebook study Group...How to Join Subject Study Groups & Get Helping Material?..
.+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)
+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)
Note: (This is Featured Discussion)
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.
Or visit this link
Share Your Current Mid Term Papers (Questions/Pattern) 20 August 2016 to 02 September2016 to help each other. Thanks
Solved Mid Terms Papers By MOAAZ & Other Students
Click On the below link to download
+ M.Tariq Malik yar ap to aisay ghalat links na diya krain... hyperlink final term ka banaya hai us main papers just mid term k hain
Plz jiska bhi kal first time paper ho wo share krdae mra 3rd timepy ha...shukria..
jin students ka aj paper hua plz share kr dn....
yes plz share
My Current paper ...:)ye aye thy mjy shukria...
Mcqs kuch moaz masy thy bki huffman ka topic aur reuction wla topic last ma ha jisma N=NP or co NP wly masy mcqs zeyda aye thy..shukria
Back edge ,forward edge and cross edge
Forward edge: (u, v) where v is a proper descendent of u in the tree.
Back edge: (u, v) where v is an ancestor of u in the tree.
Cross edge: (u, v) where u and v are not ancestor or descendent of one another.
A free tree is a tree with no vertex designated as the root vertex.
Define according to Kruskal's algorithm creat_set(u) find_set(U) union(u,v) Answer: Page 147
Create-set(u): Create a set containing a single item u.
Find-set(u):Find the set that contains u
Union(u,v): merge the set containing u and set containing v into a common set.
. Where Arise Clique Cover? (pg176)
The clique cover problem arises in applications of clustering. We put an edge between two nodes
if they are similar enough to be clustered in the same group. We want to know whether it is
possible to cluster all the vertices into k groups.
suppose you could prove that an NP-complete problem can be solved in polynomial time. What would be the consequence? 5 marks
If we can solve a problem in polynomial time, we can certainly verify the solution in polynomial time.
More formally, we do not need to see a certificate to solve the problem; we can solve it in polynomial time anyway.
However, it is not known whether P = NP. It seems unreasonable to think that this should be so. Being able to verify that you have a correct solution does not help you in finding the actual solution. The belief is that
P 6= NP but no one has a proof for this.
Aik sawal tha osma Depth first search ky through loops or cycle find krna tha tabular form ma tha ? 5 marks
Topological form ka sawal tha aik? 5 marks
Aik sawal tha NP wla last ma ha reuction waly masy? 5 marks
Waqar Ahmad thanks for sharing
Attention Students: You don’t need to go any other site for current papers pattern & questions. Because all sharing data related to current Final term papers of our members 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. Just keep visiting http://vustudents.ning.com/ for all latest updates.