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.) 1: myStack.push(0); 2: myStack.push(1); 3: myStack.push(2); 4: myStack.pop(value); 5: myStack.pop(value); 6: myStack.pop(value); 7: cout << value << endl; 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?

This is a container that provides quick access to elements at the front and the back of the list.

In the following code, assume the myQueue object is a queue that can hold integers, and that value is an int variable. (The lines are numbered for reference purposes.) 1: myQueue.enqueue(0); 2: myQueue.enqueue(1); 3: myQueue.enqueue(2); 4: myQueue.dequeue(value); 5: myQueue.dequeue(value); 6: myQueue.dequeue(value); 7: cout << value << endl; Assume that the dequeue function, called in lines 4, 5, and 6, stores the number removed from the queue in the value variable. What will the statement in line 7 display?

In the following code, assume the myQueue object is a queue that can hold integers, and that value is an int variable. (The lines are numbered for reference purposes.) 1: myQueue.enqueue(0); 2: myQueue.enqueue(1); 3: myQueue.enqueue(2); 4: myQueue.dequeue(value); 5: myQueue.enqueue(3); 6: myQueue.dequeue(value); 7: cout << value << endl; Assume that the dequeue function, called in lines 4, and 6, stores the number removed from the queue in the value variable. What will the statement in line 7 display?

A __________ stack or queue is built around the linked-list.

The programmer must declare in advance the size of a dynamic stack or queue.

In an dequeue operation, the element at the __________ of the queue is removed.

The first item placed onto a stack is always the last item removed from the stack.

Stacks are useful data structures for algorithms that work ___________ with the _________ saved element in the series.

The _______ operation allows an item to be stored on a stack.

When an element is added to a queue, it is added to the rear. When an element is removed, it is removed from the

A dynamic stack has a ___________ size, and is implemented as a(n) ________

Stacks and queues can be implemented as arrays or linked lists.

A dynamic queue can be implemented as a

A practical application of the stack data type in a computer system is:

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

Endeque and deque are the two most common queue operations.

A __________ is processed in a manner similar to customers standing in a grocery check-out line -- the first customer in line is the first served.

A dynamic stack starts as an empty linked list.

The queue data structure is commonly applied in connection with: