Test my Merit My Results Create Exam

Algorithm Design Techniques | Greedy Algorithms

Consider the string abbccddeee. Each letter in the string must be assigned a binary code satisfying the following properties: 1. For any two letters, the code assigned to one letter must not be a prefix of the code assigned to the other letter. 2. For any two letters of the same frequency, the letter which occurs earlier in the dictionary order is assigned a code whose length is at most the length of the code assigned to the other letter. Among the set of all binary code assignments which satisfy the above two properties, what is the minimum length of the encoded string? 
Four  matrices  M1, M2, M3 and M4 of dimensions p×q, q×r, r×s and s×t respectively can be multiplied in several ways with different number of total scalar multiplications. For example when multiplied as [(M1 × M2) × (M3 × M4)] the total number of scalar multiplications is  pqr + rst + prt. When multiplied as [((M1 × M2)× M3)) × M4], the total number of scalar multiplications is pqr + prs + pst. If p = 10, q = 100, r = 20, s = 5 and t = 80, then the minimum number of scalar multiplications needed is:
Suppose there are six files F1, F2, F3, F4, F5, F6 with corresponding sizes 150 KB, 225 KB, 75 KB, 60 KB, 275 KB and 65 KB respectively. The files are to be stored on a sequential device in such a way that optimizes access time. In what order should the files be stored?
Six files F1, F2, F3, F4, F5 and F6 have 100, 200, 50, 80, 120, 150 records respectively. In what order should they be stored so as to optimize act. Assume each file is accessed with the same frequency 
Given below are some famous algorithms and some algorithm design paradigms Algorithms Design Paradigm  1. Dijkstra's shortest path algorithms  (a) Greedy design  2. Floyd-Warshall's all-pair-shortest path algorithms  (b) Divide and conquer  3. Kruskal's minimum spanning tree algorithm  (c) Dynamic programming  4. Merge Sort algorithm     Which of the following correspondence is correct?
Let in a file the frequency of letters i, n, d, e, x are 16, 7, 17, 25, 20 respectively. Which of the following is the Huffman's code of the letter 'x'?
Which of the following compression algorithms is used to generate a .png file?
 Consider the following codes : 1. Hamming code. 2. Huffman code 3. Shannon-Fano code 4. Convolutional code Which of these are source codes ?
Which of following problems cannot be solved using greedy approach?
If b is the branching factor and m is the maximum depth of the search tree, what is the space complexity of greedy search ?  
Ads