inshaAllah ........i was just joking .......app nay kaha na aik mcq k sab option aik say hi thay............
Best regards
Wasalam
-- Best regards
Wasalam
On Mon, Mar 1, 2010 at 2:18 PM, محمد عمیر <muhammad.umair.945@gmail.com> wrote:
nahin jee, aik number bahut kam hai....INSHALLAH 80+ hon gay is paper mein....On 3/1/10, mc080408680 Shazia Bano <mc080408680@vu.edu.pk> wrote:Mubarak ho bhai aik number to paka milay ga na...............top class k ilawa.....--
Best regards
Wasalam
On Mon, Mar 1, 2010 at 2:05 PM, محمد عمیر <muhammad.umair.945@gmail.com> wrote:
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
--
Please mention your Subject Code in the Subject area in ur mail.
To post ur msg to this group: attock-vu-group@googlegroups.com
To unsubscribe send ur mail at :attock-vu-group+unsubscribe@googlegroups.com
Visit Group Home Page: http://groups.google.com/group/attock-vu-group
Contact Moderator For further help. Gtown.Malik@Gmail.Com 0333-5154349
For Past Papers, Quiz and Assignments Visit:
www.MalikJe.com www.Vulhr.com Vuabid.Blogspot.com
For online Quiz Practice visit ---------> http://www.e-learnings.net
Please mention your Subject Code in the Subject area in ur mail.
To post ur msg to this group: attock-vu-group@googlegroups.com
To unsubscribe send ur mail at :attock-vu-group+unsubscribe@googlegroups.com
Visit Group Home Page: http://groups.google.com/group/attock-vu-group
Contact Moderator For further help. Gtown.Malik@Gmail.Com 0333-5154349
For Past Papers, Quiz and Assignments Visit:
www.MalikJe.com www.Vulhr.com Vuabid.Blogspot.com
For online Quiz Practice visit ---------> http://www.e-learnings.net
--
Please mention your Subject Code in the Subject area in ur mail.
To post ur msg to this group: attock-vu-group@googlegroups.com
To unsubscribe send ur mail at :attock-vu-group+unsubscribe@googlegroups.com
Visit Group Home Page: http://groups.google.com/group/attock-vu-group
Contact Moderator For further help. Gtown.Malik@Gmail.Com 0333-5154349
For Past Papers, Quiz and Assignments Visit:
www.MalikJe.com www.Vulhr.com Vuabid.Blogspot.com
For online Quiz Practice visit ---------> http://www.e-learnings.net
Please mention your Subject Code in the Subject area in ur mail.
To post ur msg to this group: attock-vu-group@googlegroups.com
To unsubscribe send ur mail at :attock-vu-group+unsubscribe@googlegroups.com
Visit Group Home Page: http://groups.google.com/group/attock-vu-group
Contact Moderator For further help. Gtown.Malik@Gmail.Com 0333-5154349
For Past Papers, Quiz and Assignments Visit:
www.MalikJe.com www.Vulhr.com Vuabid.Blogspot.com
For online Quiz Practice visit ---------> http://www.e-learnings.net
No comments:
Post a Comment