Have an account?
Skip to Content
Build your own quiz
Suggestions for you
12 questions
Show Answers
See Preview
- 1. Multiple Choice
Dijkstra algorithm is also called the …………………. shortest path problem.
multiple source
single source
single destination
multiple destination
- 2. Multiple Choice
In Greedy method we get ________ Feasible solutions
one
more than one
zero
hundred
- 3. Multiple Choice
Which of the following is true about Huffman Coding.
Huffman coding may become lossy in some cases
Huffman Codes may not be optimal lossless codes in some cases
In Huffman coding, no code is prefix of any other code.
All
- 4. Multiple Choice
The output of Kruskal and Prims algorithm is ________________
Maximum spanning tree
Spanning tree
Minimum spanning tree
None
- 5. Multiple Choice
How do you determine the cost of a spanning tree?
By the sum of costs of the edges of the tree
By the sum of the costs of the edges and vertices of the tree
By the sum of the costs of the vertices of the tree
By the sum of costs of the edges of the graph
- 6. Multiple Choice
Which is optimal value in the case of job sequence problem
Item : 1 2 3 4 5
Profit : 20 15 10 5 1
Deadline : 2 2 3 3 3
1,3,4
1,2,4
4,2,3
1,5,2
- 7. Multiple Choice
Given the four functions f1(n) = n100 , f2(n) = (1.2)n , f3(n) = 2n/2 , f4(n) = 3n/3..... which function will have the largest value for sufficiently large values of n
f4
f3
f2
f1
- 8. Multiple ChoiceA minimum spanning tree has___edges.(K-1)(K-1)*1(V – 1)NONE OF THE ABOVE
- 9. Multiple ChoiceA graph can only have one(1) spanning tree.TRUEFALSE
- 10. Multiple Choice
The correct encoding of the letter C in this tree is...
11
10
01
00
- 11. Multiple Choice
How do you move through a Huffman tree?
0 = right 1= left
1 = left 2 = right
0 = left 1 = right
0 = middle 1 = back
- 12. Multiple Choice
Knapsack problem is an example of ________ problem
Maximize
Minimize
Neutralized
Balanced
- Answer choicesTagsAnswer choicesTags