CS502 Final Term Current Paper (Feb 2011)
Saturday, February 12, 2011 Posted In .Final Term Exam (Feb 2011) Edit This
CS502 Final Term Current Paper (Feb 2011)
My today paper of Algorithm
total 52 questions 40 MCQ's and the following are some questions which i remember
(1) give a detailed example of 2-d maxima 2
(2) what is common problem in communication networks and circuit designing? 2
(3) write suedo code of relaxing a vertex 5
(4) write suedo code of dijkstra algorithm? 5
(5) define NP completeness 5
(6) define floyed warshall algorithm in these two cases 5
do not go through a vertex k at all
do go through a vertex k
(7) Define DAG 3
and a lot of repeated objective from past papers
total 52 questions 40 MCQ's and the following are some questions which i remember
(1) give a detailed example of 2-d maxima 2
(2) what is common problem in communication networks and circuit designing? 2
(3) write suedo code of relaxing a vertex 5
(4) write suedo code of dijkstra algorithm? 5
(5) define NP completeness 5
(6) define floyed warshall algorithm in these two cases 5
do not go through a vertex k at all
do go through a vertex k
(7) Define DAG 3
and a lot of repeated objective from past papers
