+1 vote
in Data Structures & Algorithms I by (88.2k points)
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 Answer

+1 vote
by (737k points)
selected by
Best answer
Correct answer is (b) Will always be zero

Explanation: Every Directed Acyclic Graph has a source and a sink vertex.

Related questions

Welcome to TalkJarvis QnA, a question-answer community website for the people by the people. On TalkJarvis QnA you can ask your doubts, curiosity, questions and whatever going in your mind either related to studies or others. Experts and people from different fields will answer.