1.4 Data structures - graphs #1

What is the size of a given graph?

• 5

• 4

• 14

• 9

In the graph shown, D is an example of a(n) ________ .

• Edge

• Vertex

• Path

• Sling

In the graph shown, (A, F) is an example of a(n) ________ .

• Edge

• Vertex

• Path

• Sling

In the graph shown, A, B, E is an example of a(n) ________ .

• Edge

• Vertex

• Path

• Sling

Which of the following is a cycle shown in the graph?

• B, F, A, B

• A, B, E

• A, E, D, A

• A, C, B, D, A

Which of the following is not an edge in this graph?

• (A, D)

• (D, A)

• (F, A)

• (A, E)

Vertices are considered adjacent if ________ .

• An edge connects them

• There is a path from one vertex to the other

• Both vertices are contained in a cycle

• The length of the path between them is less than 5

The number of edges needed in a complete graph with 5 vertices is ________ .

• 10

• 15

• 5

• 25

following graph is a ---------------------

• Directed graph

• Undirected graph

• Both a and b

• None

A graph is a collection of nodes, called -------- and line segments called arcs or -------- that connect pair of the nodes

• Vertices, path

• Edges, vertices

• Vertices, Edges

• Graph nodes , Edges