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?

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

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

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.

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

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