CS 301 - Data Structures and Algorithms

Units: 3
Design and implementation of abstract data structures including stacks, queues, doubly-linked and circularly-linked lists, binary search trees, heaps, priority queues and graphs; algorithmic analysis and asymptotic notation; binary search, heapsort, merge sort, quicksort, and radix sort.

Prerequisites: CS 201 and CS 211.
Equivalent Quarter Course: CS 3240.
Possible Instructional Methods: Entirely On-ground.
Grading: A-F grading only.
Course Typically Offered: Fall & Spring