Question 1

A complete graph on n vertices has n(n-1)/2 edges.

Accepted Answer

A) True 
 B)False  True

Question 2

Consider the following undirected graph.
vertices: 1, 2, 3, 4, 5
edges: (1,2),(3,4), (2,4), (2, 3), (3,5), (4,5)
Write out an adjacency matrix for this graph.

Accepted Answer

0 1 2 3 4 5
1 F T F

Question 3

A cycle is a path that starts and ends on the same vertex.

Accepted Answer

A) True 
 B)False  False

Question 4

What is the difference between a spanning tree and a minimum spanning tree?

Accepted Answer

A spanning tree for a graph is an acycli

Question 5

An adjacency matrix is one approach to implementing a graph that uses a two-dimensional array.

Accepted Answer

A) True 
 B)False

Question 6

Consider a digraph with the following vertices and edges: vertices: 1, 2, 3, 4
Edges: (1,2), (2,1), (3,4)
Which of the following statements are true?

Accepted Answer

A)  The graph has a cycle 
B)  The graph is connected 
C)  The graph is acyclic 
D)  all of the above are true 
E)  neither a, b, nor c are true. 
A)  The graph has a cycle 
B)  The graph is connected 
C)  The graph is acyclic 
D)  all of the above are true 
E)  neither a, b, nor c are true.

Question 7

Can an edge be part of more than one cycle in a graph? Explain.

Accepted Answer

Yes, an edge can be part of more than on

Question 8

Can a tree ever have a cycle? Explain.

Accepted Answer

No, a tree cannot have a cycle

Question 9

A digraph and an directed graph are the same thing.

Accepted Answer

A) True 
 B)False

Question 10

A breadth-first traversal of a graph uses which of the following data structures?

Accepted Answer

A)  binary search tree 
B)  stack 
C)  queue 
D)  array 
E)  none of the above 
A)  binary search tree 
B)  stack 
C)  queue 
D)  array 
E)  none of the above

Question 11

A breadth-first traversal uses a stack as a supporting data structure.

Accepted Answer

A) True 
 B)False

Question 12

Which of the following describes vertices that are adjacent?

Accepted Answer

A)  They are close to one another in the visual representation of the graph. 
B)  They are far apart in the visual representation of the graph. 
C)  There is no edge connecting them. 
D)  There is an edge connecting them. 
E)  None of the above describes adjacent vertices. 
A)  They are close to one another in the visual representation of the graph. 
B)  They are far apart in the visual representation of the graph. 
C)  There is no edge connecting them. 
D)  There is an edge connecting them. 
E)  None of the above describes adjacent vertices.

Question 13

A connected graph has which of the following properties?

Accepted Answer

A)  For any pair of vertices, there is an edge between them. 
B)  Every vertex is adjacent to every other vertex. 
C)  No vertex is adjacent to every other vertex. 
D)  For any pair of vertices, there is a path between them. 
E)  There exists a vertex that is adjacent to every other vertex. 
A)  For any pair of vertices, there is an edge between them. 
B)  Every vertex is adjacent to every other vertex. 
C)  No vertex is adjacent to every other vertex. 
D)  For any pair of vertices, there is a path between them. 
E)  There exists a vertex that is adjacent to every other vertex.

Question 14

What data structure is used to support a depth-first traversal of a graph?

Accepted Answer

A stack is the data

Question 15

Is every tree a graph? Is every graph a tree? Explain.

Accepted Answer

A tree is a special kind of graph which

Question 16

A __________________ traversal can be used to determine if a graph is connected.

Accepted Answer

A)  inorder 
B)  preorder 
C)  depth-first 
D)  breadth-first 
E)  none of the above 
A)  inorder 
B)  preorder 
C)  depth-first 
D)  breadth-first 
E)  none of the above

Question 17

A(n) ___________________ is a two-dimensional array that can be used to represent a graph.

Accepted Answer

A)  adjacency list 
B)  adjacency matrix 
C)  digraph list 
D)  graph node 
E)  none of the above 
A)  adjacency list 
B)  adjacency matrix 
C)  digraph list 
D)  graph node 
E)  none of the above

Question 18

Explain how a breadth-first traversal of a graph works.

Accepted Answer

A breadth-first traversal of a graph use

Question 19

Consider the following undirected graph.
vertices: 1, 2, 3, 4, 5
edges: (1,2),(3,4), (2,4), (2, 3), (3,5), (4,5)
Give a spanning tree for this graph.

Accepted Answer

One spanning tree fo

Question 20

A spanning tree of a graph does not necessarily include all of the edges of the graph.

Accepted Answer

A) True 
 B)False

A complete graph on n vertices has n(n-1)/2 edges.

Consider the following undirected graph. vertices: 1, 2, 3, 4, 5 edges: (1,2),(3,4), (2,4), (2, 3), (3,5), (4,5) Write out an adjacency matrix for this graph.

A cycle is a path that starts and ends on the same vertex.

What is the difference between a spanning tree and a minimum spanning tree?

An adjacency matrix is one approach to implementing a graph that uses a two-dimensional array.

Consider a digraph with the following vertices and edges: vertices: 1, 2, 3, 4 Edges: (1,2), (2,1), (3,4) Which of the following statements are true?

Can an edge be part of more than one cycle in a graph? Explain.

Can a tree ever have a cycle? Explain.

A digraph and an directed graph are the same thing.

A breadth-first traversal of a graph uses which of the following data structures?

A breadth-first traversal uses a stack as a supporting data structure.

Which of the following describes vertices that are adjacent?

A connected graph has which of the following properties?

What data structure is used to support a depth-first traversal of a graph?

Is every tree a graph? Is every graph a tree? Explain.

A __________________ traversal can be used to determine if a graph is connected.

A(n) ___________________ is a two-dimensional array that can be used to represent a graph.

Explain how a breadth-first traversal of a graph works.

Consider the following undirected graph. vertices: 1, 2, 3, 4, 5 edges: (1,2),(3,4), (2,4), (2, 3), (3,5), (4,5) Give a spanning tree for this graph.

A spanning tree of a graph does not necessarily include all of the edges of the graph.

Introduction

Data and Expressions

Using Classes and Objects

Conditionals and Loops

Writing Classes

Graphical User Interfaces

Arrays

Inheritance

Polymorphism

Recursion

Exceptions

Searching and Sorting

Trees

Introduction to Collections and Stacks

Heaps and Priority Queues

Filters

Exam 16: Graphs

A complete graph on n vertices has n(n-1)/2 edges.

Consider the following undirected graph. vertices: 1, 2, 3, 4, 5 edges: (1,2),(3,4), (2,4), (2, 3), (3,5), (4,5) Write out an adjacency matrix for this graph.

A cycle is a path that starts and ends on the same vertex.

What is the difference between a spanning tree and a minimum spanning tree?

An adjacency matrix is one approach to implementing a graph that uses a two-dimensional array.

Consider a digraph with the following vertices and edges: vertices: 1, 2, 3, 4 Edges: (1,2), (2,1), (3,4) Which of the following statements are true?

Can an edge be part of more than one cycle in a graph? Explain.

Can a tree ever have a cycle? Explain.

A digraph and an directed graph are the same thing.

A breadth-first traversal of a graph uses which of the following data structures?

A breadth-first traversal uses a stack as a supporting data structure.

Which of the following describes vertices that are adjacent?

A connected graph has which of the following properties?

What data structure is used to support a depth-first traversal of a graph?

Is every tree a graph? Is every graph a tree? Explain.

A __________________ traversal can be used to determine if a graph is connected.

A(n) ___________________ is a two-dimensional array that can be used to represent a graph.

Explain how a breadth-first traversal of a graph works.

Consider the following undirected graph. vertices: 1, 2, 3, 4, 5 edges: (1,2),(3,4), (2,4), (2, 3), (3,5), (4,5) Give a spanning tree for this graph.

A spanning tree of a graph does not necessarily include all of the edges of the graph.

Introduction

Data and Expressions

Using Classes and Objects

Conditionals and Loops

Writing Classes

Graphical User Interfaces

Arrays

Inheritance

Polymorphism

Recursion

Exceptions

Searching and Sorting

Trees

Introduction to Collections and Stacks

Heaps and Priority Queues

Filters