CS 46B - Introduction to Data Structures

4 unit(s)
Fundamental data structures including lists, stacks, queues, and trees, with algorithms for inserting, deleting, searching, and sorting information within them efficiently. Additional topics include Big-O analysis, exceptions, hashing, Java collections framework, generics, iterators, interfaces, recursion, and debugging. Weekly hands-on activities.

Lecture 3 hours/lab 3 hours.

Prerequisite(s): CS 46A or CS 46AX (with grade of C- or better). (If CS 46A was not in Java, then CS 46AW also required.) 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; Allowed Majors: Computer Science, Data Science, Stats, Applied/Computational Math, Software Engineering or Forensic Science: Digital Evidence.
Grading: Letter Graded

Class Schedule | Syllabus Information | University Bookstore