Use Kruskal’s algorithm to find a minimal spanning tree in the graph given in Fig. 2.

Determine an LCS of (1, 0, 1, 1, 0, 0, 1, 0, 1) and (0, 0, 1, 0, 1, 1, 0, 1, 0).

Find an optimal parenthesisation of a matrix chain product whose sequence of dimensions is (3, 5, 7, 3, 4).

Analyse the algorithm and find an upper bound for the run time of the above algorithm.

Let {(−1, −5), (0, −4), (1, −1)} and {(−1, 14), (0, 7), (1, 4)} be the point-value representations of two polynomials

Find all the solutions of the equation 6

Suppose the Connected-Components is run on the undirected graph