CS 277
Fall 2021 All Classes
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 both CS 277 and CS 225. Prerequisite: STAT 207; one of MATH 220, MATH 221, MATH 234. CS 277 cannot be taken concurrently with CS 225.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
74767
|
Lecture
|
AL1
|
11:00AM
-12:15PM
|
MW
|
Digital Computer Laboratory
|
Solomon, B
|
|
|
|
74768
|
Online Discussion
|
ASA
|
10:00AM
-10:50AM
|
F
|
n.a.
|
|
||
|
74770
|
Online Discussion
|
ASB
|
11:00AM
-11:50AM
|
F
|
n.a.
|
|