Question 1

The breadth first traversal traverses the graph from each vertex that is not visited.

Accepted Answer

A) True 
 B)False  True

Question 2

Let G be an undirected graph. G is called ____ if any two vertices in G are connected.

Accepted Answer

A)  weakly connected 
B)  completely connected 
C)  strongly connected 
D)  inversely connected 
A)  weakly connected 
B)  completely connected 
C)  strongly connected 
D)  inversely connected C

Question 3

A circuit in a graph that includes all the edges of the graph is called a(n) ____.

Accepted Answer

A)  Euler circuit 
B)  Newton circuit 
C)  Einstein circuit 
D)  Prim circuit 
A)  Euler circuit 
B)  Newton circuit 
C)  Einstein circuit 
D)  Prim circuit A

Question 4

Let G be a directed graph and V(G) = {v1, v2, . . ., vn}, where n >= 0. A(n) ____ of V(G) is a linear ordering vi1, vi2, . . ., vin of the vertices such that, if vij is a predecessor of vik, j does not equal k, 1 <= j <= n, 1 <= k <= n, then vij precedes vik, that is, j < k in this linear ordering.

Accepted Answer

A)  ontological ordering 
B)  orthogonal ordering 
C)  topological ordering 
D)  typographical ordering 
A)  ontological ordering 
B)  orthogonal ordering 
C)  topological ordering 
D)  typographical ordering

Question 5

The breadth first traversal algorithm is similar to traversing a binary tree level-by-level.

Accepted Answer

A) True 
 B)False

Question 6

Let G be an undirected graph. G is called ____ if there is a path from any vertex to any other vertex.

Accepted Answer

A)  attached 
B)  converted 
C)  completed 
D)  connected 
A)  attached 
B)  converted 
C)  completed 
D)  connected

Question 7

____ are used to model electrical circuits, chemical compounds, highway maps, and so on.

Accepted Answer

A)  Trees 
B)  Pictures 
C)  Graphs 
D)  Models 
A)  Trees 
B)  Pictures 
C)  Graphs 
D)  Models

Question 8

A graph G is said to be ____ if either G is a trivial graph or G has an Euler circuit.

Accepted Answer

A)  Newtonian 
B)  Orwellian 
C)  Euclidian 
D)  Eulerian 
A)  Newtonian 
B)  Orwellian 
C)  Euclidian 
D)  Eulerian

Question 9

In the breadth first topological ordering, we first find a vertex that has a predecessor vertex and place it first in the topological ordering.

Accepted Answer

A) True 
 B)False

Question 10

A graph can be shown pictorially.

Accepted Answer

A) True 
 B)False

Question 11

The topological sort algorithm can be implemented either using the depth first traversal or the breadth first traversal.

Accepted Answer

A) True 
 B)False

Question 12

Let G be a weighted graph, let u and v be two vertices in G, and let P be a path in G from u to v. The weight of the path P is the ____ of all the edges on the path P.

Accepted Answer

A)  sum of the edges 
B)  product of the weights 
C)  sum of the weights 
D)  product of the edges 
A)  sum of the edges 
B)  product of the weights 
C)  sum of the weights 
D)  product of the edges

Question 13

A ____ in G is a simple path in which the first and last vertices are the same.

Accepted Answer

A)  circle 
B)  loop 
C)  cycle 
D)  recursion 
A)  circle 
B)  loop 
C)  cycle 
D)  recursion

Question 14

There are two well-known algorithms, ____ algorithm and Kruskal's algorithm, for finding a minimum spanning tree of a graph.

Accepted Answer

A)  Prim's 
B)  Newton's 
C)  Euler's 
D)  Orwell's 
A)  Prim's 
B)  Newton's 
C)  Euler's 
D)  Orwell's

Question 15

Let G be a weighted graph, a minimum (minimal) spanning tree of G is a spanning tree with the ____.

Accepted Answer

A)  maximum weight 
B)  minimum weight 
C)  maximum height 
D)  minimum height 
A)  maximum weight 
B)  minimum weight 
C)  maximum height 
D)  minimum height

Question 16

If the graph represents a highway structure, the weight can represent the distance between two places or the travel time from one place to another.

Accepted Answer

A) True 
 B)False

Question 17

When drawing a graph, the vertices are drawn as ____.

Accepted Answer

A)  circles 
B)  squares 
C)  triangles 
D)  lines 
A)  circles 
B)  squares 
C)  triangles 
D)  lines

Question 18

A graph can be represented in computer memory in only one way.

Accepted Answer

A) True 
 B)False

Question 19

The statement ____ declares graphIt to be an iterator.

Accepted Answer

A) linkedListIterator graphIt; B) linkedListIterator graphIt; C) linkedListIterator.int graphIt; D) linkedListIterator graphIt; A) linkedListIterator graphIt; B) linkedListIterator graphIt; C) linkedListIterator.int graphIt; D) linkedListIterator graphIt;

Question 20

Processing a graph requires the ability to traverse the graph.

Accepted Answer

A) True 
 B)False

The breadth first traversal traverses the graph from each vertex that is not visited.

Let G be an undirected graph. G is called ____ if any two vertices in G are connected.

A circuit in a graph that includes all the edges of the graph is called a(n) ____.

The breadth first traversal algorithm is similar to traversing a binary tree level-by-level.

Let G be an undirected graph. G is called ____ if there is a path from any vertex to any other vertex.

____ are used to model electrical circuits, chemical compounds, highway maps, and so on.

A graph G is said to be ____ if either G is a trivial graph or G has an Euler circuit.

In the breadth first topological ordering, we first find a vertex that has a predecessor vertex and place it first in the topological ordering.

A graph can be shown pictorially.

The topological sort algorithm can be implemented either using the depth first traversal or the breadth first traversal.

Let G be a weighted graph, let u and v be two vertices in G, and let P be a path in G from u to v. The weight of the path P is the ____ of all the edges on the path P.

A ____ in G is a simple path in which the first and last vertices are the same.

There are two well-known algorithms, ____ algorithm and Kruskal's algorithm, for finding a minimum spanning tree of a graph.

Let G be a weighted graph, a minimum (minimal) spanning tree of G is a spanning tree with the ____.

If the graph represents a highway structure, the weight can represent the distance between two places or the travel time from one place to another.

When drawing a graph, the vertices are drawn as ____.

A graph can be represented in computer memory in only one way.

The statement ____ declares graphIt to be an iterator.

Processing a graph requires the ability to traverse the graph.

Software Engineering Principles and C++ Classes

Object-Oriented Design OOD and C++

Pointers and Array-Based Lists

Standard Template Library (STL) I

Linked Lists

Recursion

Stacks

Queues

Searching and Hashing Algorithms

Sorting Algorithms

Binary Trees and B-Trees

Standard Template Library (STL) II

Filters

Exam 12: Graphs

The breadth first traversal traverses the graph from each vertex that is not visited.

Let G be an undirected graph. G is called ____ if any two vertices in G are connected.

A circuit in a graph that includes all the edges of the graph is called a(n) ____.

Let G be a directed graph and V(G) = {v1, v2, . . ., vn}, where n >= 0. A(n) ____ of V(G) is a linear ordering vi1, vi2, . . ., vin of the vertices such that, if vij is a predecessor of vik, j does not equal k, 1 <= j <= n, 1 <= k <= n, then vij precedes vik, that is, j < k in this linear ordering.

The breadth first traversal algorithm is similar to traversing a binary tree level-by-level.

Let G be an undirected graph. G is called ____ if there is a path from any vertex to any other vertex.

____ are used to model electrical circuits, chemical compounds, highway maps, and so on.

A graph G is said to be ____ if either G is a trivial graph or G has an Euler circuit.

In the breadth first topological ordering, we first find a vertex that has a predecessor vertex and place it first in the topological ordering.

A graph can be shown pictorially.

The topological sort algorithm can be implemented either using the depth first traversal or the breadth first traversal.

Let G be a weighted graph, let u and v be two vertices in G, and let P be a path in G from u to v. The weight of the path P is the ____ of all the edges on the path P.

A ____ in G is a simple path in which the first and last vertices are the same.

There are two well-known algorithms, ____ algorithm and Kruskal's algorithm, for finding a minimum spanning tree of a graph.

Let G be a weighted graph, a minimum (minimal) spanning tree of G is a spanning tree with the ____.

If the graph represents a highway structure, the weight can represent the distance between two places or the travel time from one place to another.

When drawing a graph, the vertices are drawn as ____.

A graph can be represented in computer memory in only one way.

The statement ____ declares graphIt to be an iterator.

Processing a graph requires the ability to traverse the graph.

Software Engineering Principles and C++ Classes

Object-Oriented Design OOD and C++

Pointers and Array-Based Lists

Standard Template Library (STL) I

Linked Lists

Recursion

Stacks

Queues

Searching and Hashing Algorithms

Sorting Algorithms

Binary Trees and B-Trees

Standard Template Library (STL) II

Filters