Every question you have written, tagged by type, concept and difficulty. Reuse questions across assessments and pools.
5 of 5 questions
| Type | Concepts | Points | Difficulty | |
|---|---|---|---|---|
| A team stores a growing list of unique usernames and needs fast membership checks. Compare a balanced binary search tree and a hash table for this use, and recommend one. (150–250 words) | Essay | Trees and binary search trees, Hashing | 10 | Advanced |
| Binary search can be applied directly to an unsorted array. | True False | Searching | 1 | Introductory |
| State the precondition that binary search requires of its input, in one sentence. | Short Answer | Searching | 2 | Introductory |
| What is the worst-case time complexity of searching for a value in an unsorted array of n elements? | Multiple Choice | Algorithmic complexity, Searching | 2 | Introductory |
| Which of the following operations are constant time on a doubly linked list, given a reference to the node involved? | Multiple Response | Linked structures | 3 | Intermediate |