Consider a Linked List that has the following operation defined on it: . ADDLAST(x): Adds the...

Transcribed Image Text:

Consider a Linked List that has the following operation defined on it: . ADDLAST(x): Adds the element to the end of the list. • REMOVEODDS(): Removes every other element from the list. i.e. Removes the first, third, fifth, etc., elements from the list. Assume that the cost of ADDLAST is 1 unit, and that the cost of REMOVEODDS is equal to the length of the list. (a) Assume that we perform m operations on the list. What is the worst case cost of a single call to REMOVEODDS? Explain your answer. (b) Show that the amortized cost of these operations is constant using the aggregate or accounting or potential method of your choice. Consider a Linked List that has the following operation defined on it: . ADDLAST(x): Adds the element to the end of the list. • REMOVEODDS(): Removes every other element from the list. i.e. Removes the first, third, fifth, etc., elements from the list. Assume that the cost of ADDLAST is 1 unit, and that the cost of REMOVEODDS is equal to the length of the list. (a) Assume that we perform m operations on the list. What is the worst case cost of a single call to REMOVEODDS? Explain your answer. (b) Show that the amortized cost of these operations is constant using the aggregate or accounting or potential method of your choice.

Answer rating: 100% (QA)

a In the worst case all elements in the linked list need to be removed by REMOVEODDS Each removal op... View the full answer