We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
CS502 All current final term paper Fall 2015 at one place from 5th March to 16th March 2015.
You Can Download Solved Mid Term Papers, Short Notes, Lecture Wise Questions Answers Files, Solved MCQs, Solved Quizzes , Solved Mid Term Subjective Papers , Solved Mid Term Objective Papers From This Discussion For Preparation Mid Term Papers of Fall 2014
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
You Can download papers by a simple click on file. All the uploaded filed are in Zip file or PDF format So Install Adobe Reader and Winrar Software’s to open these Files
Note: If you download files with Internet Download Manager (IDM), you would face problem of damage files. All files are correct and no damage file, If you face this problem, Open IDM > Click on Options > Click on File Types > Remove PDF and ZIP from files types and save. After it download again files, files will work properly.OR Press alt+click the file ...
Thanks and Regards,
VU Students.ning Social Network.
+ 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)
Today 12 march 2015
only 5,6 mcqs were from moazz file so please prepare notebook too algorithms topic and complexity topic are important
mostly subjective from moazz file
Suppose you could prove that an NP-complete problem cannot be solved in polynomial time. What would be the consequence (5 marks)
Make adjacency list of given graph (marks 5)
What is the cost of the following graph? (marks 5)
aik line ka jwab tha which is cost =33 :p lol 5 marks easily
If you have to lay a train track between n cities. is kisam ka q tha (marks 5)
Define back Edge (2 marks)
working of Prim's Algorithm (2 marks)
bits wala q tha sirf bits ki value btani thi (2 marks)
minimizing spanning tree (3 marks)
MST problem in prism algorithm (3 makrs)
money counting k liye psuedo code likhna tha (3marks)
best of luck everyone :)
shukr hai kisi ne to march 2015 wala paper post kia
thank u Rizwan Tariq BSIT
TO day 13 march 2015 my paper of cs502
Q: Suppose you could prove that an NP-complete problem cannot 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
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.
Q: What is the cost of the following graph? (marks 5)
the cost off the graph is 33.
Q: How Dijkstra‟s algorithm works? (3 marks)
Dijkstra’s algorithm is a simple greedy algorithm for computing the single-source shortest-paths to all
other vertices. Dijkstra’s algorithm works on a weighted directed graph G = (V, E) in which all edge
weights are non-negative, i.e., w(u, v) _ 0 for each edge (u, v) 2 E.
Negative edges weights maybe counter to intuition but this can occur in real life problems. However, we
will not allow negative cycles because then there is no shortest path. If there is a negative cycle between,
say, s and t, then we can always find a shorter path by going around the cycle one more time.
Q: Polynomial time algorithm (2 marks)
A polynomial time algorithm is any algorithm that runs in O(n
A problem is solvable in polynomial time if there is a polynomial time algorithm for it.
Q:How to propagate shortest path in Bell men Ford theorem? (3 marks)
The shortest path information is propagated sequentially along each shortest path in the graph.
Q: Consider the following (3 marks)
Can an adjacency matrix for a directed graph ever not be square in shape? Why or why not?
0 1 2 3
1 2 4 0
2 0 0 2
3 4 0 2
No. since we want to describe the relationship between each node and each other node, we need precisely
n^2 matrix entries.
baki question graphs ka thy wo main bhul gai
best of luck to all of u ?
pray for me
Jazakallah Khair, umeed hai saab pass hojayeen specially is subject mai. Is ki assignments .. exams sai zyada khatarnaak theen.