Question 1: Check all that apply.

Consider the graph G (V,E) where V is the set of vertices and E is the set of undirected edges. V = {A, B, C, D, E, F, G} and E = {(D,C), (E,A), (D,B), (E,B), (G,D), (E,F)}.

Consider this graph rooted at Vertex B. This graph has these properties (Drawing the graph may help).

Group of answer choices:

a. binary

b. tree

c. heap

d. complete

e. None of these answers

Question 2:

Consider the graph G (V,E) where V is the set of vertices and E is the set of undirected edges. V = {A, B, C, D, E, F, G} and E = {(D,C), (E,A), (D,B), (E,B), (G,D), (E,F)}.

If this graph is a tree and rooted at vertex C, then this tree has a height equal to __________ . (It would help to draw the graph to answer the questions).

Question 3: Check all that apply.

Consider the graph G (V,E) where V is the set of vertices and E is the set of undirected edges. V = {A, B, C, D, E} and E = {(D,C), (E,C), (D,B), (E,B)}.

If this graph includes cycles, check all vertices belonging to a cycle. (It would help to draw the graph to answer the questions).

Group of answer choices:

a. B

b. E

c. C

d. None of these answers

e. A

f. D

Question 4: Check all that apply.

Consider the graph G (V,E) where V is the set of vertices and E is the set of undirected edges. V = {A, B, C, D, E} and E = {(D,C), (C,E), (B,D), (E,B)}.

Check all properties that this graph has. (It would help to draw the graph to answer the questions).

Group of answer choices:

a. acyclic

b. connected

c. None of these answers

d. undirected

Question 5: Check all that applies.

A tree is a graph with this(these) property(ies).

Group of answer choices:

a. Each node has at most two children

b. acyclic

c. connected

d. None of these answers

e. undirected