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’s 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
Kruskal's algorithm (choose best non-cycle edge) is better than Prim's (choose best tree edge) when the graph has relatively few edges?
a) True
b) False
c) NA
d) N/A