COMPUTER SCIENCE AND ENGINEERING
COMPILER DESIGN
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?
|
|
Depends on a Graph
|
|
|
Will always be zero
|
|
|
Will always be greater than zero
|
|
|
May be zero or greater than zero
|
Explanation:
Detailed explanation-1: -DAG with Single Node : Here both in-degree and out degree are zero. So sum of minimum in-degree and maximum out-degree of an Directed Acyclic Graph is 0.
There is 1 question to complete.