CS 277
Spring 2023 All Classes
All Classes
Algorithms and Data Structures for Data Science
Credit: 4 hours.
Introduction to elementary concepts in algorithms and classical data structures with a focus on their applications in Data Science. Topics include algorithm analysis (ex: Big-O notation), elementary data structures (ex: lists, stacks, queues, trees, and graphs), basics of discrete algorithm design principles (ex: greedy, divide and conquer, dynamic programming), and discussion of discrete and continuous optimization.
Credit is not given for CS 277 if credit for CS 225 is earned. Prerequisite: STAT 207; one of MATH 220, MATH 221, MATH 234. CS 277 cannot be taken concurrently with CS 225.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
74116
|
Discussion/
Recitation
Lecture
|
AL1
AL1
|
2:00PM
-3:15PM
2:00PM
-3:15PM
|
F
MW
|
Everitt Laboratory
Everitt Laboratory
|
Solomon, B
Solomon, B
|
|