CS 2100
Data Structures and Algorithms 1
Course Description
Prerequisites
CS 1110 or CS 1111 or CS 1112 or CS 1113 or place out test for CS 1110 or CS 2100
A second course in computing with an emphasis on foundational data structures and program analysis. The course provides a introduction to object oriented programming and the Java programming language, concurrency, and inheritance / polymorphism. Additionally, foundational data structures and related algorithms / analysis are studied. These include lists, stacks, queues, trees, hash tables, and priority queues. Prereq: CS 1110 or CS 1111 or CS 1112 or CS 1113 or place out test for CS 1110 or CS 2100
Instructors
Briana Morrison
Fall 2026
mo 5:30pm - 7:15pm
3.0
Rating
2.9
Difficulty
3.52
GPA
Xinyao Yi
Spring 2026
mowefr 2:00pm - 2:50pm
3.3
Rating
2.8
Difficulty
3.39
GPA
Derrick Stone
Spring 2024
MoWeFr 11:00am - 11:50am
2.8
Rating
3.3
Difficulty
3.63
GPA
To Announced
Fall 2023
MoWeFr 2:00pm - 2:50pm
—
Rating
—
Difficulty
—
GPA
Nada Basit
Fall 2022
Mo 6:30pm - 7:45pm
4.7
Rating
3.0
Difficulty
3.81
GPA
Tom Horton
Fall 2022
MoWeFr 9:00am - 9:50am
3.2
Rating
3.3
Difficulty
—
GPA
Mark Floryan
Spring 2022
Mo 3:00pm - 4:45pm
3.6
Rating
3.3
Difficulty
3.70
GPA