The operation for adding an entry to a stack is traditionally called ________.

For a complete binary tree with depth d, the total number of nodes is:

Which of the following is false?

Which of the following applications may use a stack?

What is the value of the post-fix expression 6 3 2 4 + - *?

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:

Selection sort requires ________ passes to put n data items in order.

To describe a queuing system, we use the term ____ for the object that provides the service.

The priming read is an example of a(n) ____ task.

A ____ is a copy that is kept in case values need to be restored to their original state.

The maximum number of entry points that any programming structure can have is ____.