Exam 17: Stacks and Queues

What is the output of the following code? queueType<int> queue; Int x,y; x = 2; y = 6; queue.addQueue(x); queue.addQueue(y); x = queue.front(); queue.deleteQueue(); queue.addQueue(x + 2); queue.addQueue(x); queue.addQueue(y - 3); while (!queue.isEmptyQueue()) { cout << queue.front()<< " "; queue.deleteQueue(); } cout << endl;

(Multiple Choice)

4.9/5

(33)

Question 21

Popping an element from an empty stack is called ____.

(Multiple Choice)

4.8/5

(29)

Question 22

What is the output of the following code? queueType<int> queue; Int x,y; x = 2; y = 3; queue.addQueue(x); queue.addQueue(y); x = queue.front(); queue.deleteQueue(); queue.addQueue(x + 2); queue.addQueue(x); queue.addQueue(y - 3); y = queue.front(); queue.deleteQueue(); cout << "x = " << x << endl; cout << "y = " << y << endl;

(Multiple Choice)

4.8/5

(38)

Question 23

In the linked implementation of stacks,the stack is ____________________ only if you run out of memory space.

(Short Answer)

5.0/5

(39)

Question 24

The postfix expression 2 4 6 * + 15 - 21 7 / + = evaluates to ____.

(Multiple Choice)

4.8/5

(41)

Question 25

In a queuing system,we use a(n)____________________ variable to set the status of the server.

(Short Answer)

4.8/5

(31)

Question 26

In the array representation of a stack,if a value called stackTop indicates the number of elements in the stack,then stackTop-1 points to the top item of the stack.

(True/False)

4.9/5

(37)

Question 27

When describing a queuing system,we use the term ____________________ time to refer to the time it takes to serve a customer.

(Short Answer)

4.7/5

(27)

Question 28

You can perform the add operation,called ____,to add an element onto the stack.

(Multiple Choice)

4.9/5

(35)

Question 29

The elements at the ____________________ of a stack have been in the stack the longest.

(Short Answer)

4.8/5

(44)

Question 30

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

(Multiple Choice)

4.7/5

(35)

Question 31

Postfix notation requires the use of parentheses to enforce operator precedence.

(True/False)

4.9/5

(36)

Question 32

The expression a + b is the same in both infix notation and postfix notation.

(True/False)

4.8/5

(31)

Question 33

In a(n)____________________ array,the first array position immediately follows the last array position.

(Short Answer)

4.8/5

(38)

Question 34

In evaluating a postfix expression,when an equal sign (=)is encountered,how many elements must the stack contain so that no error is generated?

(Multiple Choice)

4.7/5

(42)

Question 35

A stack is a(n)____ data structure.

(Multiple Choice)

4.9/5

(42)

Question 36

The infix expression (a + b)* (c - d / e)+ f is equivalent to the postfix expression ab + cde /-* f +

(True/False)

4.9/5

(39)

Question 37

A(n)____________________ system consists of servers and queues of objects waiting to be served.

(Short Answer)

4.9/5

(38)

Question 38

An array is a(n)____________________ access data structure.

(Short Answer)

4.8/5

(39)

Question 39

In the array representation of a stack,an unlimited number of elements can be pushed onto the stack.

(True/False)

4.9/5

(26)

Question 40

Showing 21 - 40 of 50

Popping an element from an empty stack is called ____.

In the linked implementation of stacks,the stack is ____________________ only if you run out of memory space.

The postfix expression 2 4 6 * + 15 - 21 7 / + = evaluates to ____.

In a queuing system,we use a(n)____________________ variable to set the status of the server.

In the array representation of a stack,if a value called stackTop indicates the number of elements in the stack,then stackTop-1 points to the top item of the stack.

When describing a queuing system,we use the term ____________________ time to refer to the time it takes to serve a customer.

You can perform the add operation,called ____,to add an element onto the stack.

The elements at the ____________________ of a stack have been in the stack the longest.

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

Postfix notation requires the use of parentheses to enforce operator precedence.

The expression a + b is the same in both infix notation and postfix notation.

In a(n)____________________ array,the first array position immediately follows the last array position.

In evaluating a postfix expression,when an equal sign (=)is encountered,how many elements must the stack contain so that no error is generated?

A stack is a(n)____ data structure.

The infix expression (a + b)* (c - d / e)+ f is equivalent to the postfix expression ab + cde /-* f +

A(n)____________________ system consists of servers and queues of objects waiting to be served.

An array is a(n)____________________ access data structure.

In the array representation of a stack,an unlimited number of elements can be pushed onto the stack.

An Overview of Computers and Programming Languages

Basic Elements of C++

Input/Output

Control Structures I (Selection)

Control Structures II (Repetition)

User-Defined Functions

User-Defined Simple Data Types, Namespaces, and the string Type

Arrays and Strings

Records (structs)

Classes and Data Abstraction

Inheritance and Composition

Pointers, Classes, Virtual Functions, Abstract Classes, and Lists

Overloading and Templates

Exception Handling

Recursion

Linked Lists

Searching and Sorting Algorithms

Binary Trees

Graphs

Standard Template Library (STL)

Filters