Outcome (j) Data Spring 2013
Author: David Taylor Spring 2013
Performance Indicator 
1 beginning 
2 satisfactory 
3 exemplary 

Given an instance of data (eg. graph) and problem (eg. MST, search, shortest path), state and explain which algorithm would be best (assessed with an exam question) 
wrong algorithm chosen 
answer shows understanding of tradeoff of algorithm in terms of space and time 
correct answer, correctly analyzes relative costs of algorithms for specific data and problem 

Number of Students Section 1: Potika Number of Students Section 2: Smith Number of Students Section 3: Taylor Number of Students Section 4: Taylor 
5 3 6 17 
7 12 2 4 
24 5 16 5 

Totals: 
31 
25 
50 

Given pseudocode of two algorithms (eg. sort), analyze which is more efficient 
analysis incorrect 
answer shows understanding of time/space efficiency of algorithm 
correct answer, correctly analyzes relative costs of algorithm 

Number of Students Section 1: Potika Number of Students Section 2: Smith Number of Students Section 3: Taylor Number of Students Section 4: Taylor 
9 3 15 22 
9 4 6 4 
18 14 3 0 

Totals: 
49 
23 
35 

Given a “reallife” problem, figure out which algorithm or data structure would be most helpful (assessed with an exam question) 
algorithm or data structure does not solve problem 
can explain how algorithm or data structure can solve problem 
can explain how algorithm or data structure can solve problem better than other algorithms or data structures 

Number of Students Section 1: Potika Number of Students Section 2: Smith Number of Students Section 3/4: Taylor* 
5 2 11 
7 12 8 
23 7 11 

Totals: 
18 
27 
41 

Totals Totaled: 
98 
75 
126 


The OAR recommendation can be find here.
*This item was evaluated by a programming assignment, which was assigned late in the semester. 20 students did not attempt the program, as they do not need to get every program running.