A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.

M

Mr. Dubey • 52.30K Points
Coach

Q. A …………… is an acyclic digraph, which has only one node with indegree 0, and other nodes have in-degree 1.

(A) directed tree

(B) undirected tree

(C) dis-joint tree

(D) direction oriented tree

Correct : Option (A)

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. User datagram protocol is called connectionless because:

Q. Resident is an individual who has resided in India for a period or periods amounting in all to days or more in the twelve months immediately preceding

Q. Which of the following is NOT a namespace in the .NET Framework Class Library?

Q. As per Cooperation, Not individualism principle of management, Competition should be replaced with………………..

Q. ] test[1] = 'D' del test[2] print(len(test))

Q. Which of the following IM client allow their users to connect to the different major IM services?

Q. Ten TTL loads per TTL driver is known as:

Q. Virtualization allows sharing the resources of hardware across multiple a environments.

Q. Which of the following is the future application of IoT?

Q. Which one of the following is a real time operating system?