×
Detail Form
We will send your result on your email id and phone no. please fill detail
1.
Dijkstra algorithm, which solves the single-source shortest--paths problem, is a _________, and the Floyd-Warshall algorithm, which finds shortest paths between all pairs of vertices, is a _________
2.
Assume A and B are non-zero positive integers. The following code segment while ( A != B) { If ( A > B ) A - = B ; else B - = A ; } cout << A; // printing the value of A
3.
4.
The time complexity of computing the transitive closure of binary relation on a set of n elements is known to be
5.
The travelling salesman problem can be solved in:
6.
Which of the following is asymptotically smaller?
7.
Let f(n) and g(n) be asymptotically non-negative functions. Which of the following is correct?
8.
Which design matric is used to measure the compactness of the program in terms of lines of code?
9.
What is the best method to go for the game playing problem?
10.
