Assess students' ability to apply insertion sort to maintain a sorted list when new elements arrive and to use binary search to query that list efficiently; tasks should include performing step-by-step insertions into small arrays, executing binary searches for target values (present and absent), and analyzing time and space complexity and practical trade-offs (stability, in-place updates, and when other data structures are preferable).