CS 3100

Data Structures and Algorithms 2

New Add to Schedule

Course Description

Pre-Requisite(s): CS 2100 & CS 2120

Builds upon previous analysis of algorithms and the effects of data structures on them. Algorithms selected from areas such as searching, shortest paths, greedy algorithms, backtracking, divide-and-conquer, dynamic programming, and machine learning. Analysis techniques include asymptotic worst case, expected time, amortized analysis, and reductions. Background in topics covered in a first course in Calculus is required. CS 3140 is recommended.


  • Mark Floryan

     Rating

    3.69

     Difficulty

    4.33

     GPA

    3.50

     Sections

    1

    Last Taught

    Spring 2026

  • Nathan Brunelle

     Rating

     Difficulty

     GPA

    3.38

     Sections

    Last Taught

    Spring 2023

  • Raymond Pettit

     Rating

    2.83

     Difficulty

    4.38

     GPA

    3.35

     Sections

    Last Taught

    Spring 2025

  • Aaron Bloomfield

     Rating

    2.97

     Difficulty

    4.09

     GPA

    2.90

     Sections

    1

    Last Taught

    Spring 2026

  • Tom Horton

     Rating

    3.27

     Difficulty

    4.20

     GPA

     Sections

    Last Taught

    Fall 2023

  • Robbie Hott

     Rating

    4.07

     Difficulty

    4.40

     GPA

     Sections

    Last Taught

    Spring 2024