(VU-Study-Corner) CS502

Assalam o Alaikum

aaj mera CS502 ka paper tha....top class hooa hai Allah k fazal se...

question yeh thay
10 marks: What is generic approach for computing MST
10 marks: write the pseudo code algorithm for implementing knapsack using stack
5 marks: you are given a task of laying railway tracks in Pakistan. You want that there should be minimum distance between any two cities. Which algorithm would you apply for this. 4 options were given Prim, Floyd-Warshall, Bellman-Ford and Dijkstra? I wrote that I will chose Floyd-Warshall and I also gave solid arguments for this.
3 marks: What is the running time of Floyd-Warshall algorithm
1 mark: When we have objects in such a way that there is some interconnection or relationship among objects then what is the best way to model such situations. GRAPHS
2 marks: What is DFS
3 marks: When is a graph strongly connected graph
5 marks: Prove the following lemma
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].


aur sab se ahm baat....aaj k paper mein aik MCQ tha...jis k charon options aik jaisay hi diay hooay thay


have a nice day
take care
Allah Hafiz

--
You received this message because you are subscribed to the Google Groups "VU Study Corner" group.
To post to this group, send email to VU-Study-Corner@googlegroups.com.
To unsubscribe from this group, send email to VU-Study-Corner+unsubscribe@googlegroups.com.
For more options, visit this group at http://groups.google.com/group/VU-Study-Corner?hl=en.