CS 300 - Data Structures for Everyone

Units: 3
Further development of programming and problem solving skills with emphasis on data structures. Topics include stacks, queues, doubly-linked/circularly-linked lists, trees, heaps, priority queues and graphs. Algorithmic analysis and asymptotic notation; binary search, heapsort, merge sort, quicksort, and radix sort.

Strongly Recommended Preparation: Upper division status (greater than 60 earned semester units) and completion of lower division Areas B1-B3.
Credit Restrictions: Not for Computer Science major or minor credit.

Possible Instructional Methods: On-ground.
Grading: A-F or CR/NC (student choice).
Student Learning Outcomes - Upon successful completion of this course students will be able to:

Author computer programs to solve a variety of computational problems;
Apply object-oriented techniques to the implementation of abstract data types and supporting methods;
Utilize data structures to store, retrieve, and edit data;
Evaluate the characteristics of a problem in order to determine the most efficient search or sorting procedure to select;
Analyze the time and space efficiency of commonly-used algorithms.