Comp 285 Design & Analys: X 3221129-dt-content-rid-55848031 2/courses/COMP285001

Question

Comp 285 Design & Analys: X 3221129-dt-content-rid-55848031 2/courses/COMP285001.201910/Comp 285_ Rev gnment.p on focus areas from our quizzes, and to get you practice with the newer graph topics, such as Dijkstra's, which have not been fully covered in our homework assignments Problem 1: Warm-Up: True or False (a)Instead of using bucket sort to sort digits in the radix sort algorithm, we can use any vald sorting algorithm and radix sort will still sort correctly (b)Consider the forest (vertex-disjoint set of trees) returned by a complete run of DFS on a directed graph. The number of trees in this forest will always be the same, regardless of the order in which you visit nodes in the outermost loop of DFS. !(e) Consider the forest (vertex-disjoint set of trees) returned by a complete run of DFS on an undirected graph. The number of trees in this forest will always be the same, regardless of the order in which you visit nodes in the outermost loop of DFS. (d) Suppose you have a sorted list of n numbers, to which you add 3 extra numbers in (e) Every directed acyclic graph has exactly one topological ordering (f)If a directed graph G is cyclle but can be made acyclic by removing one edge, then a (s)In every directed acyclic graph, BFS and DFS visit the vertices in the same order (b) Ia topological sort exists for the vertices in a directed graph, then a DFS on the graph ( You can ind the shortest path between two vertices in a directed graph, where the arbitrary places. One can sort this list in O(n) time. depth-first search in G will encounter exactly one back edge. will produce no back edges. weights of all edges are equal in O(V E) time. MacBook Pro

Explanation / Answer

Answer)

a) True. Merge sort, quick sort etc can be used

b) True. As it is a disjoint tree.

c) False.

d) True.

As per Chegg policy, a minimum of 1 question can be answered. We did 4.

Hit like if you find the answer useful. :)

Hope this answer helps. Thanks

Related Questions

Navigate

• Browse (All)
• Browse C
• Subjects

---

---

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