Mid-semester assessment

Tunde Balogun · attempt 1 of 40 points

Question 1 · Multiple Choice · 2 ptsCorrect (auto)

What is the worst-case time complexity of searching for a value in an unsorted array of n elements?

O(1)
O(log n)
O(n)(selected)
O(n log n)

Marks/ 2

Question 2 · Essay · 10 ptsAwaiting review

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)

A hash table gives expected O(1) lookups which is ideal for membership checks. A BST gives O(log n) but keeps order. Since the team only needs membership checks and not ordering, I recommend a hash table, keeping the load factor low so resizing stays amortised.

Marks/ 10