(A) True
(B) False
(C) Less information to decide
(D) Either true or false
Tag: Fundamentals of Computer Algorithms
When we call heapify then at each level the comparison performed takes time?
(A) It will take O(1)
(B) Time will vary according to the nature of input data
(C) It can not be predicted
(D) It will take O(log n)
What is the total time to heapify?
(A) Ο(log n)
(B) Ο(n log n)
(C) Ο(n2 log n)
(D) Ο(log2 n)
A RAM is an idealized machine with __ random-access memory.
(A) 256MB
(B) 512MB
(C) an infinitely large
(D) 100GB
Random access machine or RAM is a/an?
(A) Mathematical model
(B) Machine build by Al-Khwarizmi
(C) Mechanical machine
(D) Electronics machine
The sieve technique is a special case, where the number of sub problems is just?
(A) 1
(B) 5
(C) Few
(D) Many
In the analysis of Selection algorithm, we eliminate a constant fraction of the array with each phase; we get the convergent __ series in the analysis.
(A) linear
(B) arithmetic
(C) geometric
(D) exponent
Which is true statement in the following?
(A) Kruskal algorithm is multiple source technique for finding MST
(B) Kruskal’s algorithm is used to find minimum spanning tree of a graph, time complexity of this algorithm is O(EV)
(C) Both of above
(D) Kruskal’s algorithm (choose best non-cycle edge) is better than Prim’s (choose best Tree edge) when the graph has relatively few edges