Question 1

Each process on the ready queue is pushed onto a stack before being given a slice of CPU time.

Accepted Answer

A) True 
 B)False

Question 2

The list data structure in Python cannot be used to emulate a queue because there is no pop method.

Accepted Answer

A) True 
 B)False

Question 3

What are the two fundamental operations of a queue?

Accepted Answer

A)   insert, push
B)   insert, pop
C)   push, add
D)   add, popE) B) and D)
F) A) and D)

Question 4

What is the returned value and the state of the queue after the operation is executed? Current queue state: x a z b
Q.peek()

Accepted Answer

A)   b, x a z b
B)   x, a z b
C)   x, x a z b
D)   b, x a zE) A) and B)
F) B) and C)

Question 5

By using a circular array implementation, you can simultaneously achieve good running times for both add and pop .

Accepted Answer

A) True 
 B)False

Question 6

The peek operation on a queue returns the item at the back of the queue without removing it.

Accepted Answer

A) True 
 B)False

Question 7

The structure of a queue lends itself to either an array implementation or a linked implementation.

Accepted Answer

A) True 
 B)False

Question 8

In the linked priority queue, what is the time and space analysis for the add method?

Accepted Answer

A)   O( n2 ) 
B)   exponential
C)   logarithmic
D)   O( n ) E) All of the above
F) B) and C)

Question 9

When using a circular array implementation for a queue, you maintain a count of the items in the queue to determine if it is full or empty.

Accepted Answer

A) True 
 B)False

Question 10

In the following code for the add method for a linked queue implementation, what is the missing code? def add(self, newItem) :
NewNode = Node(newItem, None) 
If self.isEmpty() :
Self.front = newNode
Else:
Self.rear.next = newNode

Self.size += 1

Accepted Answer

A)   self.rear = newNode
B)   self.rear -= 1
C)   self.rear.prev = None
D)   self.front = self.nextE) A) and D)
F) C) and D)

Question 11

What happens to processes on the ready queue in a round-robin CPU scheduling scheme?

Accepted Answer

A)   they are pushed and put in the priority queue
B)   they are popped and allocated memory
C)   they are pushed to the end of the queue
D)   they are popped and given a slice of CPU timeE) B) and C)
F) A) and D)

Question 12

How would you use a Python list method to remove and return an item at the front of the queue?

Accepted Answer

A)   peek(len(queue) -1) 
B)   peek(1) 
C)   pop(len(queue) -1) 
D)   pop(0) E) A) and C)
F) C) and D)

Question 13

Queues are linear collections.

Accepted Answer

A) True 
 B)False

Question 14

Similar to stacks, queues support a FILO protocol.

Accepted Answer

A) True 
 B)False

Question 15

What is the precondition to using the pop method on a queue?

Accepted Answer

A)   the queue must not be empty
B)   the queue must be full
C)   the queue must not be full
D)   the queue must first be resizedE) A) and B)
F) A) and D)

Question 16

The array implementation of a queue must access items at the logical beginning and the logical end.

Accepted Answer

A) True 
 B)False

Question 17

In the following code for the __eq__ method for the Comparable class, what is the missing code? def __eq__(self, other) :
If self is other: return True
If type(self)  != type(other) : 
Return self.priority == other.priority

Accepted Answer

A)   return type(other) 
B)   return other
C)   return False
D)   return self.priorityE) A) and B)
F) A) and C)

Question 18

What is the initial value of the front and rear instance variables in the linked queue?

Accepted Answer

A)   -1
B)   0
C)   None
D)   1E) B) and C)
F) A) and D)

Question 19

Performing a pop operation on an empty queue throws an exception.

Accepted Answer

A) True 
 B)False

Question 20

The two fundamental operations supported by queues are pop and insert.

Accepted Answer

A) True 
 B)False

Exam 8: Queues

What are the two fundamental operations of a queue?

Correct AnswerverifiedShow Answer

What is the precondition to using the pop method on a queue?

Correct AnswerverifiedShow Answer

In the linked priority queue, what is the time and space analysis for the add method?

Correct AnswerverifiedShow Answer

In the following code for the add method for a linked queue implementation, what is the missing code? def add(self, newItem) : NewNode = Node(newItem, None) If self.isEmpty() : Self.front = newNode Else: Self.rear.next = newNode < missing code > Self.size += 1

Correct AnswerverifiedShow Answer

Queues are linear collections.

Correct AnswerverifiedShow Answer

By using a circular array implementation, you can simultaneously achieve good running times for both add and pop .

Correct AnswerverifiedShow Answer

What is the returned value and the state of the queue after the operation is executed? Current queue state: x a z b Q.peek()

Correct AnswerverifiedShow Answer

Similar to stacks, queues support a FILO protocol.

Correct AnswerverifiedShow Answer

The structure of a queue lends itself to either an array implementation or a linked implementation.

Correct AnswerverifiedShow Answer

How would you use a Python list method to remove and return an item at the front of the queue?

Correct AnswerverifiedShow Answer

The two fundamental operations supported by queues are pop and insert.

Correct AnswerverifiedShow Answer

The list data structure in Python cannot be used to emulate a queue because there is no pop method.

Correct AnswerverifiedShow Answer

What happens to processes on the ready queue in a round-robin CPU scheduling scheme?

Correct AnswerverifiedShow Answer

When using a circular array implementation for a queue, you maintain a count of the items in the queue to determine if it is full or empty.

Correct AnswerverifiedShow Answer

Performing a pop operation on an empty queue throws an exception.

Correct AnswerverifiedShow Answer

The peek operation on a queue returns the item at the back of the queue without removing it.

Correct AnswerverifiedShow Answer

What is the initial value of the front and rear instance variables in the linked queue?

Correct AnswerverifiedShow Answer

In the following code for the __eq__ method for the Comparable class, what is the missing code? def __eq__(self, other) : If self is other: return True If type(self) != type(other) : < missing code > Return self.priority == other.priority

Correct AnswerverifiedShow Answer

Each process on the ready queue is pushed onto a stack before being given a slice of CPU time.

Correct AnswerverifiedShow Answer

The array implementation of a queue must access items at the logical beginning and the logical end.

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

In the following code for the eq method for the Comparable class, what is the missing code? def eq(self, other) : If self is other: return True If type(self) != type(other) : < missing code > Return self.priority == other.priority

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified