1.3. Advanced Level
Students who pass CS146 should be able to perform the following tasks:
Apply DFS to a given graph, giving the sequence of nodes visited and the edge type of each edge in the graph. (Assessed with an exam question.)
Alternative Task 1: Given the discovery and finish times for nodes in a graph covered by DFS, give the edge types of a specified set of edges. (Assessed with an exam question.)
For a particular sorting algorithm (such as radix sort, heapsort, mergesort or quicksort) indicate what the array being sorted will hold at a specified point during the execution of the algorithm. (Assessed with an exam question.)
Write a program that implements a specified data structure (such as list, stack, queue, search tree, heap, union-find ADT, 234 tree, or graph). (Assessed with a programming exercise.)
The instructor reported data averaged over two sections. In the raw data matrix this averaged data is used for each section.
The report indicates that on the average, 50%, 70%, and 63% of passing students were able to perform the tasks.
The author of the CS146 report makes the following noteworthy comment:
I generally give exams where I expect the average to be about 50%. Getting 70% on a problem generally means that the student understands it, but made some error in their work.