FiltersDone

Question type

Essay

Multiple Choice

Short Answer

True False

Matching

Exam 8: Queues

Show Answer

Share

---

All types

Filters

Study FlashcardsPractice ExamLearn

Question 21

Multiple Choice

Review LaterAdd Note

Review Later

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

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

E) A) and B)
F) A) and C)

Correct Answer

verified

Show Answer

Question 22

Multiple Choice

Review LaterAdd Note

Review Later

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

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 time

E) B) and C)
F) A) and D)

Correct Answer

verified

Show Answer

Question 23

True/False

Review LaterAdd Note

Queues are linear collections.

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

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

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

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.

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

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

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

What are the two fundamental operations of a queue?

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

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()

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

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

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

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

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

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

Similar to stacks, queues support a FILO protocol.