Question 1

Both classes, LinkedStack and LinkedQueue, use a singly linked Node class to implement nodes.

Accepted Answer

A) True 
 B)False

Question 2

What is the solution to achieving good performance for both the add and pop methods in the array implementation of a queue?

Accepted Answer

A)  using a front pointer that advanced through the array 
B)  using a fixed front pointer to index position 0 
C)  using an insert function instead of add 
D)  using a circular array implementation 
A)  using a front pointer that advanced through the array 
B)  using a fixed front pointer to index position 0 
C)  using an insert function instead of add 
D)  using a circular array implementation

Question 3

Which type of computer activity would likely be assigned to the priority queue?

Accepted Answer

A)  a background process that defragments the disk 
B)  sending email 
C)  mouse movement 
D)  a background process that releases unused memory blocks 
A)  a background process that defragments the disk 
B)  sending email 
C)  mouse movement 
D)  a background process that releases unused memory blocks

Question 4

Which protocol is supported by queues?

Accepted Answer

A)  last-in first-out 
B)  last-in last-out 
C)  first-in first-out 
D)  first-in last-out 
A)  last-in first-out 
B)  last-in last-out 
C)  first-in first-out 
D)  first-in last-out

Question 5

Which of the following is NOT an important factor to consider by a manager of a supermarket trying to schedule checkout cashiers?

Accepted Answer

A)  the frequency with which new customers arrive 
B)  the number of checkout cashiers available 
C)  the number of items in a customer's shopping cart 
D)  the number of aisles in the supermarket 
A)  the frequency with which new customers arrive 
B)  the number of checkout cashiers available 
C)  the number of items in a customer's shopping cart 
D)  the number of aisles in the supermarket

Question 6

In the following code for the pop method for a linked queue implementation, what is the missing code?
Def pop(self):
OldItem = self.front.data
Self.front = self.front.next
If self.front is None:
Self.rear = None

Return oldItem

Accepted Answer

A)  self.rear -= 1 
B)  self.front = self.rear 
C)  self.size -= 1 
D)  self.size += 1 
A)  self.rear -= 1 
B)  self.front = self.rear 
C)  self.size -= 1 
D)  self.size += 1

Question 7

The most common type of CPU scheduling technique is called last in, first-out.

Accepted Answer

A) True 
 B)False

Question 8

What is one reason that it is difficult to devise formulas to answer simple questions about a supermarket checkout system?

Accepted Answer

A)  the variability of essential factors 
B)  the regularity in which customers arrive 
C)  because customers always purchase the same number of items 
D)  because the same number of customers are there at all times of the day 
A)  the variability of essential factors 
B)  the regularity in which customers arrive 
C)  because customers always purchase the same number of items 
D)  because the same number of customers are there at all times of the day

Question 9

What type of collection is a queue?

Accepted Answer

A)  linear 
B)  parallel 
C)  random 
D)  geometric 
A)  linear 
B)  parallel 
C)  random 
D)  geometric

Question 10

Which example best represents a queue?

Accepted Answer

A)  print jobs sent to a printer 
B)  a pickup game of football 
C)  items selected via a random number generator 
D)  people exiting a sporting event 
A)  print jobs sent to a printer 
B)  a pickup game of football 
C)  items selected via a random number generator 
D)  people exiting a sporting event

Both classes, LinkedStack and LinkedQueue, use a singly linked Node class to implement nodes.

What is the solution to achieving good performance for both the add and pop methods in the array implementation of a queue?

Which type of computer activity would likely be assigned to the priority queue?

Which protocol is supported by queues?

Which of the following is NOT an important factor to consider by a manager of a supermarket trying to schedule checkout cashiers?

In the following code for the pop method for a linked queue implementation, what is the missing code? Def pop(self): OldItem = self.front.data Self.front = self.front.next If self.front is None: Self.rear = None < missing code > Return oldItem

The most common type of CPU scheduling technique is called last in, first-out.

What is one reason that it is difficult to devise formulas to answer simple questions about a supermarket checkout system?

What type of collection is a queue?

Which example best represents a queue?

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

Both classes, LinkedStack and LinkedQueue, use a singly linked Node class to implement nodes.

What is the solution to achieving good performance for both the add and pop methods in the array implementation of a queue?

Which type of computer activity would likely be assigned to the priority queue?

Which protocol is supported by queues?

Which of the following is NOT an important factor to consider by a manager of a supermarket trying to schedule checkout cashiers?

In the following code for the pop method for a linked queue implementation, what is the missing code? Def pop(self): OldItem = self.front.data Self.front = self.front.next If self.front is None: Self.rear = None < missing code > Return oldItem

The most common type of CPU scheduling technique is called last in, first-out.

What is one reason that it is difficult to devise formulas to answer simple questions about a supermarket checkout system?

What type of collection is a queue?

Which example best represents a queue?

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