McqMate

Q. |
## 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 |

Answer» B. Will always be zero |

1.3k

0

Do you find this helpful?

1

View all MCQs in

Data Structures (DS)No comments yet

- A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.
- With V(greater than 1) vertices, how many edges at most can a Directed Acyclic Graph possess?
- …………………. Is a directed tree in which outdegree of each node is less than or equal to two.
- A directed graph is ………………. if there is a path from each vertex to every other vertex in the digraph.
- A vertex of in-degree zero in a directed graph is called a/an
- If a simple graph G, contains n vertices and m edges, the number of edges in the Graph G'(Complement of G) is
- A graph is a tree if and only if graph is
- What is the maximum number of edges in a bipartite graph having 10 vertices?
- Maximum degree in any vector in a graph with n vertices is ________.
- If we implement heap as min-heap, deleting root node (value 1)from the heap. What would be the value of root node after second iteration if leaf node (value 100) is chosen to replace the root at start.