4. Consider using a simple linked list as a dictionary. Assume the client will never provide duplicate elements, so we can just insert elements at the beginning of the list. Now assume the peculiar situation that the client may perform any number of insert operations but will only ever perform at most one lookup operation. (a) What is the worst-case running-time of the operations performed on this data structure under the assumptions above? Briefly justify your answer. (b) What is the worst-case amortized running-time of the operations performed on this data structure under the assumptions above? Briefly justify your answer. Solution: (a) inserts are O(1) (push on the front of a linked list), but the lookup is O(n) where n is the number of inserted items since the lookup may be last and be for one of the earliest inserted items

4. Consider using a simple linked list as a dictionary. Assume the client will never provide duplicate elements, so we can just insert elements at the beginning of the list. Now assume the peculiar situation that the client may perform any number of insert operations but will only ever perform at most one lookup operation. (a) What is the worst-case running-time of the operations performed on this data structure under the assumptions above? Briefly justify your answer. (b) What is the worst-case amortized running-time of the operations performed on this data structure under the assumptions above? Briefly justify your answer. Solution: (a) inserts are O(1) (push on the front of a linked list), but the lookup is O(n) where n is the number of inserted items since the lookup may be last and be for one of the earliest inserted items

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

My answer is wrong, please help me to change it. Thank you
With proper explanation don't know the answer leave for other expert Proper explanation got thumbs-up
no explanations needed just answer
Right answer please with experience.
don't use others answers
don't use others answer, show your work step by step
Please tell me where I get wrong.
No need to detail explanation I need only right answer with relevant explanation
Can i see the answer with explanations?
Give correct answer. Don't copy other's work.
Please choose the correct answer without explaining.. Thank you
Correct and detailed answer will be Upvoted. Thank you...