Outcome (j) Data Spring 2012
Performance Indicator 
1 
2 
3 
Beginning 
satisfactory 
exemplary 

Given an instance of data (eg. graph) and problem (eg. MST, search, shortest path), state and explain which algorithm would be best 
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 
23 
23 
59 
Given pseudocode of two algorithms (eg. sort), describe most suitable data structure to use 
wrong data structure chosen 
answer shows understanding of time/space efficiency of data structure for algorithm 
correct answer, correctly analyzes relative costs of data structures for algorithm 
Number of Students 
35 
40 
27 
Given a "reallife" problem, figure out which algorithm or data structure would be most helpful 
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 
44 
26 
32 