APPLIED MATHEMATICS TEST QUESTIONS AND ANSWERS
#8
Graph - correct answer A collection of vertices (points) and edges (arcs/line segments
between the vertices).
Path - correct answer A sequence of edges between two vertices on a graph.
Connected Graph - correct answer A graph with at least one path between any two
vertices in the graph.
Circuit - correct answer A path on a graph that starts and stops at the same vertex.
Euler Circuit - correct answer A path on a CONNECTED graph that crosses each EDGE
of the graph only once, while also returning to the starting vertex.
Eulerizing a Graph - correct answer Adding edges to a graph to make it conform to the
definition of an Euler circuit.
Hamiltonian Circuit - correct answer A path on a graph that starts and stops at the same
vertex, and crosses every VERTEX once and only once.
Weighted Graph - correct answer A graph that has numbers associated with its edges
that represent a distance, cost, time, etc.
Counting Principle - correct answer The number of routes is equal to n!, where n is the
number of cities (or whatever) visited (being used).
Algorithm - correct answer A mathematical technique that you repeat over and over
again until you get a solution.
Kruskal's Algorithm - correct answer A technique used to solve a networking problem.
Minimal Spanning Tree - correct answer A subgraph of a graph that connects all
vertices with no circuits.
Tree Diagram - correct answer A diagram used to represent all routes in a problem.
Digraph - correct answer A directional graph showing the partial ordering of tasks.
Priority List - correct answer A ranking of the importance of tasks in a scheduling
problem.
Processor - correct answer A person, machine, computer, etc., completing the tasks of
a scheduling problem.
#8
Graph - correct answer A collection of vertices (points) and edges (arcs/line segments
between the vertices).
Path - correct answer A sequence of edges between two vertices on a graph.
Connected Graph - correct answer A graph with at least one path between any two
vertices in the graph.
Circuit - correct answer A path on a graph that starts and stops at the same vertex.
Euler Circuit - correct answer A path on a CONNECTED graph that crosses each EDGE
of the graph only once, while also returning to the starting vertex.
Eulerizing a Graph - correct answer Adding edges to a graph to make it conform to the
definition of an Euler circuit.
Hamiltonian Circuit - correct answer A path on a graph that starts and stops at the same
vertex, and crosses every VERTEX once and only once.
Weighted Graph - correct answer A graph that has numbers associated with its edges
that represent a distance, cost, time, etc.
Counting Principle - correct answer The number of routes is equal to n!, where n is the
number of cities (or whatever) visited (being used).
Algorithm - correct answer A mathematical technique that you repeat over and over
again until you get a solution.
Kruskal's Algorithm - correct answer A technique used to solve a networking problem.
Minimal Spanning Tree - correct answer A subgraph of a graph that connects all
vertices with no circuits.
Tree Diagram - correct answer A diagram used to represent all routes in a problem.
Digraph - correct answer A directional graph showing the partial ordering of tasks.
Priority List - correct answer A ranking of the importance of tasks in a scheduling
problem.
Processor - correct answer A person, machine, computer, etc., completing the tasks of
a scheduling problem.
