# Outcome (a) Data Spring 2013

Author: David Taylor                                                                                 Spring 2013

 Performance Indicator 1 beginning 2 satisfactory 3 exemplary Calculate running time of a divide and conquer algorithm (assessed with an exam question) does not know how to calculate running time some correct steps in calculation, but incorrect solution correct solution Number of Students Section 1: Potika Number of Students Section 2: Smith Number of Students Section 3: Taylor* Number of Students Section 4: Taylor* 4 3 19 23 15 14** 3 2 17 4 2 1 Totals: 49 34** 24 Solve recurrence with Master Theorem (MT) (assessed with an exam question) does not know how to apply MT correct steps incorrect solution successfully use MT to find correct solution Number of Students Section 1: Potika Number of Students Section 2: Smith Number of Students Section 3: Taylor Number of Students Section 4: Taylor 4 2 2 3 15 13 1 0 17 6 21 23 Totals: 11 29 67 Calculate running time of an algorithm given in pseudocode (for example sort algorithm) (assessed with an exam question) does not know how to calculate running time some correct steps in calculation, but incorrect solution correct solution Number of Students Section 1: Potika Number of Students Section 2: Smith Number of Students Section 3: Taylor* Number of Students Section 4: Taylor* 11 4 19 23 13 11 3 2 12 6 2 1 Totals: 57 29 21 Apply an operation in an instance of an advanced data structure (assessed with an exam question) fail to apply operation some correct steps in application of operation, but incomplete performs operation correctly Number of Students Section 1: Potika Number of Students Section 2: Smith Number of Students Section 3: Taylor Number of Students Section 4: Taylor 6 0 0 3 3 2 3 5 27 19 21 18 Totals: 9 13 85 Totals Totaled: 126 98 197

The OAR recommendation can be find here

*For items 1 and 3, Taylor used the same set of 2 questions to evaluate both items. The question was a difficult one, including a red-herring: the pseudocode calculates  the solution to a divide-and-conquer equation, but not the same one as its run-time.

**7 of these students gave the correct time complexity without showing steps, although they were asked to justify their answers. Presumably they relied on the using the analogy with the similar binary mergesort algorithm.