Consider the following array.
23 |
32 |
45 |
69 |
72 |
73 |
89 |
97 |
Which algorithm out of the following options uses the least number of comparisons (among the array elements) to sort above array in ascending order?
Consider the following undirected graph with edge weights as shown:
The number of minimum-weight spanning trees of the graph is ______
Consider the following recurrence relation.
$$T(n) = \left\{ {\begin{array}{*{20}{c}} {T(n/2) + T(2n/5) + 7n \ \ \ if\ n > 0}\\ {1\ \ \ \ \ \ \ if\ n = 0} \end{array}} \right.$$
Which one of the following option is correct?
Let G = (V, E) be an undirected unweighted connected graph. The diameter of G is defined as:
diam(G) = $$\displaystyle\max_{u, x\in V}$$ {the length of shortest path between u and v}
Let M be the adjacency matrix of G.
Define graph G2 on the same set of vertices with adjacency matrix N, where
$$N_{ij} =\left\{ {\begin{array}{*{20}{c}} {1 \ \ \text{if} \ \ {M_{ij}} > 0 \ \ \text{or} \ \ P_{ij} > 0, \ \text{where} \ \ P = {M^2}}\\ {0, \ \ \ \ \ \text{otherwise}} \end{array}} \right.$$
Which one of the following statements is true?