cs502 FINALTERM FALL 2010 PAPER

ibonacci sequence 2mark

Clique cover problem 2mark

Make Adjacency list from the given table 3marks

Communication design problem (MST).

Strong connected component problem

Heapify proof..... 5marks

Dijkstra Algorithmn

Define Floyd Marshall 5marks

Floyd Marshall 3marks
runtime
space used

DFS algoritmn 3marks

****************************************************************8
TOTAL 52 QUESTIONS,40 MCQS AND 12 SUBJECTIVE
(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