Question 1

Is it possible for the front and rear references in a circular array implementation to be equal?

Accepted Answer

Yes, it can happen under two circumstances: when the queue is empty, and when the queue is full.

Question 2

To add an element to a queue you use the____________________ method.

Accepted Answer

A)  push 
B)  enqueue 
C)  dequeue 
D)  pop 
A)  push 
B)  enqueue 
C)  dequeue 
D)  pop B

Question 3

Which implementation has the worst space complexity?

Accepted Answer

Both of the array implementations waste space for unfilled elements in the array. The linked implementation uses more space per element stored.

Question 4

Because queue operations modify both ends of the collection, fixing one end at index 0 eliminates the requirement that elements be shifted.

Accepted Answer

A) True 
 B)False

Question 5

Treating arrays as circular eliminates the need to shift elements in an array queue implementation.

Accepted Answer

A) True 
 B)False

Question 6

What are the 3 primary methods for a queue?______

Accepted Answer

enqueue, d

Question 7

The first operation removes an element at the front of the queue and returns a reference to it.

Accepted Answer

A) True 
 B)False

Question 8

A linked implementation of a queue is facilitated by references to the ______ and ______ elements of the linked list.

Accepted Answer

A)  First, second 
B)  First, middle 
C)  Middle, last 
D)  First, last 
A)  First, second 
B)  First, middle 
C)  Middle, last 
D)  First, last

Question 9

Which of the following operations of a queue examines the element at the front of the queue?

Accepted Answer

A)  Enqueue 
B)  isEmpty 
C)  size 
D)  first 
A)  Enqueue 
B)  isEmpty 
C)  size 
D)  first

Question 10

When an element is removed from a queue using the dequeue operation, that element is removed from the ____________ of the collection.

Accepted Answer

A)  Front 
B)  Rear 
C)  Middle 
D)  None of the above 
A)  Front 
B)  Rear 
C)  Middle 
D)  None of the above

Question 11

Queues operate as _______________.

Accepted Answer

A)  Last Out, First In 
B)  First In, First Out 
C)  Last In, First Out 
D)  None of the above 
A)  Last Out, First In 
B)  First In, First Out 
C)  Last In, First Out 
D)  None of the above

Question 12

The enqueue and dequeue operations work on opposite ends of the collection.

Accepted Answer

A) True 
 B)False

Question 13

When an element is added to a queue using the enqueue operation, that element is added to the ____________ of the collection.

Accepted Answer

A)  Front 
B)  Rear 
C)  Middle 
D)  None of the above 
A)  Front 
B)  Rear 
C)  Middle 
D)  None of the above

Question 14

A ______ implementation of a queue is the preferable array implementation because it does not require elements to be shifted.

Accepted Answer

The answer of A ______ implementation of a queue is...

Question 15

The enqueue and dequeue operations work on ______ ends of the collection.

Accepted Answer

The answer of The enqueue and dequeue operations work on...

Question 16

Which implementation has the worst time complexity?

Accepted Answer

The noncircular array implemen

Question 17

When one enqueue's an element to a queue, you add that element to the ____ of the queue.

Accepted Answer

The answer of When one enqueue's an element to a...

Question 18

What is the principle difference in behavior between a stack and a queue?

Accepted Answer

A)  a stack reverses order whereas a queue preserves order 
B)  a stack does nothing whereas a queue can preserve and reverse order 
C)  there is no difference 
D)  a stack preserves order whereas a queue reverses order 
A)  a stack reverses order whereas a queue preserves order 
B)  a stack does nothing whereas a queue can preserve and reverse order 
C)  there is no difference 
D)  a stack preserves order whereas a queue reverses order

Question 19

The shifting of elements in a noncircular array implementation creates an _______ complexity.

Accepted Answer

A)  O(1) 
B)  O(n) 
C)  O(nlogn) 
D)  O(logn) 
A)  O(1) 
B)  O(n) 
C)  O(nlogn) 
D)  O(logn)

Question 20

When utilizing a circular array for a queue, complete the line of code that updates the value of rear to wrap around the end of the array to the front?

Accepted Answer

Rear = (Rear + 1 % q

Is it possible for the front and rear references in a circular array implementation to be equal?

To add an element to a queue you use the____________________ method.

Which implementation has the worst space complexity?

Because queue operations modify both ends of the collection, fixing one end at index 0 eliminates the requirement that elements be shifted.

Treating arrays as circular eliminates the need to shift elements in an array queue implementation.

What are the 3 primary methods for a queue?______

The first operation removes an element at the front of the queue and returns a reference to it.

A linked implementation of a queue is facilitated by references to the and elements of the linked list.

Which of the following operations of a queue examines the element at the front of the queue?

When an element is removed from a queue using the dequeue operation, that element is removed from the ____________ of the collection.

Queues operate as _______________.

The enqueue and dequeue operations work on opposite ends of the collection.

When an element is added to a queue using the enqueue operation, that element is added to the ____________ of the collection.

A ______ implementation of a queue is the preferable array implementation because it does not require elements to be shifted.

The enqueue and dequeue operations work on ______ ends of the collection.

Which implementation has the worst time complexity?

When one enqueue's an element to a queue, you add that element to the ____ of the queue.

What is the principle difference in behavior between a stack and a queue?

The shifting of elements in a noncircular array implementation creates an _______ complexity.

When utilizing a circular array for a queue, complete the line of code that updates the value of rear to wrap around the end of the array to the front?

Introduction

Analysis of Algorithms

Introduction to Collections - Stacks

Linked Structures - Stacks

Lists

Iterators

Recursion

Searching and Sorting

Trees

Binary Search Trees

Heaps and Priority Queues

Sets and Maps

Multi-Way Search Trees

Graphs

UML

Object-Oriented Design

Filters

Exam 5: Queues

Is it possible for the front and rear references in a circular array implementation to be equal?

To add an element to a queue you use the____________________ method.

Which implementation has the worst space complexity?

Because queue operations modify both ends of the collection, fixing one end at index 0 eliminates the requirement that elements be shifted.

Treating arrays as circular eliminates the need to shift elements in an array queue implementation.

What are the 3 primary methods for a queue?______

The first operation removes an element at the front of the queue and returns a reference to it.

A linked implementation of a queue is facilitated by references to the ______ and ______ elements of the linked list.

Which of the following operations of a queue examines the element at the front of the queue?

When an element is removed from a queue using the dequeue operation, that element is removed from the ____________ of the collection.

Queues operate as _______________.

The enqueue and dequeue operations work on opposite ends of the collection.

When an element is added to a queue using the enqueue operation, that element is added to the ____________ of the collection.

A ______ implementation of a queue is the preferable array implementation because it does not require elements to be shifted.

The enqueue and dequeue operations work on ______ ends of the collection.

Which implementation has the worst time complexity?

When one enqueue's an element to a queue, you add that element to the ____ of the queue.

What is the principle difference in behavior between a stack and a queue?

The shifting of elements in a noncircular array implementation creates an _______ complexity.

When utilizing a circular array for a queue, complete the line of code that updates the value of rear to wrap around the end of the array to the front?

Introduction

Analysis of Algorithms

Introduction to Collections - Stacks

Linked Structures - Stacks

Lists

Iterators

Recursion

Searching and Sorting

Trees

Binary Search Trees

Heaps and Priority Queues

Sets and Maps

Multi-Way Search Trees

Graphs

UML

Object-Oriented Design

Filters

A linked implementation of a queue is facilitated by references to the and elements of the linked list.