# Question

Show that the depth of SORTER [n] is exactly (lg n) (lg n + 1)/2.

## Answer to relevant Questions

Argue that in a breadth-first search, the value d[u] assigned to a vertex u is independent of the order in which the vertices in each adjacency list are given. Using Figure 22.3 as an example, show that the breadth-first ...Give a counterexample to the conjecture that if there is a path from u to v in a directed graph G, then any depth-first search must result in d[v] ≤ f[u].A directed graph G = (V, E) is said to be semi connected if, for all pairs of vertices u, v ¬ V, we have u →v or v→ u. Give an efficient algorithm to determine whether or not G is semi connected. Prove ...Calculate the reversible work and irreversibility for the process described, assuming that the heat transfer is with the surroundings at20C.A 2-kg piece of iron is heated from room temperature 25C to 400C by a heat source at 600C. What is the irreversibility in the process?Post your question

0