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.

Lecture 3 hours/lab 3 hours.

Prerequisite(s): Knowledge of Java equivalent to CS 46A  (in Java) or CS 49J  (with grade of C- or better). Math Enrollment Category M-I or M-II and satisfactory score on the Precalculus Proficiency Assessment (70 or higher), or MATH 19  with a C- or better, or MATH 18A  and MATH 18B  with C- or better.
Grading: Graded

Class Schedule | Syllabus Information | University Bookstore

Print-Friendly Page (opens a new window)