7 results authored by Stephen Maher - search across all users.
-
Question in Stephen's workspace
Attempt to apply Dijkstra's algorithm to find the shortest path from the source node (a) to a given sink node.
-
Exam (2 questions) in Stephen's workspace
Questions on graph theory
-
Question in Stephen's workspace
This question displays one of 10 graphs. It asks the student to either
(a) count the vertices, or
(b) count the edges, or
(c) state how many vertices a spanning tree would contain, or
(d) state how many edges a spanning tree would contain, or
(e) state the degree of a selected (randomly chosen) vertex.
-
Question in Stephen's workspace
Students are randomly shown one of two networks. They are shown four sub-networks, and asked to identify which one is a minimum spanning tree for the network. Thus, there are 2 versions of this question.
-
Exam (2 questions) in Stephen's workspace
No description given
-
Question in Stephen's workspace
Simple counting exercise, with combinations
-
Question in Stephen's workspace
Introduction to counting with permutations and combinations