Match List I with List IIList IList II(A) Topological sort of DAG(I) O(V + E)(B) Kruskal's MST algorithm(II) O(VE)(C) Bellman-Ford's single-source shortest path algorithm(III) θ (V + E)(D) Floyd-Warshall's all-pair shortest path algorithm(IV) θ(V3) Choose the correct answer from the options given below:

Match List I with List IIList IList II(A) Topological sort of DAG(I) O

1.	Match List I with List IIList IList II(A) Topological sort of DAG(I) O(V + E)(B) Kruskal's MST algorithm(II) O(VE)(C) Bellman-Ford's single-source shortest path algorithm(III) θ (V + E)(D) Floyd-Warshall's all-pair shortest path algorithm(IV) θ(V3) Choose the correct answer from the options given below:
A.	A - I, B - III, C - IV, D - II
B.	A - III, B - I, C - IV, D - II
C.	A - III, B - I, C - II, D - IV
D.	A - I, B - III, C - II, D - IV
Answer» E.

Discussion

No Comment Found

Related MCQs

A text is made up of the characters a, b, c, d, e each occurring with the probability 0.11, 0.40, 0.16, 0.09 and 0.24 respectively. The optimal Huffman coding technique will have the average length of :
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?
Consider the following table: Algorithms Design Paradigms (P) Kruskal (i) Divide and Conquer (Q) Quicksort (ii) Greedy (R) Floyd-Warshall (iii) Dynamic Programming Match the algorithms to the design paradigms they are based on.
Consider the following two sequences :X = < B, C, D, C, A, B, C >and Y = < C, A, D, B, C, B >The length of longest common subsequence of X and Y is :
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:
Assume that multiplying a matrix G1 of dimension
Match the following and choose the correct answer for the order A, B, C, D.A.Strassen matrix multiplicationp.Decrease and ConquerB.Insertion sortq.Dynamic ProgrammingC.Gaussian Eliminationr.Divide and ConquerD.Floyd shortest path algorithms.Transform and Conquer
Consider the following codes :1. Hamming code.2. Huffman code3. Shannon-Fano code4. Convolutional codeWhich of these are source codes ?
In case of the dynamic programming approach the value of an optimal solution is computed in:
Define Rn to be the maximum amount earned by cutting a rod of length n meters into one or more pieces of integer length and selling them. For i > 0, let p[i] denotes the selling price of a rod whose length is i meters. Consider the array of prices:p[1] = 1, p[2] = 5, p[3] = 8, p[4] = 9, p[5] = 10, p[6] = 17, p[7] = 18Which of the following statements is/are correct about R7?

Discussion

No Comment Found

Related MCQs

Reply to Comment