Description
Stacks and queues, recursion, lists, dynamic arrays, binary search trees. Iteration over collections. Hashing. Searching, elementary sorting. Big-O notation. Standard collection classes. Weekly hands-on activity.
Prerequisite: Knowledge of Java equivalent to that obtained by completing CS 46A or CS 49J (with grade of "C-" or better).
Pre/Corequisite: MATH 42.
Grading
Normal Grade Rules
Units
4
Page last generated: 10/30/2009 15:36:53
print
mail