When you use an index, you can store records on a ____ storage device.

The number of elements an array will hold is known as the ____ of the array.

When you derive a class from an existing class, you ________ add new data and functions.

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

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

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

What is the pre-order traversal equivalent of the following algebraic expression? [a+(b-c)]*[(d-e)/(f+g-h)]

What is the best definition of a collision in a hash table?

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

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

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