1) From the graph above, the correct number of loops is in what range? a) 3 b) 4 c) 2 d) 1 2) From the graph above, the correct degree of U is in what range?  a) 4 b) 5 c) 6 d) 3 3) From the graph above, the correct number of bridges is in what range? a) 1 b) 2 c) 3 d) None 4) Which is possible for the above graph, an Euler Circuit, Euler Path, or neither? a) Euler Circuit b) Euler Path c) Neither d) Both 5) Which of the following is not a characteristic of a complete graph? a) It contains loops b) It must be connected c) It contains multiple edges d) It has exactly one edge joining each pair of vertices e) It must have more than 10 vertices 6) Are the following graphs equivalent or not equivalent? a) Equivalent b) Not Equivalent c) Cannot be determined 7) For a complete graph with 204 vertices, how many edges are there? a) 203!/2 b) 204! c) 30,906 d) 20,706 e) 41,412 8) The Brute Force Algorithm can best be described as: a) Optimal and inefficient b) Approximate and efficient c) Optimal and efficient d) Approximate and inefficient e) None of the above 9) Which of the following could be a text representation of a Hamilton Path for a graph with 8 vertices? a) M, N, O, P, Q, R, S, T, U, V b) M, N, O, P, Q, R, S, T c) M, N, O, P, Q, R, S, M d) M, N, O, P, M, R, S, T 10) An optimal and efficient algorithm for finding Hamilton Circuits for completed weighted graphs:  a) Exists - Repetitive Nearest Neighbor b) Has been proven impossible c) May or may not be possible - we do not know at this time d) Exists - Brute Force e) Exists - Cheapest Link

Math 45 Exam 3 Review

von
Einbetten

Bestenliste

Visueller Stil

Einstellungen

Vorlage ändern

Soll die automatisch gespeicherte Aktivität wiederhergestellt werden?