If node A has three siblings and B is parent of A, what is the degree of A?
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.
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
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
how can someone answer this question, probably 1 could be answer but nothing is mentioned that it's a graph or a tree and worst thing is that 1 is not given in options.
ISRO always gives ambiguous questions!
In tree the number of subtrees of a node is called the degree of the node.So degree of leaf node is 0.
In graph degree of a node is the total no node connected with it.(If it is graph then ans is 1)
For creating automatas you can also ...