Question 1

In a sorted linked list, we always insert in the middle of the list.

Accepted Answer

In a sorted linked list, elements are inserted in a position that maintains the order, which could be at the beginning, middle, or end, depending on the value being inserted.

Question 2

In a sorted linked list, it is possible that the linked list may not be sorted after a deletion.

Accepted Answer

Deleting a node from a sorted linked list does not affect the order of the remaining elements, so the list remains sorted.

Question 3

Consider a stack represented by an array and top, the instance variable representing the index of the top of the stack; when the stack is empty, the value of top is __________.

Accepted Answer

The answer of Consider a stack represented by an array...

Question 4

Consider a stack represented by an array of five elements and top, the instance variable representing the index of the top of the stack; when the stack is full, the value of top is __________.

Accepted Answer

The answer of Consider a stack represented by an array...

Question 5

For a linked list of objects, a delete method that returns an object (the object deleted, if any) throws an exception. Why?

Accepted Answer

The answer of For a linked list of objects, a...

Question 6

In a linked list representing a queue, what extra instance variable is desirable to have and why?

Accepted Answer

The answer of In a linked list representing a queue,...

Question 7

Evaluate what is wrong with the following code, and recommend an alternative code.
while ( current.getData( ) != value && current != null )

Accepted Answer

The answer of Evaluate what is wrong with the following...

Question 8

Analyze why a mutator method should not be included for the number of items in a list.

Accepted Answer

The answer of Analyze why a mutator method should not...

Question 9

In a queue represented by an array, how do we tell if the queue is empty or full?

Accepted Answer

The answer of In a queue represented by an array,...

Quiz 14: An Introduction to Data Structures