Assess students' ability to evaluate and select efficient algorithms and data structures for concrete problems (e.g., sorting, searching, simple key-value lookup) by comparing time complexity, memory usage, and how varying input size affects performance. Provide short problem scenarios with sample input sizes and constraints (limited memory, need for stability, average vs worst-case), and ask students to choose the best algorithm/data structure, justify the choice with Big-O reasoning, estimate resource use for given n, and discuss practical trade-offs and limitations.