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.
Possible Instructional Methods: On-ground, or Hybrid, or Online-Asynchronous.
Grading: A-F grading only.
Course Typically Offered: Fall & Spring

Student Learning Outcomes - Upon successful completion of this course students will be able to:

Author correct and robust computer programs to solve a variety of computational problems;
Apply object-oriented techniques to the implementation of abstract data types and supporting methods;
Creatively utilize data structures to store, retrieve, delete, and update complex data elements;
Evaluate the characteristics of a problem in order to determine the most practical and efficient search or sorting procedure to select;
Analyze the time and space efficiency of commonly-used algorithms, and express the results using asymptotic notation.