Assess students' ability to analyze time and space trade-offs of arrays, singly linked lists, and hash tables for search, insertion, and deletion. Require comparisons of average and worst-case time complexities, memory overhead (contiguous storage vs pointers), effects of load factor and resizing for hash tables, and how these factors influence choice in practical scenarios; ask for justification of the best data structure for given use cases.