We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>


Looking For Something at vustudents.ning.com? Click Here to Search

CS502 Share Current Final Term Papers & Past Final Term Papers at One Place from 12 August 2017 to 24 August 2017

Please Share Your Current Final Paper

+ Click Here To Join also Our facebook study Group.

..How to Join Subject Study Groups & Get Helping Material?..


See Your Saved Posts Timeline

Views: 798

.

+ http://bit.ly/vucodes (Link for Assignments, GDBs & Online Quizzes Solution)

+ http://bit.ly/papersvu (Link for Past Papers, Solved MCQs, Short Notes & More)

Replies to This Discussion

koi to share kr day??

plz share....

40 mcqs 10 qs.

Mcqs were from handouts and conceptual 

5 question of 3 marks

5 questions of 5 marks

-Dijkstra algorithm

-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 

-DFS 

-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

RSS

© 2019   Created by + M.Tariq Malik.   Powered by

Promote Us  |  Report an Issue  |  Privacy Policy  |  Terms of Service