Question 1

When using a circular array implementation for a queue, when either pointer is about to run off the end of the array, that pointer is reset to -1.

Accepted Answer

A) True 
 B)False  False

Question 2

When using a circular array implementation for a queue, during the add operation, the front pointer moves ahead of the rear pointer.

Accepted Answer

A) True 
 B)False  False

Question 3

When items are added to a priority queue, they are assigned an order of rank.

Accepted Answer

A) True 
 B)False  True

Question 4

What can you do if items in a priority queue cannot use the comparison operators?

Accepted Answer

A)  user a wrapper class 
B)  remove them from the queue 
C)  remove them in FIFO order 
D)  put them in the back of the queue 
A)  user a wrapper class 
B)  remove them from the queue 
C)  remove them in FIFO order 
D)  put them in the back of the queue

Question 5

In a priority queue, items waiting in the queue the longest are always popped next.

Accepted Answer

A) True 
 B)False

Question 6

The ready queue contains processes waiting to use the CPU.

Accepted Answer

A) True 
 B)False

Question 7

A checkout line at a grocery store is an example of a queue.

Accepted Answer

A) True 
 B)False

Question 8

An example of a computer simulation that can use queues is traffic flow on a busy highway.

Accepted Answer

A) True 
 B)False

Question 9

In computer science, process scheduling can be handled by simple or priority queues.

Accepted Answer

A) True 
 B)False

Question 10

In the array implementation of a queue, the pop operation is most efficient if the front of the queue is fixed at index position 0.

Accepted Answer

A) True 
 B)False

Question 11

In the supermarket simulation, which of the following would be a property of a Cashier object?

Accepted Answer

A)  assigns customers to cashiers 
B)  a queue of customer objects 
C)  a variable to track when service is received 
D)  generates new customer objects 
A)  assigns customers to cashiers 
B)  a queue of customer objects 
C)  a variable to track when service is received 
D)  generates new customer objects

Question 12

Which of the following is NOT true of a priority queue?

Accepted Answer

A)  higher-priority items are popped before those of lower priority 
B)  items of equal priority are popped in LIFO order 
C)  items of equal priority are popped according to which item arrived first 
D)  higher-priority items can jump ahead of lower-priority items 
A)  higher-priority items are popped before those of lower priority 
B)  items of equal priority are popped in LIFO order 
C)  items of equal priority are popped according to which item arrived first 
D)  higher-priority items can jump ahead of lower-priority items

Question 13

In a priority queue, what does the add method do when handling a new item and the new item is greater than or equal to the item at the rear?

Accepted Answer

A)  it adds the item to the front 
B)  it puts the item in a wrapper 
C)  it adds the item to the rear 
D)  it increases the size of the queue 
A)  it adds the item to the front 
B)  it puts the item in a wrapper 
C)  it adds the item to the rear 
D)  it increases the size of the queue

Question 14

When items are removed from a priority queue, items of lower priority are removed before those of higher priority.

Accepted Answer

A) True 
 B)False

Question 15

Which of the following is true about a standard queue?

Accepted Answer

A)  the item that has been waiting the shortest is popped next 
B)  the items are popped in LIFO order 
C)  the item that has been waiting the longest is popped next 
D)  removals are done from the rear of the queue 
A)  the item that has been waiting the shortest is popped next 
B)  the items are popped in LIFO order 
C)  the item that has been waiting the longest is popped next 
D)  removals are done from the rear of the queue

Question 16

The add operation for a queue adds a node at the head of the structure.

Accepted Answer

A) True 
 B)False

Question 17

Which of the following is NOT true of a priority queue?

Accepted Answer

A)  when items are added, they are assigned an order of rank 
B)  items of higher priority are removed before those of lower priority 
C)  items of higher priority are removed in FIFO order 
D)  items of equal priority are removed in FIFO order 
A)  when items are added, they are assigned an order of rank 
B)  items of higher priority are removed before those of lower priority 
C)  items of higher priority are removed in FIFO order 
D)  items of equal priority are removed in FIFO order

Question 18

Simulation programs can use a range of integer values to mimic variability in the simulation.

Accepted Answer

A) True 
 B)False

Question 19

What must occur when a wrapped item is accessed with the peek or pop method in a priority queue?

Accepted Answer

A)  it must be added to the priority queue 
B)  it must be unwrapped 
C)  it must be compared to the next item 
D)  it must be discarded 
A)  it must be added to the priority queue 
B)  it must be unwrapped 
C)  it must be compared to the next item 
D)  it must be discarded

Question 20

In a linked implementation of a queue, what does the add operation do?

Accepted Answer

A)  adds a node to the head 
B)  adds a node to the tail 
C)  inserts a node in the middle 
D)  creates a new instance of the queue 
A)  adds a node to the head 
B)  adds a node to the tail 
C)  inserts a node in the middle 
D)  creates a new instance of the queue

When using a circular array implementation for a queue, when either pointer is about to run off the end of the array, that pointer is reset to -1.

When using a circular array implementation for a queue, during the add operation, the front pointer moves ahead of the rear pointer.

When items are added to a priority queue, they are assigned an order of rank.

What can you do if items in a priority queue cannot use the comparison operators?

In a priority queue, items waiting in the queue the longest are always popped next.

The ready queue contains processes waiting to use the CPU.

A checkout line at a grocery store is an example of a queue.

An example of a computer simulation that can use queues is traffic flow on a busy highway.

In computer science, process scheduling can be handled by simple or priority queues.

In the array implementation of a queue, the pop operation is most efficient if the front of the queue is fixed at index position 0.

In the supermarket simulation, which of the following would be a property of a Cashier object?

Which of the following is NOT true of a priority queue?

In a priority queue, what does the add method do when handling a new item and the new item is greater than or equal to the item at the rear?

When items are removed from a priority queue, items of lower priority are removed before those of higher priority.

Which of the following is true about a standard queue?

The add operation for a queue adds a node at the head of the structure.

Which of the following is NOT true of a priority queue?

Simulation programs can use a range of integer values to mimic variability in the simulation.

What must occur when a wrapped item is accessed with the peek or pop method in a priority queue?

In a linked implementation of a queue, what does the add operation do?

Basic Python Programming

An Overview of Collections

Searching, Sorting, and Complexity Analysis

Arrays and Linked Structures

Interfaces, Implementations, and Polymorphism

Inheritance and Abstract Classes

Stacks

Lists

Trees

Sets and Dictionaries

Graphs

Filters

Exam 8: Queues

When using a circular array implementation for a queue, when either pointer is about to run off the end of the array, that pointer is reset to -1.

When using a circular array implementation for a queue, during the add operation, the front pointer moves ahead of the rear pointer.

When items are added to a priority queue, they are assigned an order of rank.

What can you do if items in a priority queue cannot use the comparison operators?

In a priority queue, items waiting in the queue the longest are always popped next.

The ready queue contains processes waiting to use the CPU.

A checkout line at a grocery store is an example of a queue.

An example of a computer simulation that can use queues is traffic flow on a busy highway.

In computer science, process scheduling can be handled by simple or priority queues.

In the array implementation of a queue, the pop operation is most efficient if the front of the queue is fixed at index position 0.

In the supermarket simulation, which of the following would be a property of a Cashier object?

Which of the following is NOT true of a priority queue?

In a priority queue, what does the add method do when handling a new item and the new item is greater than or equal to the item at the rear?

When items are removed from a priority queue, items of lower priority are removed before those of higher priority.

Which of the following is true about a standard queue?

The add operation for a queue adds a node at the head of the structure.

Which of the following is NOT true of a priority queue?

Simulation programs can use a range of integer values to mimic variability in the simulation.

What must occur when a wrapped item is accessed with the peek or pop method in a priority queue?

In a linked implementation of a queue, what does the add operation do?

Basic Python Programming

An Overview of Collections

Searching, Sorting, and Complexity Analysis

Arrays and Linked Structures

Interfaces, Implementations, and Polymorphism

Inheritance and Abstract Classes

Stacks

Lists

Trees

Sets and Dictionaries

Graphs

Filters