Exam 3: Testing and Debugging

In the Java API, class java.util.Stack<E> implements a stack; there is no stack interface.

The implementation of the Stack ADT as an extension of Vector is a good choice because all the Vector methods are accessible.

The ListStack class is said to be a(n) ____________________ class because it adapts the methods available in another class (List) to the interface its clients expect by giving different names to essentially the same operations.

A(n) ____________________ is a data structure with the property that only the top element is accessible.

There is only one stack interface in Java.

The storage policy used by a stack is ____.

The ____________________ class implements a growable array of objects. Like an ArrayList, it contains components that can be accessed using an integer index.

An alternative to implementing a stack as an extension of Vector is to write a class that has a(n) ____ component.

Rewrite the following as an infix expression: 5 6 * 10 -

The method ____ returns the position of the character argument in the string.

The Java API includes a Stack class as part of the package java.util. This class is declared as follows:

The array data field can be used for storage of a stack instead of using Java's ArrayList class.

A(n) ____________________ is a data structure in which objects are inserted into and removed from the same end.

In terms of efficiency, all stack operations using an array structure are ____________________.

Which of the following is a balanced expression?

A(n) ____________________ is a string that reads the same in either dierection: left to right or right to left.

In a(n) ____________________, the top element is the data value that was most recently stored.

The value of the following postfix expression is ___________________. 1 2 + 4 * 3 +

The easiest approach to implementing a stack in Java would be to give it a(n) ____ component for storing the data.

Rewrite the following in infix form: x1 2.5 count * 3 / +