M

Mr. Dubey • 52.30K Points
Coach 

Q. A binary tree of depth "d" is an almost complete binary tree if __________.

(A) each leaf in the tree is either at level.
(B) for any node.
(C) both a and b.
(D) None.
Correct : Option (C)

Share

Discusssion

Login to discuss.

Related MCQs

Q. Which-one ofthe following statements about normal forms is FALSE?

Q. Requesting node sending the requested data starting from the memory, and the requestor which has made the only sharing node, known as ________.

Q. The method of synchronising the processor with the I/O device in which the device sends a signal when it is ready is?

Q. Inflation is a loss in the purchasing power of money over time.

Q. The physical layer is concerned with the movement of _______ over the physical medium.

Q. A combinational logic circuit which sends data coming from a single source to two or more separate destinations is

Q. Data structure which is capable of expressing more complex relationship than that of physical adjacency is called______________.

Q. What is the length of an augmenting path?

Q. An example of a digital device can be

Q. For non sharable resources like a printer, mutual exclusion