Discrete Structures

By: Grace Dematawaran

Quiz 6
10/10

Question 1
Correct
Mark 1 out of 1

Remove flag

Question text

It consists of two finite sets, a nonempty set V(G) of vertices and a set E(G) of edges?

Select one:
a. Tree
b. Graph
c. None of the choices
d. Loop
Feedback

Your answer is correct.

Question 2
Correct
Mark 1 out of 1

Remove flag

Question text

In a graph, let V = {v1, v2, v3}, and E = {e1, e2, e3}, assuming the endpoints of e1 are v1and
v2, the endpoints of e2 are v1 and v3, the endpoints of e3 are v2 and v3. Then e1 and e2 are
incident on what vertex in the graph?
Select one:
a. v3
b. None of the choices
c. v2
d. v1
Feedback

Your answer is correct.

Question 3
Correct
Mark 1 out of 1

Remove flag

Question text

It is a vertex distinguishable from other vertex?

Select one:
a. Right Child
b. None of the choices
c. Root
d. Left Child
Feedback

Your answer is correct.

Question 4
Correct
Mark 1 out of 1

Remove flag

Question text

It is an edge with just one endpoint?

Select one:
a. Edge-Endpoint
b. None of the choices
c. Parallel
d. Loop
Feedback

Your answer is correct.

Question 5
Correct
Mark 1 out of 1

Remove flag

Question text

It is a tree in which there is one vertex that is distinguished from the others?
Select one:
a. Spanning Tree
b. None of the choices
c. Binary Tree
d. Rooted Tree
Feedback

Your answer is correct.

Question 6
Correct
Mark 1 out of 1

Remove flag

Question text

Refers to a vertex unconnected by an edge to any other vertex in the graph?

Select one:
a. None of the choices
b. Isolated
c. Parallel
d. Loop
Feedback

Your answer is correct.

Question 7
Correct
Mark 1 out of 1

Remove flag

Question text

Refers to the sum of the indegree and outdegree of the graph?

Select one:
a. Indegree
b. Outdegree
c. Degree
d. None of the choices
Feedback

Your answer is correct.

Question 8
Correct
Mark 1 out of 1

Remove flag

Question text

Vertices with the same parent are called?

Select one:
a. None of the choices
b. Child
c. Siblings
d. Descendants
Feedback

Your answer is correct.

Question 9
Correct
Mark 1 out of 1

Remove flag

Question text

It is the maximum level of any vertex of the tree?

Select one:
a. None of the choices
b. Root
c. Height
d. Level
Feedback

Your answer is correct.

Question 10
Correct
Mark 1 out of 1

Flag question

Question text

How many edges can fully connect a graph with 4 vertices?

Select one:
a. None of the choices
b. 6
c. 5
d. 4
Feedback

Your answer is correct.

Finish review