We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
Please Share Your Current Final Paper
+ 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)
koi to share kr day??
40 mcqs 10 qs.
Mcqs were from handouts and conceptual
5 question of 3 marks
5 questions of 5 marks
-from 4 algorithms dijkstra, prim, bell-ford and floyd warshall, which one is best according to given scenario where you have to find shortest path in low cost.
-what is component digraph
-shortest path algorithm
-write psuedo code for shortest path
-write pseudo code
-what is minimum spanning tree. Give one example.
-algorithm diagram was given, you have to show the final tree
-algorithm diagram was given, show the final result
My today CS502 paper
All MCQs were new frm handouts...(1 or 2 frm Moaaz files)
Subjective was easy. still no question from past papers
all questions were new
Just read handouts properly
best of luck