Deck 7: Stacks

Question 1

You can use stacks to convert recursive algorithms into nonrecursive algorithms, especially recursive algorithms that are not tail recursive.

Answer 1

True

Question 2

A stack is a list of homogenous elements in which the addition and deletion of elements occurs only at one end.

Answer 2

True

Question 3

The computer uses a stack to implement function calls.

Answer 3

True

Question 4

The item added to the stack last will be the item removed last.

Question 5

The operation push removes the bottom element from the stack.

Question 6

The operation pop returns the top element of the stack.

Question 7

The operation top removes the top element of the stack.

Question 8

An element can be removed from the stack only if there is something in the stack, and an element can be added to the stack only if there is room.

Question 9

To successfully implement a stack, we need at least seven operations.

Question 10

Functions such as push and pop that are required to implement a stack are not inherently available to C++ programmers.

Question 11

An array is a random access data structure; a stack is not.

Question 12

Adding, or pushing, an element onto the stack is a two-step process.

Question 13

The function copyStack makes a copy of a stack.

Question 14

The time-complexity of the copyStack function is O(1).

Question 15

In a linked list implementation of a stack, only a fixed number of elements can be pushed onto the stack.

Question 16

If we compare the push function of the stack with the insertFirst function for general lists, we see that the algorithms to implement these operations are similar.

Question 17

The equivalent postfix expression for the infix expression a + b is + a b.

Question 18

The postfix expression 6 3 + 2 * = evaluates to 18.

Question 19

The postfix expression 2 3 + 1 * = evaluates to 8.

Question 20

In the function evaluateOpr, two operands are needed to evaluate an operation and operands are saved in the stack.

Question 21

Stacks can be used to print a list backwards without using recursion.

Question 22

The stack container class provides the operation size to return the actual number of elements in the stack.

Question 23

A data structure in which the elements are added and removed from one end only is known as a ____.

A) queue
B) deque
C) hash table
D) stack

Question 24

We can perform the operation ____ to retrieve the top element of the stack.

A) head
B) first
C) top
D) peek

Question 25

The operation ____ is used to remove the top element from the stack.

A) pop
B) push
C) peek
D) isEmpty

Question 26

The ____ operation checks whether the stack is full.

A) isEmpty
B) peek
C) pop
D) isFullStack

Question 27

The ____ operation checks whether the stack is empty.

A) isFullStack
B) isEmptyStack
C) peek
D) pop

Question 28

Because all the elements of a stack are of the same type, you can use a(n) ____ to implement a stack.

A) struct
B) array
C) record
D) class

Question 29

To remove, or pop, an element from the stack ____.

A) decrement stackTop by 1
B) increment stackTop by 1
C) invert stackTop
D) do nothing

Question 30

The stack is empty if stackTop is ____.

A) 0
B) NULL
C) 1
D) MAX

Question 31

The operation ____ reinitializes the stack to an empty state.

A) alloc
B) init
C) initializeStack
D) new

Question 32

The function ____ makes an identical copy of a stack.

A) readStack
B) buildStack
C) clearStack
D) copyStack

Question 33

A client's program can include a header file via the ____ statement.

A) pragma
B) include
C) using
D) matching

Question 34

The class linkedListType is a(n) ____ class and therefore does not implement all the operations.

A) derived
B) partial
C) abstract
D) generic

Question 35

In ____ notation, the operator is written between the operands.

A) infix
B) postfix
C) prefix
D) nofix

Question 36

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.

A) Inverse Polish
B) Inverted Roman
C) Reverse Polish
D) Reverse Arabic

Question 37

If the postfix expression is error free, the function ____ outputs the result.

A) printResult
B) pop
C) push
D) readResult

Question 38

The function ____, if possible, evaluates the expression and leaves the result in the stack.

A) printResult
B) clearStack
C) readExpression
D) evaluateExpression

Question 39

The function evaluateExpression evaluates each ____ expression.

A) prefix
B) postfix
C) previsit
D) inverted

Question 40

The function ____ (if possible) evaluates an expression.

A) evaluateOpr
B) evaluateOperand
C) evaluateExpression
D) evaluateAll

Question 41

The function ____ is called whenever an error is discovered in the expression.

A) clearExp
B) discardExp
C) newExp
D) evaluateExp

Question 42

The function discardExp reads and writes the input data only until the input is '____'.

A) ;
B) *
C) +
D) =

Question 43

If the postfix expression contains no errors, the function ____ prints the result.

A) printResult
B) evaluateExpression
C) clearExp
D) evaluateOpr

Question 44

The ____ can be used to determine whether two stacks are identical.

A) rational operator
B) logical operator
C) relational operator
D) arithmetic operator