Assess students' ability to implement, analyze, and apply sorting (insertion sort, merge sort) and searching (binary search) algorithms to optimize program performance. Tasks include writing correct code for insertion and merge sort, implementing binary search on sorted arrays, comparing time and space complexities, explaining trade-offs and best-use scenarios, and demonstrating simple program optimizations by selecting and justifying the appropriate algorithm.