mca-3 Algorithm and graph theory
1. The space requirement S (p) of any algorithm p may be written as ………….
A) T (P) = c + Tp B) S (P) = c + Sp C) S (P) = Sp D) S (P) = T (P) + C+SP
2. The total number of steps required by the algorithm is determined to be ……….
A) 2n B) 3n + 2n C) 2n + 2 D) 2n + 3
3. A data structure known as ………… in which a location of an item is determined directly as a function of the item itself, rather than a sequence or trail and error comparisons
A)Stack B)Queue C) Heap D) Hash-table
4. An Average case element comparison in max and Min. Algorithm is ……………
A)n - 1 B)2( n – 1 ) C) 3( n - 1) D) None of the above.
5.In ……….. the division into two sub arrays is made so that the sorted sub arrays do not need to merg later.
A) Quick sort B) Merge sortC) bubble sort D) Heap sort
6. The time complexity of merge sort is ………….
(A) O (n log n) B) O (n2) C) n log n D) O (n3)
7. ……….. Algorithm determined the length of the shortest path from v0 to all other vertices in G...