Introduction to Data Structures
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 046A or CS 049J (with grade of "C" or better). Eligibility for MATH 030 or MATH 030P, or instructor consent. Math Remediation Completed or a post baccalaureate. Pre/Corequisite: MATH 42. Misc/Lab: Lecture 4 hour/lab 3 hours.
Normal Grade Rules