CS 46B - Introduction to Data Structures

4 units
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.

Misc/Lab: 3 hours of lecture/ 3 hours lab

Prerequisite(s): Knowledge of Java equivalent to CS 46A (in Java) or CS 49J (with grade of “C” or better). Eligibility for MATH 30 or MATH 30P, or instructor consent.
Pre/Corequisite(s): MATH 42.
Grading: Graded

Class Schedule | Syllabus Information | University Bookstore