×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
Dijkstra’s algorithm is based on
2.
Given A, an array of size n, comprised of an increasing sequence of numbers followed immediately by a decreasing one. What is worst case time complexity of optimal algorithm to determine if a given number x is in the array?
3.
4.
5.
6.
The time complexity of computing the transitive closure of a binary relation on a set of n elements is known to be
7.
8.
9.
10.
