The minimum number of interchanges needed to convert the array 89,19,14,40,17,12,10,2,5,7,11,6,9,70 into a heap with the maximum element at the root is:

Suppose T is a complete binary tree with 14 nodes. What would be the minimum possible depth of T?

In which data structure do the insertion and deletion take place at the same end?

What is the formulae to find maximum number of nodes n in a perfect binary tree?

A chained hash table has an array size of 512. What is the maximum number of entries that can be placed in the table?

In which dynamically created linked list can the first node be recovered after moving to the second node?

Attaching structures end to end is called ____ structures.

Java.util.vector is a subtype of ________.

Arrays, unlike simple built-in types, are passed by ____.

A loop within another loop is known as a(n) ____ loop.

A loop must return to the ____ question at some later point in a structure.