Networks Diagnostic Quiz

What defines a path in a network?

• It must start and end at the same node.

• It must include every edge in the network.

• It starts and finishes at different nodes.

• It can only include nodes with even degrees.

How is the value of a weighted path calculated?

• By multiplying the weights of all edges.

• By adding the weights of all edges in the path.

• By averaging the weights of the nodes.

• By counting the number of nodes.

Which network is traversable as an Euler path (but not an Euler circuit)?

• A network with one odd node.

• A network with two odd nodes.

• A network with three odd nodes.

• A network where all nodes have even degrees.

What is the key difference between an Euler circuit and an Euler path?

• An Euler circuit must pass through every node twice.

• An Euler path ends at a different node than it starts.

• An Euler circuit has no edges.

• An Euler path requires all nodes to have even degrees.

In the house plan network example, what do edges represent?

• Rooms.

• Doorways between rooms.

• Furniture in rooms.

• The size of each room.

How is the shortest path in a weighted network determined?

• By choosing the path with the fewest nodes.

• By selecting the path with the smallest sum of edge weights.

• By always turning left at each node.

• By avoiding all even-degree nodes.

What does a tree diagram help identify in networks?

• The number of nodes with odd degrees.

• All possible routes from a start to finish point.

• The color-coding of edges.

• The fastest way to draw a network.

In the table-based network example, what does the value '45 km' represent?

• The distance between Karamea and Westport.

• The distance between Reefton and Springs Junction.

• The total nodes in the network.

• The weight of the shortest path.

Which step is not part of constructing a network from a table?

• Placing the most connected node at the centre.

• Drawing edges to represent connections.

• Ensuring all edge weights are equal.

• Adding nodes for each location.

What is a weighting in a network?

• The number of edges connected to a node.

• A value assigned to an edge (e.g., distance, cost).

• The total number of nodes.

• The degree of a node.