Exam 16: Graphs

A minimum spanning tree of a weighted graph is a spanning tree in which the sum of the weights of the edges is less than or equal to the sum of the weights for any other spanning tree for the same graph.

(True/False)

4.9/5

(32)

Question 21

A graph is a special kind of tree.

(True/False)

4.9/5

(29)

Question 22

A(n) _______________________ is one implementation of a graph where the graph is implemented as a linked structure, and each node contains a structure that contains links to all other nodes.

(Multiple Choice)

4.9/5

(32)

Question 23

A graph in which every edge is connected to every other edge is said to be ___________________ .

(Multiple Choice)

4.9/5

(35)

Question 24

Consider the following undirected graph. vertices: 1, 2, 3, 4, 5 edges: (1,2),(3,4), (2,4), (2, 3) Is the graph connected?

(Short Answer)

4.9/5

(37)

Question 25

Consider the following undirected graph. vertices: 1, 2, 3, 4, 5 edges: (1,2),(3,4), (2,4), (2, 3) Is the graph acyclic?

(Short Answer)

4.9/5

(37)

Question 26

A spanning tree of a graph is a tree with that always has which of the following properties?

(Multiple Choice)

4.8/5

(42)

Question 27

In a(n) _____________________ graph, an edge from node labeled A to a node labeled B is the same as having an edge from B to A.

(Multiple Choice)

4.9/5

(35)

Question 28

A graph with integer weights or costs associated with edges is sometimes called a(n) _________________.

(Multiple Choice)

4.8/5

(31)

Question 29

In an undirected graph, an edge of the form (A, B) is the same as an edge of the form (B, A).

(True/False)

4.8/5

(38)

Question 30

What does it mean for a graph to be connected?

(Short Answer)

4.9/5

(34)

Question 31

What is a complete graph? How many edges are contained in a complete graph on n vertices?

(Essay)

4.8/5

(33)

Question 32

An undirected graph is connected if for every pair of vertices, there is an edge between them.

(True/False)

4.9/5

(31)

Question 33

What is the difference between a directed graph and an undirected graph?

(Essay)

4.7/5

(42)

Question 34

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

(Multiple Choice)

4.8/5

(29)

Question 35

What is the maximum number of edges in a directed graph on n vertices? Explain how you arrived at your solution.

(Essay)

4.8/5

(38)

Question 36

A digraph is a __________________________ .

(Multiple Choice)

4.9/5

(42)

Question 37

Write out all of the edges in a complete graph on 4 vertices.

(Short Answer)

4.9/5

(33)

Question 38

In graph terminology, the nodes are referred to as ____________________.

(Multiple Choice)

5.0/5

(35)

Question 39

A graph is said to have a(n) ________________, if there exists a path where the first and last vertices are the same, and no edge is repeated.

(Multiple Choice)

4.9/5

(31)

Question 40

Showing 21 - 40 of 40

A minimum spanning tree of a weighted graph is a spanning tree in which the sum of the weights of the edges is less than or equal to the sum of the weights for any other spanning tree for the same graph.

A graph is a special kind of tree.

A(n) _______________________ is one implementation of a graph where the graph is implemented as a linked structure, and each node contains a structure that contains links to all other nodes.

A graph in which every edge is connected to every other edge is said to be ___________________ .

Consider the following undirected graph. vertices: 1, 2, 3, 4, 5 edges: (1,2),(3,4), (2,4), (2, 3) Is the graph connected?

Consider the following undirected graph. vertices: 1, 2, 3, 4, 5 edges: (1,2),(3,4), (2,4), (2, 3) Is the graph acyclic?

A spanning tree of a graph is a tree with that always has which of the following properties?

In a(n) _____________________ graph, an edge from node labeled A to a node labeled B is the same as having an edge from B to A.

A graph with integer weights or costs associated with edges is sometimes called a(n) _________________.

In an undirected graph, an edge of the form (A, B) is the same as an edge of the form (B, A).

What does it mean for a graph to be connected?

What is a complete graph? How many edges are contained in a complete graph on n vertices?

An undirected graph is connected if for every pair of vertices, there is an edge between them.

What is the difference between a directed graph and an undirected graph?

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

What is the maximum number of edges in a directed graph on n vertices? Explain how you arrived at your solution.

A digraph is a __________________________ .

Write out all of the edges in a complete graph on 4 vertices.

In graph terminology, the nodes are referred to as ____________________.

A graph is said to have a(n) ________________, if there exists a path where the first and last vertices are the same, and no edge is repeated.

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