CS502 VU Final Term Current Paper (Feb 2011)

No Comments
CS502 VU Final Term Current Paper (Feb 2011)

4 Questions of 5 Marks

1) Write steps of sieve techniques
2) Write Psuedo code of Dijkstra's algorithm
3) Prove the Lemma:
Consider a diagraph G = ( V,E ) and any DFS forest for G. G has a cycle if and only if the DFS forest has a back edges 
4) Answer the following
Where the cliquer cover problem is used?

What is decision problem, also explain with examples?
Next PostNewer Post Previous PostOlder Post Home

0 comments

Post a Comment