MCQS just 2 to 3 from past papers baqi
sb new thy
Subjective questions.
1:What is all-pairs shortest paths problem, also describe
Floyd-Warshall algorithm?
2:Explain the following two basic cases according to
Floyd-Warshall Algorithm,
1. Don’t go through vertex k at all.
2. Do go through vertex k
1. Don’t go through vertex k at all.
2. Do go through vertex k
3:What is path
4:Why we need reductions? Give Example?
5:pseoudo code for strong component
Comments
Post a Comment
Please give us your feedback & help us to improve this site.