Question

Question 110 pts

What are the contents of the queue bankLine after the following statements execute? The front of the queue in the answers is the left-most value

QueueInterface<String> bankLine = newLinkedQueue<>();
bankLine .enqueue(“John”);
bankLine .enqueue(“Matthew”);
String next = bankLine .dequeue();
bankLine .enqueue(“Drew”);
bankLine .enqueue(“Heather”);
bankLine .enqueue(“David”);
next = bankLine .dequeue();

John, Drew, Heather

Heather, John, Drew

Drew, Heather, David

David, Heather, Drew

Flag this Question

Question 210 pts

What are the contents of the deque waitingLine after the following statements execute? The front of the queue in the answers is the left-most value

DequeInterface<String> waitingLine = new LinkedDeque<>();
waitingLine.addToFront(“Jack”);
waitingLine.addToFront(“Rudy”);
waitingLine.addToBack(“Larry”);
waitingLine.addToBack(“Sam”);
String name = waitingLine.removeFront();

Larry, Sam, Jack

Rudy, Jack, Larry

Larry, Jack, Rudy

Jack, Larry, Sam

Flag this Question

Question 310 pts

How does a queue organize its items?

according to the order in which they were added

by priority

alphabetically

randomly

Flag this Question

Question 410 pts

The ADT priority queue organizes objects

according to the order in which they were added

by priority

alphabetically

none of the above

Flag this Question

Question 510 pts

What item is at the front of the list after these statements are executed?

DequeInterface<String> waitingLine = new LinkedDeque<>();
waitingLine.addToFront(“Jack”);
waitingLine.addToFront(“Rudy”);
waitingLine.addToBack(“Larry”);
waitingLine.addToBack(“Sam”);
String name = waitingLine.getFront();

Jack

Rudy

Larry

Sam

Flag this Question

Question 610 pts

If we use a chain of linked nodes with only a head reference to implement a queue, which statement is true?

You must traverse the entire chain to access the last node.

Accessing the last node is very inefficient.

Both a and b

None of the above

Flag this Question

Question 710 pts

In the linked chain implementation of a queue, the chain’s first node contains

the queue’s front entry

the queue’s back entry

both a and b

none of the above

Flag this Question

Question 810 pts

In a linked chain implementation of a queue, the performance of the enqueue operation is

O(1)

O(log n)

O(n)

O(n^2)

Flag this Question

Question 910 pts

In a linked chain implementation of a queue, the performance of the getFront operation is

O(1)

O(log n)

O(n)

O(n^2)

Flag this Question

Question 1010 pts

In a circular array-based implementation of a queue, what is the performance when the enqueue operation must resize the array?

O(n^2)

O(n)

O(log n)

O(1)

Answer 1

The answer to the question is given below.

The answer to the 1,2 and 3 Questions is given in the below image.





The answer to the 4, 5,6,7 and 8 Questions are given below in the image.





The answer to the 9 and 10 Questions are given below in the image.









If the answer helped please upvote it means a lot. For any query please comment.