What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?

Category: QuestionsWhat is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?
Editor">Editor Staff asked 2 months ago

What is the value of the sum of the minimum in-degree and maximum out-degree of an Directed Acyclic Graph?
 
(a) Depends on a Graph
 
(b) Will always be zero
 
(c) Will always be greater than zero
 
(d) May be zero or greater than zero
 
The above asked question is from Directed Acyclic Graph topic in section Graph of Data Structures & Algorithms I
 
I have been asked this question during an internship interview.

1 Answers
Editor">Editor Staff answered 2 months ago

Correct answer is (b) Will always be zero
 
Explanation: Every Directed Acyclic Graph has a source and a sink vertex.