A list is full if length is equal to maxSize. a. true b. false What is the time-

Question

A list is full if length is equal to maxSize.
   a. true
   b. false

What is the time-complexity to insert an item at the end of a linked list?
   a. O(1)
   b. O(n)
   c. O(n2)
   d. O(log n)

In an ordered list, we need to modify only the algorithms (as implemented for a regular linked list) for the ____, insert, and delete operations.
   a. copy
   b. compare
   c. traverse
   d. search

Which answer most accurately completes the following sentence: A linked list is made up of ____.
   a. classes
   b. nodes
   c. addresses
   d. memory variables

Explanation / Answer

A list is full if length is equal to maxSize.
This is true, becuase now new elements can not be added into the list.

What is the time-complexity to insert an item at the end of a linked list?
O(n) - To insert a new element at the end of a linked list, we need to travel down the entire length of the linked list first.

In an ordered list, we need to modify only the algorithms (as implemented for a regular linked list) for the ____, insert, and delete operations.
Search - In an ordered list, if the value of the node exceeds the one we are searching for, then we don't have to search any further because it doesnt exist. It a normal list, one would have to traverse the full list before confirming if it's in the list.

Which answer most accurately completes the following sentence: A linked list is made up of ____.
Nodes - Each node points to the next one.

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.