FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 17: Stacks and Queues

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 1

Multiple Choice

Review LaterAdd Note

Review Later

When a stack is implemented as an array,the array is empty if the value of stackTop is ____.

A) zero
B) one
C) nonzero
D) equal to the size of the array

Correct Answer

verified

Show Answer

Question 2

Multiple Choice

Review LaterAdd Note

Review Later

The ____ element of the stack is the last element added to the stack.

A) top
B) bottom
C) head
D) tail

Correct Answer

verified

Show Answer

Question 3

Multiple Choice

Review LaterAdd Note

If you try to add a new item to a full stack,the resulting condition is called a(n) ____.

In the linked implementation of stacks,the memory to store the stack elements is allocated statically.

The postfix expression 3 5 + 2 ; 6 - = will generate an error,because it ____.

The ____________________ constructor is called when a stack object is passed as a (value)parameter to a function.

In the late 1950s,the Australian philosopher and early computer scientist Charles L.Hamblin proposed a scheme in which the operators follow the operands (postfix operators),resulting in the ____________________ notation.

The ____________________ elements of a stack and queue should not be accessed directly.

The postfix expression 14 2 5 + = will generate an error,because ____.

____________________ techniques are used when it is too expensive or dangerous to experiment with real systems.

What is the output of the following code? stackType<int> stack; Int x,y; x = 5; y = 3; stack.push(4) ; stack.push(x) ; stack.push(x + 1) ; y = stack.top() ; stack.pop() ; stack.push(x + y) ; x = stack.top() ; stack.pop() ; cout << "x = " << x << endl; cout << "y = " << y << endl;

The default constructor for the linked implementation of a stack initializes the stack to an empty state when a stack object is declared.

A queue is a data structure in which the elements are ____.

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

The postfix expression 5 6 + 4 * 10 5 / - = evaluates to ____.

The addition and deletion of elements of the stack occurs only at the ____ of the stack.

The bottom element of the stack is the last element added to the stack.

A stack can be implemented as either an array or a(n) ____ structure.

What is the output of the following code? stackType<int> stack; Int x,y; x = 4; y = 2; stack.push(6) ; stack.push(x) ; stack.push(x + 1) ; y = stack.top() ; stack.pop() ; stack.push(x + y) ; x = stack.top() ; stack.pop() ; cout << "x = " << x << endl;

A technique in which one system models the behavior of another system is called ____.