hurry up make the answers clear oky 5) Which number is NOT equivalent to 7 B) 13
ID: 3906190 • Letter: H
Question
hurry up make the answers clear oky
5) Which number is NOT equivalent to 7 B) 13 C) 15 D) 19 une complexity of merge sort al gorithm on n mbers is B) O(n) C)O(nlogn) D) 0(?) B) T(n) 2T(n /2)+O(n) D) T(n) ST(n/2)+O(n) A) Ollogn) yoe is the least number of operations of two n-bits integers' maltiplication? A) T(n)-T(n/2)+0(n) o T(n)-3T(n/2)+O(m) uer algorithm for selection, when the sequence is 2, 11, 5, 15, 4, fit solis on 6, hen the sb-araycontaining mumber smaller an will have ) number(s) A)I B) 2 C) 3 D) 6 9) Which is the adjacent matrix of the graph in Figure 17 (O 1 1 0 1 0 0 0 (0 1 1 0 (0 1 1 o 10 01 0 0 1 0 001 0) C) D) A) 0110 0 0 0 0 Figure 2 Figure I 10) The total length of the shortest path from A to F in Figure 2 is B) 8 C)9 D) 11 A) 6 11) The length of longest increasing sequence in 5,2, 8, 6,3, 6,9,7 is D) 6 A) 3 12) Which one is Huffman code? A) (0, 01, 011, 001) C) (0, 10, 110, 111) B) (0,00, 001, 011) D) (00,001, 100, 1000) mum spanning tree is CORRECT? complexity of Kruskal's algorithm is bigger than that of Prim's algorithm. 13) Which statement on mini A) The B) The intermediate structures of Prim's algorithm are all trees (216)Explanation / Answer
5) (B) all the numbers provides 3 as result under modular arithmetic (mod 4) except 13 which provides 1.
6) (C) Merge sort uses divide and conquer approach which provides a time complexity of O(nlogn).
7) (C) The least number of operations of two n bit integers' multiplication is T(n)=3T(n/2) + O(n)
8) (C) The sub array containing number lesser than 6 will contain 2 and 5 and 4. So, the total numbers are 3.
9) (C) a has connectivity to b and c, b has connectivity to a and d, c has connectivity to a and d, d has connectivity to b and c. Only option C satisfies that.
10) (A) Shortest path is A->B->E->F and the length is 1+1+4=6.
11) (B) The longest increasing sequence is 2,3,6,9 and the length is 4.
12) (C) Huffman code is a prefix code and hence only option (C) satisfies and all the other options are wrong.
13) B)The time complexity of Kruskal's algorithm is O(logV) while Prim's algorithm has a time complexity of O(V2). So, Prim's algorithm has a higher time complexity than Kruskal's. So, option A is false.However I am assuming complexity as time complexity here.
Prim's algorithm always joins a new vertex to an old one, so all the intermediate stages are trees. So, option (B) is true.
Hope this helps.
Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.