Gce Model Questions Vol1 2021 Computer Studies Question 13
Practice objective / multiple choice question 13 from the 2021 Gce Model Questions Vol1 Computer Studies examination.
A programmer must store up to 10,000 integer records and support four operations: insert, delete, search by key, and retrieve the \(k^{\text{th}}\) smallest element (where \(k\) is given at query time). She can choose either (i) a balanced binary search tree (BST) or (ii) a hash table together with a lazily‑updated sorted array. For each operation, give the worst‑case asymptotic time complexity for both structures, and state which structure gives the lower overall worst‑case time for a mixed workload consisting of 40% inserts, 30% deletes, 20% searches and 10% \(k^{\text{th}}\) queries. Present the answer as a table and a brief justification.
Answer Options
About This Question
This is Gce Model Questions Vol1 2021 Computer Studies Question 13. It is one of the objective questions from the 2021 Gce Model Questions Vol1 Computer Studies examination.
Difficulty level: Medium .
Master the Exam!
You've seen a preview, but there are thousands more questions plus AI tutor to break down complex solutions.