About CS 2240 OL1

Design and implementation of linear structures, trees and graphs. Examples of common algorithmic paradigms. Theoretical and empirical complexity analysis. Sorting, searching, and basic graph algorithms. Prerequisites: CS 2100 with a grade of C- or better; minimum Sophomore standing.


Prereqs enforced by the system: C- or better in CS 2100; Asynchronous Online Course

Section Description

You will learn the common data structures for abstract data types and algorithms, including lists, trees, heaps, sorting, hashing, and disjoint set finding/uniting. You will also consider and compare their performances. Course goals and objectives: 1) You will gain knowledge of different data structures and recognize the use cases for each. 2) You will consider not just whether algorithms function correctly or not, but also their efficiency and performance as the amount of data grows. 3) You will use the C++ programming language to collect data with and analyze data structures and algorithms.

Section Expectation

This class is an online course. Each week you will have videos and readings to complete on your own. Every other week you will be quizzed on the material, and you will submit a project completed in C++ every two to three weeks. Online courses offer flexibility with scheduling and completing work, but also require careful time management and self motivation to keep up with the material


Your final grade will be based on quizzes, programming projects, and a final exam

Important Dates

Note: These dates may change before registration begins.

Note: These dates may not be accurate for select courses during the Summer Session.

Last Day to Add
Last Day to Drop
Last Day to Withdraw with 50% Refund
Last Day to Withdraw with 25% Refund
Last Day to Withdraw


There are no courses that meet this criteria.