Data-Structures

Question 259

If node A has three siblings and B is a parent of A, what is the degree of A?

A	0
B	3
C	4
D	None of the above

Data-StructuresGraphsISRO CS 2011Video-Explanation

Question 259 Explanation:

The degree of a vertex of a graph is the number of edges incident to the vertex, and in a multigraph, loops are counted twice.
According to question, there is no information regarding children nodes of node “A”. So the degree of A is 0.

Correct Answer: D

Question 259 Explanation:

The degree of a vertex of a graph is the number of edges incident to the vertex, and in a multigraph, loops are counted twice.
According to question, there is no information regarding children nodes of node “A”. So the degree of A is 0.

GAURAV GUPTA

I never give up until I achieve

Heap-Tree

Data-Structures

Heap-Tree

Data-Structures

Data-Structures

GAURAV GUPTA