CS502 Final Term Solved MCQs by VU Malik

Q01. (Marks:01)

VU Malik

If we encode and compress text using ASCII standard each character is represented b A. Fixed length code word of 4 bits B. Variable length code word up to 4 bits

C. Fixed length code word of 8 bits

D. Variable length code word up to 8 bits

Q02. (Marks:01)

VU Malik

G power T for graph can be computed in A. Theta(VE) B. Theta(V log E) C. Theta(E log V)

D .Theta (V+E)

Q03. (Marks:01)

VU Malik

Adding any edge to free tree

A .Keep it free tree and increase the size of the tree

B. Create a unique cycle C. Not allow to add edge to free tree D. Create multiple cycles

Q04. (Marks:01)

VU Malik

Which sorting algorithn is faster : A. O(n^2) B. O(nlogn)

C. O(n+k)

D. O(n^3)

Q05. (Marks:01)

VU Malik

There are no edges in undirected graph. A . Forward B. Back C. Cross

D. Both forward and back

Q06. (Marks:01)

VU Malik

Adding any edge to a free tree creates a unique A. Vertex

B. cycle

C. Edge D. Strong component

Q07. (Marks:01)

VU Malik

Networks are complete in the sense that it is possible from any location in the network to reach any other location in the digraph.

A. True

B. False

Q08. (Marks:01)

VU Malik

Runtime complexity of Prim's algorithm is A. V log V

B. E log V

C. log V D. None of the above

Q09. (Marks:01)

VU Malik

In Prim's algorithm, we start with the vertex r; it can be any vertex. A. First B. Leaf

C. root

D. Mid

Q10. (Marks:01)

VU Malik

Adding any edge to a free tree creates a unique cycle.

A. true

B. false

Q11. (Marks:01)

VU Malik

For undirected graph, there is no distinction between forward and back edges.

A. true

B. false

Q12. (Marks:01)

VU Malik

in strong components algorithm, first of all DFS is run for computing finish times of vertices.

A. true

B. false

Q13. (Marks:01)

VU Malik

Which method is preferable for dealing with chain matrix multiplication?

1. Divide and conquer strategy
2. Dynamic programming formulation
3. Graph theory
4. Greedy Approach

Correct answer: Dynamic programming formulation

Q14. (Marks:01)

VU Malik

Huffman algorithm produces the…….prefix code tree. A. Better

B. Optimal

C. Worst D. Best

Q15. (Marks:01)

VU Malik

A….w is adjacent to vertex v if there is an edge from v to w. A. Acyclic

B. Vertex

C. Loop D. Cycle

Q16. (Marks:01)

VU Malik

Using ASCII standard the string “greedy” will be encoded with A. 44 bits B. 120 bits C. 40 bits

D. 48 bits

Q17. (Marks:01)

VU Malik

In activity scheduling algorithm, each activity is represented by a

A. Rectangle

B. Square C. Circle D. Triangle

Q18. (Marks:01)

VU Malik

Those problems in which greedy finds good, but not always best is called a greedy…..

A. Heuristic

B. Solution