Select all the statements below which are TRUE O Let v be a vertex in the graph

Question

Select all the statements below which are TRUE O Let v be a vertex in the graph G. If v.d = oo after we run Breadth First Search algorithm BFS(G,s), then it means that v is not reachable from the source vertex s Dijkstra's algorithm can be used to compute single-source shortest paths when all edges have nonnegative weights. O O Let x be a node in a Binary Search Tree. If z is a node in the left subtree of x, then z.key s x.key. To show that a greedy algorithm always yields an optimal solution, we need to prove (i) the optimal substructure property, and (ii) the greedy-choice property We are given two sequences: X with length 7 and Y with length 4. There are cases when the length of a Longest Common Subsequence (LCS) of X and Y is 5. O Let G be a directed graph. In the adjacency-list representation of G, the sum of the lengths of adjacency lists is

Explanation / Answer

statements 1 to 4 are correct.

statement 1 is True.

statement 2 is True.

statement 3 is True.

statemwnt 4 is True

statement 5 is False. length can't be greater than length of any string

statement 6 is False. It is in case of undirected graph.

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.