My today paper 3Feb Cs502
Subjective Questions
1) Give Detail Example of 2-d mazama Problem
Apply prime Algorithm on Following Graph (A graph Given in paper)
Where Clipe Problem Arise
What is Deamion Problem and give Examples
explain with Flody Algorithm ( Running time and Space used )
Read more: CS502 plz share ur current paper here - Virtual University of Pakistan http://vustudents.ning.com/group/cs502fundamentalsofalgorithms/forum/topics/cs502-plz-share-ur-current-paper-here#ixzz1m4ICYIEl
total marks 80 mcqs 40 4 questions of 2 marks 4 questions of 3 marks 4 questions of 5 marks 60% paper from graphs
Read more: CS502 plz share ur current paper here - Virtual University of Pakistan http://vustudents.ning.com/group/cs502fundamentalsofalgorithms/forum/topics/cs502-plz-share-ur-current-paper-here#ixzz1m4IIKadF
dear sir mazama problem
clipe problem
deamion prblem
are not in course of cs502 and no any topic in handouts and just last algorithm is in it but the spell of it also wrong please correct it with Floyd-Warshall Algorithm.
thanks sir and all visitors
Read more: CS502 Current Final Term Papers Fall 2011 ( 03 Feb to 16 Feb 2012 ) - Virtual University of Pakistan http://vustudents.ning.com/group/cs502fundamentalsofalgorithms/forum/topics/cs502-current-final-term-papers-fall-2011-03-feb-to-16-feb-2012#ixzz1m4IYd3Kp
What is heap and heap order? 2
How do we covert the shortest distance problem in to a single source problem? 2
How short path information propagate in graph using bell ford algorithm? 2
An arbitrary graph with G(V,E) with E = |V|- I is a tree. true or false tell briefly. 2
Express arithmetic series in summation notation and tell big theta case. 3
How Dijkstra’s algorithm work 3
Cases of Floyed Warshall algorithm 3
. Let the adjacency list representation of an undirected graph is given below. Explain what general property of the list indicates that the graph has an isolated vertex. 5
a à b à c à e
b à a à d
c à a à d à e à f
d à b à c à f
e à a à c à f
f à c à d à e
g
Prove that Topological sort is direted acyclic graph 5
Calculate time complexity of 5
1
2 2
3 3 3
…….
……….
n n n n ……. n (n times)
Psuedo code to relax a vertex for Dijkstra’s algorithm.
Read more: CS502 Current Final Term Papers Fall 2011 ( 03 Feb to 16 Feb 2012 ) - Virtual University of Pakistan http://vustudents.ning.com/group/cs502fundamentalsofalgorithms/forum/topics/cs502-current-final-term-papers-fall-2011-03-feb-to-16-feb-2012#ixzz1m4IchaTk
CS502
Current Paper (Dated: 10-02-2012)
Shared by Muhammad Ishfaq (PakPattan)
How we convert the shortest path problem into a single source problem? 2 Marks
If problem A reduces (is polynomial-time reducible) to problem B and B is NP-complete then A is NP-complete
Consider the following code:
For(j=1; j<n;j++)
For(k=1; k<15;k++)
For(l=5; l<n; l++)
{
Do_something_constant();
}
What is the order of execution for this code.
An arbitrary graph with G(V,E) with E = |V|- I is a tree. true or false tell briefly 2 marks
Analysis of the brute-force maxima algorithm
Given a digraph G = (V, E), consider any DFS forest of G and consider any edge (u, v) 2 E. If this edge is a tree, forward or cross edge, then f[u] > f[v]. If this edge is a back edge, then f[u] _ f[v] 3 marks
Where the Clique Cover Problem arises 3 marks
What is decision problem, also explain with example? 2 marks
How Dijkstra’s algorithm operates? 3
write suedo code of relaxing a vertex 5
Explain why the statement “The running time of A is at least On2 ” is meaning less 5 Marks
Show the strongly connected components of the following graph using DFS algorithm. Take node E as a starting node. [You can show final result in exam software and need not to show all intermediate steps].5 marks
Read more: CS502 Current Final Term Papers Fall 2011 ( 03 Feb to 16 Feb 2012 ) - Virtual University of Pakistan http://vustudents.ning.com/group/cs502fundamentalsofalgorithms/forum/topics/cs502-current-final-term-papers-fall-2011-03-feb-to-16-feb-2012#ixzz1m4Ifjpkg
No comments:
Post a Comment