ISRO2011-19

Question

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

• A. 0
• B. 3
• C. 4
• D. 5

Comments

The given information is not sufficient.

Answer 1

Now coming to question if node $A$ has three siblings and $B$ is the parent of $A$. This is the only information given.

It is not given whether node $A$ is an internal node or leaf node and also total number of node in the graph is not given.

So given information is not sufficient to decide what should be the degree of node $A$.

So the degree of node $A$ can be any of the above.

Comments

now ya i also think same Arjun sir(Missing Data)

---

Since B is parent of A, the degree of A can be anything but 0 (zero). So I guess the question is printed wrong and it must be asking "Which can't be degree of node A'

---

But I can see only two siblings of node A in your diagram?

Answer 2

Answer : A

A/c to given condition B is parent of A and A has 3 Siblings.Degree of A would be 0

            

Without any assumptions Answer is matching with option A

Comments

Degree of A is 1 in ur example, not 0

Answer 3

Answer : A

Here is the Explanation : https://gateoverflow.in/50582/node-has-three-siblings-and-is-parent-of-what-is-the-degree-of

Answer 4

I think Answer is A

Node "A" has 3 siblings and B is parent of A.

A is child of B.

There is no children for A

So, A must me leaf node

Degree of leaf node is 0

    

Comments

if graph is directed then leaf node degree is 0, bt here nothing maintion