Assess learners' ability to select and justify appropriate data structures (arrays, linked lists, hash tables, trees, heaps, graphs) to optimize common programming tasks such as search, insertion, deletion, traversal, priority retrieval, and relationship modeling. The quiz will focus on time/space complexity trade-offs, memory and cache considerations, and necessary algorithmic adjustments when replacing one structure with another. Use scenario-based questions that require short-answer explanations and brief code or pseudocode analysis to demonstrate why a chosen structure is optimal for given constraints (e.g., real-time updates, large-scale lookups, shortest-path computations, priority queues).