CS502 Current Final Term Fall 2013 Shared by Malika_Manosh File 4

Assalma-0-alaikum!

I am going to share some questions of my paper

Mcqs were difficult not from past papers just 3 or 4 mcqs were from past papers

Analyze the following pseudo code for Huffman tree building algorithm. And write the body of second for loop with the proper logic: (5)

HUFMAN (N, symbol[1…N], freq[1…N]
For i = 1 to N
Do t ß Tree Node(symbol[i], freq[i])
pq.insert(t, freq[i])
for i = 1 to N - 1
?
?
?
?
?
return pq.remove

Consider the digraph labeled “0” through 4 with six directed edges (5)

0         1, 1        4, 4        0

0         2, 2        3, 3        2

Strongly connected components of digraph

Apply prim’s Algorithm (5)

What is fractional knapsack problem?(3)

Suppose you could reduce an Np-complete problem to a polynomial time problem in polynomial time what would be the sequence? (3)

Floyd warshall algorithm?

Dijisiktra Algorithm?

remember me in ur prayers best of luck and must read running time of all algorithms.