Course Description Course Description
| Computer Science 210a/b Data Structures and Algorithms. |
|
Lists, stacks, queues, priority queues, trees, graphs, and their associated algorithms; file structures; sorting, searching, and hashing techniques; time and space complexity. |
| Antirequisites: SE 202a/b, the former Computer Science 201. |
| Prerequisites: Computer Science 027a/b with at least 60%, and one full course or equivalent, chosen from the following: Mathematics 030, Applied Mathematics 026, Calculus 050a/b, 051a/b, 081a/b, Linear Algebra 040a/b, or the former Applied Mathematics 020, or 023a/b plus 024a/b, or the former Mathematics 027. |
| 3 lecture hours, half course |
| Academic Calendar |
![[Table of Contents]](toc.gif) ![[Index]](index.gif)
|
![[Courses by Subject]](crssbsub.gif) ![[Courses by Name]](crssbnme.gif) ![[Awards by Category]](awrdbctg.gif) ![[Awards by Name]](awrdbnme.gif) ![[Calendar Search]](search.gif)
|