Question 1

Give two examples of run-time errors or exceptions that may occur when we enqueue or dequeue.

Accepted Answer

It's an error to attempt to dequeue from an empty queue.Also,if the queue is represented as an array and we try to enqueue,we may run up against the maximum size of the queue.

Question 2

The ______ operation retrieves the item that was added earliest to a queue,but does not remove that item.

Accepted Answer

A) enqueue 
B) dequeue 
C) dequeueAll 
D) peek 
A) enqueue 
B) dequeue 
C) dequeueAll 
D) peek D

Question 3

Operations on a queue can be carried out at ______.

Accepted Answer

A) its front only 
B) its back only 
C) both its front and back 
D) any position in the queue 
A) its front only 
B) its back only 
C) both its front and back 
D) any position in the queue C

Question 4

In an event-driven simulation of a bank,which of the following is an internal event?

Accepted Answer

A) the arrival at the bank of a new customer 
B) the start of the transaction of a customer 
C) the end of the transaction of a customer 
D) the departure from the bank of a customer 
A) the arrival at the bank of a new customer 
B) the start of the transaction of a customer 
C) the end of the transaction of a customer 
D) the departure from the bank of a customer

Question 5

To initialize a queue that is represented by a circular array,back is set to ______.

Accepted Answer

A) 0 
B) 1 
C) MAX_QUEUE 
D) MAX_QUEUE - 1 
A) 0 
B) 1 
C) MAX_QUEUE 
D) MAX_QUEUE - 1

Question 6

In an event-driven simulation of a bank,the departure times of customers are determined by the simulation.

Accepted Answer

A) True 
 B)False

Question 7

A reference-based implementation of a queue that uses a circular linked list would need at least ______ external references.

Accepted Answer

A) one 
B) two 
C) three 
D) four 
A) one 
B) two 
C) three 
D) four

Question 8

A queue can be used to preserve the order of occurrences.

Accepted Answer

A) True 
 B)False

Question 9

Which of the following code fragments is used to delete the item at the front of a queue represented by a circular array?

Accepted Answer

A) front = MAX_QUEUE - front;
--count; 
B) front = front - back;
--count; 
C) front = (front+1)% MAX_QUEUE;
--count; 
D) front = (back+1)% MAX_QUEUE;
--count; 
A) front = MAX_QUEUE - front;
--count; 
B) front = front - back;
--count; 
C) front = (front+1)% MAX_QUEUE;
--count; 
D) front = (back+1)% MAX_QUEUE;
--count;

Question 10

The Java ______ operator is used to obtain the wraparound effect of a circular array-based queue.

Accepted Answer

A) * 
B) + 
C) % 
D) / 
A) * 
B) + 
C) % 
D) /

Question 11

Define the problem of rightward drift in an array-based implementation of a queue.

Accepted Answer

Rightward drift is t

Question 12

If a queue is implemented as the ADT list,which of the following queue operations can be implemented as list.get(1)?

Accepted Answer

A) enqueue() 
B) dequeue() 
C) isEmpty() 
D) peek() 
A) enqueue() 
B) dequeue() 
C) isEmpty() 
D) peek()

Question 13

Which of the following methods of QueueInterface does NOT throw a QueueException?

Accepted Answer

A) enqueue 
B) dequeue 
C) dequeueAll 
D) peek 
A) enqueue 
B) dequeue 
C) dequeueAll 
D) peek

Question 14

What is the action performed by the peek operation?

Accepted Answer

The peek operation retrieves t

Question 15

In an event-driven simulation of a bank,which of the following equations can be used to determine the time of a customer's departure?

Accepted Answer

A) time of next departure = current time - arrival time 
B) time of next departure = time service begins + length of transaction 
C) time of next departure = arrival time + length of transaction 
D) time of next departure = current time - (arrival time + time service begins) 
A) time of next departure = current time - arrival time 
B) time of next departure = time service begins + length of transaction 
C) time of next departure = arrival time + length of transaction 
D) time of next departure = current time - (arrival time + time service begins)

Question 16

Which of the following is an operation of the ADT stack?

Accepted Answer

A) enqueue 
B) push 
C) add 
D) get 
A) enqueue 
B) push 
C) add 
D) get

Question 17

What is the advantage an implementation of a queue that uses the ADT list over an implementation that uses a linked list?

Accepted Answer

An implementation of a queue t

Question 18

To initialize a queue that is represented by a circular array,front is set to ______.

Accepted Answer

A) 0 
B) 1 
C) MAX_QUEUE 
D) MAX_QUEUE - 1 
A) 0 
B) 1 
C) MAX_QUEUE 
D) MAX_QUEUE - 1

Question 19

Which of the following ADTs is like a line of people?

Accepted Answer

A) list 
B) stack 
C) queue 
D) tree 
A) list 
B) stack 
C) queue 
D) tree

Question 20

Rightward drift is a problem that is encountered in a reference-based implementation of a queue.

Accepted Answer

A) True 
 B)False

Give two examples of run-time errors or exceptions that may occur when we enqueue or dequeue.

The ______ operation retrieves the item that was added earliest to a queue,but does not remove that item.

Operations on a queue can be carried out at ______.

In an event-driven simulation of a bank,which of the following is an internal event?

To initialize a queue that is represented by a circular array,back is set to ______.

In an event-driven simulation of a bank,the departure times of customers are determined by the simulation.

A reference-based implementation of a queue that uses a circular linked list would need at least ______ external references.

A queue can be used to preserve the order of occurrences.

Which of the following code fragments is used to delete the item at the front of a queue represented by a circular array?

The Java ______ operator is used to obtain the wraparound effect of a circular array-based queue.

Define the problem of rightward drift in an array-based implementation of a queue.

If a queue is implemented as the ADT list,which of the following queue operations can be implemented as list.get(1)?

Which of the following methods of QueueInterface does NOT throw a QueueException?

What is the action performed by the peek operation?

In an event-driven simulation of a bank,which of the following equations can be used to determine the time of a customer's departure?

Which of the following is an operation of the ADT stack?

What is the advantage an implementation of a queue that uses the ADT list over an implementation that uses a linked list?

To initialize a queue that is represented by a circular array,front is set to ______.

Which of the following ADTs is like a line of people?

Rightward drift is a problem that is encountered in a reference-based implementation of a queue.

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Linked Lists

Problem Solving With Abstract Data Types

Stacks

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Tables and Priority Queues

Advanced Implementations of Tables

Graphs

External Methods

Filters

Exam 8: Queues

Give two examples of run-time errors or exceptions that may occur when we enqueue or dequeue.

The ______ operation retrieves the item that was added earliest to a queue,but does not remove that item.

Operations on a queue can be carried out at ______.

In an event-driven simulation of a bank,which of the following is an internal event?

To initialize a queue that is represented by a circular array,back is set to ______.

In an event-driven simulation of a bank,the departure times of customers are determined by the simulation.

A reference-based implementation of a queue that uses a circular linked list would need at least ______ external references.

A queue can be used to preserve the order of occurrences.

Which of the following code fragments is used to delete the item at the front of a queue represented by a circular array?

The Java ______ operator is used to obtain the wraparound effect of a circular array-based queue.

Define the problem of rightward drift in an array-based implementation of a queue.

If a queue is implemented as the ADT list,which of the following queue operations can be implemented as list.get(1)?

Which of the following methods of QueueInterface does NOT throw a QueueException?

What is the action performed by the peek operation?

In an event-driven simulation of a bank,which of the following equations can be used to determine the time of a customer's departure?

Which of the following is an operation of the ADT stack?

What is the advantage an implementation of a queue that uses the ADT list over an implementation that uses a linked list?

To initialize a queue that is represented by a circular array,front is set to ______.

Which of the following ADTs is like a line of people?

Rightward drift is a problem that is encountered in a reference-based implementation of a queue.

Review of Java Fundamentals

Principles of Programming and Software Engineering

Recursion: the Mirrors

Data Abstraction: The Walls

Linked Lists

Problem Solving With Abstract Data Types

Stacks

Advanced Java Topics

Algorithm Efficiency and Sorting

Trees

Tables and Priority Queues

Advanced Implementations of Tables

Graphs

External Methods

Filters