MAT2051 Discrete Mathematics

MAT2051 Unit 10 Quiz 5 Latest 2020 MAT2051 Discrete Mathematics Unit 10 Quiz 5 Question 1Given an unordered list of n numbers, what algorithm would you use to sort it, and what is the worst-case runtime of the algorithm? Answers: a. Tournament sort, O(n log n). b. Tournament sort, O(n). c. Prim’s Algorithm, O(n log n). d. Prim’s Algorithm, O(n * n). Question 2Given a graph with n vertices, what is the minimum number of edges needed such that the graph is connected? Answers: a. n. ...