Recent questions tagged algorithms

Let G be a connected, undirected graph of $50$ vertices and $200$ edges. The weight of a minimum spanning tree of G is $800$ . When the weight of each edge of G is decrea...

The number of distinct minimum spanning trees for the weighted graph below is____________ 

Consider a graph with the following weighted edges: Which one of the following sequences cannot be the order of edges added to a Minimum Spanning Tree (MST) using Kruskal...

Arrange the following functions by their asymptotic growth rate in increasing order.$f_1(n)=(\log n)^{\log n}$ $f_2(n)=2^{\sqrt{\log _2 n}}$ $f_3(n)=n^{1 / 3}(\log n)^3$ ...

Consider the following three statements regarding asymptotic notation:I. $\log \left(n^c\right)=\Theta(\log n)$ where $c>0$ is a constantII. $3^{n+5}=\Theta\left(3^n\righ...

Consider the following weighted, undirected graph:What is the total weight of the Minimum Spanning Tree (MST) for this graph?

Among the following sequences:I. $GDFHACBE$II. $GHFACDBE$III. $GHDACFBE$IV. $GFDHCABE$Which of the following are possible breadth-first traversals of the graph, starting ...

Among the following sequences:I. $A B E C F G D H$II. $A D G F C H B E$III. $ACFGBDEH$IV. $ADHFGCBE$Which of the following are possible depth-first traversals (DFS) of th...

Among the following sequences:I. abefghII. afehbgIII. abghefIV. aebfhgWhich are the possible depth-first traversals of the modified graph, starting from node 'a'?I and II...

Suppose we run Dijkstra's single-source shortest path algorithm on the following edge-weighted directed graph with vertex $\mathbf{S}$ as the source. (Assume alphabetical...