Graph Theory Quiz

How many centers for a tree?

• One

• Two

• Three

• Either a or b

What is the maximum possible height of an n-vertex binary tree, if n=11?

• 2

• 3

• 4

• 5

What is the other name of spanning tree?

• Skeleton of G

• Scaffolding of G

• Maximal tree of Subgraph

• All the above

• Either a or b

In a directed tree, a ____ tree is one in which every node has an outdegree less than or equal to two?

• binary

• Partial binary

• Zero binary

• Non-binary

What is a unique node in a binary tree?

• Parent

• Left

• Right

• Root

When do we say leaf node?

• One child

• Two children

• Multiple

• No child

How is a node determined by its distance from the root?

• Depth

• Level

• Quantity

• Quality

What is the formula to find the maximum level of N nodes?

• N²

• 2^N

• 2^N-1

• 2^N-2

How the diagonal values of the graph's cost adjacency matrix?

• Zero

• One

• Five

• Infinite

Arrange the Step-by-step process to get the shortest path from the source vertex to all the vertices.

A.  Sets have no vertex at the beginning. In S, include the source vertex Vs.

B. You need to determine all the paths from Vs to all the other vertices without passing through any other vertices.

C. Find the shortest paths through the nearest vertex in S to all the other vertices and

update the values accordingly.

D.  Graphs with n vertices should be repeated until all n-1 vertices are excluded from S.

 

Select the order in which the process takes place?

• B > C > D > A

• A > B > C > D

• D > C > B > A

• A > B > D > C