FINALTERM EXAMINATION
Spring 2010
CS502- Fundamentals of Algorithms (Session - 4)
Time: 90 min
Marks: 58
Question No: 1 ( Marks: 1 ) - Please choose one
An optimization problem is one in which you want to find,
► Not a solution
► An algorithm
► Good solution
► The best solution
Question No: 2 ( Marks: 1 ) - Please choose one
Although it requires more complicated data structures, Prim's algorithm for a minimum spanning tree is better than Kruskal's when the graph has a large number of vertices.
► True
► False
Question No: 3 ( Marks: 1 ) - Please choose one
If a problem is in NP, it must also be in P.
► True
► False
► unknown
Question No: 4 ( Marks: 1 ) - Please choose one
What is generally true of Adjacency List and Adjacency Matrix representations of graphs?
► Lists require less space than matrices but take longer to find the weight of an edge (v1,v2)
► Lists require less space than matrices and they are faster to find the weight of an edge (v1,v2)
► Lists require more space than matrices and they take longer to find the weight of an edge (v1,v2)
► Lists require more space than matrices but are faster to find the weight of an edge (v1,v2)
Question No: 5 ( Marks: 1 ) - Please choose one
If a graph has v vertices and e edges then to obtain a spanning tree we have to delete
► v edges.
► v – e + 5 edges
► v + e edges.
► None of these
Question No: 6 ( Marks: 1 ) - Please choose one
Maximum number of vertices in a Directed Graph may be |V2|
► True
► False
Question No: 7 ( Marks: 1 ) - Please choose one
The Huffman algorithm finds a (n) _____________ solution.
► Optimal
► Non-optimal
► Exponential
► Polynomial
Question No: 8 ( Marks: 1 ) - Please choose one
The Huffman algorithm finds an exponential solution
► True
► False
Question No: 9 ( Marks: 1 ) - Please choose one
The Huffman algorithm finds a polynomial solution
► True
► False
Question No: 10 ( Marks: 1 ) - Please choose one
The greedy part of the Huffman encoding algorithm is to first find two nodes with larger frequency.
► True
► False
Question No: 11 ( Marks: 1 ) - Please choose one
The codeword assigned to characters by the Huffman algorithm have the property that no codeword is the postfix of any other.
► True
► False
Question No: 12 ( Marks: 1 ) - Please choose one
Huffman algorithm uses a greedy approach to generate a postfix code T that minimizes the expected length B (T) of the encoded string.
► True
► False
Question No: 13 ( Marks: 1 ) - Please choose one
Shortest path problems can be solved efficiently by modeling the road map as a graph.
► True
► False
Question No: 14 ( Marks: 1 ) - Please choose one
Dijkestra’s single source shortest path algorithm works if all edges weights are non-negative and there are negative cost cycles.
► True
► False
Question No: 15 ( Marks: 1 ) - Please choose one
Bellman-Ford allows negative weights edges and negative cost cycles.
► True
► False
Question No: 16 ( Marks: 1 ) - Please choose one
The term “coloring” came form the original application which was in architectural design.
► True
► False
Question No: 17 ( Marks: 1 ) - Please choose one
In the clique cover problem, for two vertices to be in the same group, they must be adjacent to each other.
► True
► False
Question No: 18 ( Marks: 1 ) - Please choose one
Dijkstra’s algorithm is operates by maintaining a subset of vertices
► True
► False
Question No: 19 ( Marks: 1 ) - Please choose one
The difference between Prim’s algorithm and Dijkstra’s algorithm is that Dijkstra’s algorithm uses a different key.
► True
► False
