GATE CS 2021 : Algorithm Rapid Quiz-1 (App update required to attempt this test)
Attempt now to get your rank among 500 students!
Message = pppqqqqqrpqppqqrrrrssssspq
The number of bits required for huffman encoding of the above message are __________?
Capacity of knapsack, m = 10 and no. of objects, n = 3. Consider the situation that we can only take a object in the bag wholly or we can leave it , but we can't take it partially. Find the difference in maximum profit obtained from dynamic pogramming approach and greedy approach.
56, 89, 23, 67, 12, 45, 6, 8, 92
Note: In Quick Sort, the pivot element chosen will be the last element of the set.
X. In Huffman Coding the length of the code for the largest and the second largest occurring character can never be the same.
Y. The most occurring character will always be the child of root node.
Z. The second smallest element will be farthest leaf from the root node.
A0 (4 × 6), A1 (6 × 8), A2 (8 × 4), A3 (4 × 5)
Which of the following multiplication order gives optimal solution of the above matrices.
- 500 attempts
- 3 upvotes
- 2 comments