The recurrence relation T(n)=mT(n/2)+an2 is satisfied by___

Consider the node of a complete binary tree whose value is stored in data[i] for an array implementation. If this node has a right child, where will the right child's value be stored (the array's first index is 0)?

In a complete binary tree, the parent of any node k can be determined by ________.

Consider a linked list of n elements which is pointed by an external pointer. What is the time taken to delete the element which is a successor of the pointed element by a given pointer?

Suppose X is a B-tree leaf containing 41 entries and has at least one sibling. Which of the statements would be true in this case?

In a complete binary tree of n nodes, how far are the most distant two nodes? Assume each in the path counts 1. Assume log(n) is log base 2.

You use the ________ operator to access members of an object.

The sequential search algorithm uses a(n) ____ variable to track whether the item is found.

When you search through a list from one end to the other, you are performing a ____.

Tcp messages are called ________.

Java uses ________ to reference the current object.