Course Description Course Description
| Computer Science 027a/b Computer Science Fundamentals II |
|
A continuation for both Computer Science 025a and 026a/b. Data organization and manipulation; abstract data types and their implementations in an object-oriented setting; lists, stacks, queues, trees; pointers; recursion; file handling and storage. |
| Antirequisites: The former Computer Science 226a/b. |
| Pre- or co-requisite: OAC Algebra and Geometry, or OAC Calculus, or Mathematics 012a/b, or Mathematics 017a/b |
| Prerequisite: Computer Science 025a or 026a/b. |
| 3 lecture hours, 1 laboratory/tutorial hour, 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)
|