{ "q1": { "type": "blank", "question": "\n

A graph stores the ____ between pairs of objects. Like a\nlinked list or binary tree, a graph consists of nodes known\nas ____, which are connected to other nodes through links\nknown as ____. The number of links connected to a node is\ncalled the ____ of the object. A sequence of links between\ntwo nodes in a graph is called a ____.

\n" }, "q2": { "type": "order", "question": "\n

Match the graph terms below to the following descriptions:

\n\n
\n
1. There exists a path between any two nodes in a graph.
2. \n
3. When edges can only be traversed in one direction.
4. \n
5. When each edge has a corresponding cost.
6. \n
7. When there are no parallel or self-loop edges in a graph.
8. \n
9. When every node has a degree n - 1.
10. \n
\n", "responses": { "directed": "Directed", "complete": "Complete", "connected": "Connected", "weighted": "Weighted", "simple": "Simple" } }, "q3": { "type": "order", "question": "\n

Reorder the following rows of an adjacency matrix to correspond\nto the graph below:

\n\n
\n \n
\n\n
`\n  A B C D E\nA ? ? ? ? ?\nB ? ? ? ? ?\nC ? ? ? ? ?\nD ? ? ? ? ?\nE ? ? ? ? ?\n`
\n", "responses": { "a": "0 0 0 0 1", "b": "0 1 1 0 0", "c": "0 1 0 1 0", "d": "0 0 0 1 0", "e": "1 0 0 0 0" } }, "q4": { "type": "order", "question": "\n

Reorder the following lists of an adjacency list to correspond to\nthe graph below:

\n\n
\n \n
\n\n
`\nA: ?\nB: ?\nC: ?\nD: ?\nE: ?\n`
\n", "responses": { "a": "D", "b": "E", "c": "B, C", "d": "B, D", "e": "A" } } }