Question 1

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

Accepted Answer

A)   it contains an illegal operator
B)   it does not have enough operands
C)   it has too many operators
D)   there will be too many elements in the stack when the equal sign is encounteredE) None of the above
F) All of the above

Question 2

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

Accepted Answer

A)   client
B)   server
C)   customer
D)   providerE) A) and B)
F) None of the above

Question 3

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

Accepted Answer

A) True 
 B)False

Question 4

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

Accepted Answer

The answer of The ____________________ constructor is called when a...

Question 5

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

Accepted Answer

A)   top
B)   bottom
C)   head
D)   tailE) A) and C)
F) C) and D)

Question 6

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

Accepted Answer

The answer of The ____________________ elements of a stack and...

Question 7

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

Accepted Answer

A)   10
B)   30
C)   42
D)   44E) None of the above
F) B) and C)

Question 8

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

Accepted Answer

A)   imitation
B)   recursion
C)   simulation
D)   stimulationE) All of the above
F) None of the above

Question 9

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

Accepted Answer

Simulation...

Question 10

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.

Accepted Answer

Reverse Po...

Question 11

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;

Accepted Answer

A)   x = 4
B)   x = 5
C)   x = 6
D)   x = 9E) A) and B)
F) B) and D)

Question 12

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

Accepted Answer

A) True 
 B)False

Question 13

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;

Accepted Answer

A)   x = 5y = 6
B)   x = 4y = 3
C)   x = 5y = 3
D)   x = 11y = 6E) C) and D)
F) A) and C)

Question 14

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

Accepted Answer

A)   zero
B)   one
C)   nonzero
D)   equal to the size of the arrayE) A) and B)
F) All of the above

Question 15

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

Accepted Answer

A)   added to the rear and deleted from the front
B)   added to and deleted from the rear
C)   added to and deleted from the front
D)   added and deleted in the middleE) C) and D)
F) B) and C) A

Question 16

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

Accepted Answer

A)   mapped
B)   nested
C)   queued
D)   linkedE) C) and D)
F) B) and D)

Question 17

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

Accepted Answer

A)   contains an illegal operator
B)   does not have enough operands
C)   has too many operands
D)   has too many operatorsE) None of the above
F) A) and B) A

Question 18

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

Accepted Answer

A)   head
B)   bottom
C)   top
D)   middleE) B) and C)
F) C) and D)

Question 19

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

Accepted Answer

A)   override
B)   overflow
C)   overload
D)   underflowE) A) and B)
F) B) and D) B

Question 20

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

Accepted Answer

A) True 
 B)False

Exam 17: Stacks and Queues

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedSimulation...View AnswerShow Answer

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.

Correct AnswerverifiedReverse Po...View AnswerShow Answer

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;

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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;

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedA

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedA

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

Correct AnswerverifiedShow Answer

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

Correct AnswerverifiedB

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

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
Simulation...
View Answer

Correct Answer
verified
Reverse Po...
View Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified
A

Correct Answer
verified

Correct Answer
verified
A

Correct Answer
verified

Correct Answer
verified
B

Correct Answer
verified