Decision Mathematics Key Terms Quiz

What is an Activity (on arc) network?

• A job or process that forms part of an overall project.

• A network drawn to show how the activities in a project are dependent upon each other.

• A sequence of precise instructions used to solve a problem.

• A line connecting two vertices (nodes) on a graph.

What does an Adjacency Matrix represent?

• A graph in which a path exists between every pair of vertices.

• A table which represents a graph, such that rows and columns correspond to vertices, and the entries in the table correspond to the number of edges connecting one vertex to another.

• A route through an activity network, from start to finish, which consists of only critical activities.

• A closed path where the end of the last edge is the start of the first edge.

What is an Algorithm?

• A job or process that forms part of an overall project.

• A network drawn to show how the activities in a project are dependent upon each other.

• A sequence of precise instructions used to solve a problem.

• A line connecting two vertices (nodes) on a graph.

What is a Complete graph?

• A simple graph in which every pair of vertices is connected by an edge.

• A graph in which a path exists between two vertices.

• A graph in which at least one edge has a direction associated with it.

• A tabular representation of a network, in which each element represents the weight of the edge between two vertices.

What is a Critical path?

• An activity with no float - meaning any delay to this activity will result in a delay for the entire project.

• A route through an activity network, from start to finish, which consists of only critical activities.

• A closed path where the end of the last edge is the start of the first edge.

• The number of edges incident to a vertex.

What is a Cycle (circuit)?

• A graph in which a path exists between every pair of vertices.

• A closed path where the end of the last edge is the start of the first edge and no vertices are repeated, except that the end vertex of the last edge is the start vertex of the first edge.

• A line in a graph with a direction associated with it.

• A tabular representation of a network, in which each element represents the weight of the edge between two vertices.

What is a Digraph?

• A graph in which a path exists between every pair of vertices.

• A graph in which at least one edge has a direction associated with it.

• A line in a graph with a direction associated with it.

• A line connecting two vertices (nodes) on a graph.

What is a Distance matrix?

• A graph in which a path exists between every pair of vertices.

• A graph in which at least one edge has a direction associated with it.

• A tabular representation of a network, in which each element represents the weight of the edge between two vertices.

• A line connecting two vertices (nodes) on a graph.

What is the measure of the "run time" in an algorithm, which is proportional to the number of operations that must be carried out?

• Efficiency of an algorithm

• Feasible region

• Float

• Loop

What is a graph in which every vertex has an even degree called?

• Hamiltonian cycle

• Eulerian graph

• Minimum spanning tree

• Network