CS 300 - Data Structures for Everyone

Units: 3 ; G.E./G.R. Area: B6
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.
Prerequisites: Completion of GE Areas A1, A2, A3 and B4 with grade C- (CR) or better; and CS 100, CS 200.
Credit Restrictions: Not for Computer Science major or minor credit.
Possible Instructional Methods: Entirely On-ground.
Grading: A-F or CR/NC (student choice).
G.E./G.R. Area Satisfied: B6- Upper Division Science Inquiry and Quantitative Reasoning