Apr 23, 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 413 - Analysis of Algorithms


Units: 3
Asymptotic notation, analysis framework, and efficiency classes, recurrence relations, algorithmic design methodology, searching and sorting algorithms, string matching, heaps and priority queues, doubly-linked and circularly-linked lists; trees and balancing; graph algorithms including breath-first and depth-first search, and hashing.

Prerequisites: CS/MATH 211 and CS 301.
Equivalent Quarter Course: CS 4245.
Possible Instructional Methods: Entirely On-ground, or Entirely Online, or Hybrid.
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. Apply asymptotic notation to describe the behavior of algorithms in best, average and worst cases;
  2. Select an appropriate algorithmic strategy for solving a suite of well-known problems;
  3. Develop new and correct algorithms to solve complex tasks. Calculate the time and space efficiencies of novel algorithms;
  4. Analyze the complexity of computational problems in different domains.




Add to Folder (opens a new window)