Exam 18: Stacks and Queues

In the following code, assume the myStack object is a stack that can hold integers, and that value is an int variable. (The lines are numbered for reference purposes.) Assume that the pop function, called in line 4, stores the number popped from the stack in the value variable. What will the statement in line 5 display?

Data structures that can dynamically store elements and can grow and shrink in size are:

In the following code, assume the myStack object is a stack that can hold integers, and that value is an int variable. (The lines are numbered for reference purposes.) Assume that the pop function, called in lines 4, 5, and 6, stores the number popped from the stack in the value variable. What will the statement in line 7 display?

A dynamic stack may be implemented as a(n)________, and expand or shrink with each push or pop operation.

The following statement: Indicates:

This is a double-ended queue.

The pop function in the stack template of the STL does not retrieve the value from the top of the stack.