Mar 28, 2024  
2021-2022 Cal State East Bay Catalog 
    
2021-2022 Cal State East Bay Catalog [ARCHIVED CATALOG]

Add to Folder (opens a new window)

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


Student Learning Outcomes - Upon successful completion of this course students will be able to:
  1. Author correct and robust computer programs to solve a variety of computational problems;
  2. Apply object-oriented techniques to the implementation of abstract data types and supporting methods;
  3. Creatively utilize data structures to store, retrieve, delete, and update complex data elements;
  4. Evaluate the characteristics of a problem in order to determine the most practical and efficient search or sorting procedure to select;
  5. Analyze the time and space efficiency of commonly-used algorithms, and express the results using asymptotic notation.




Add to Folder (opens a new window)