Great Ideas in Theoretical Computer Science
COS 330
1262
1262
Info tab content
This course will focus on a few great ideas in theoretical computer science that power modern computing applications. We will cover both classical ideas in algorithm design and more contemporary ideas from optimization and their applications. We will also study new computation models, such as online learning and communication complexity motivated by current large-scale applications. We will examine the role of randomness in algorithm design and theoretical computer science more generally. We will also cover modern topics such as error-correcting codes and their role in reliable information processing and transmission.
Instructors tab content
Sections tab content
Section L01
- Type: Lecture
- Section: L01
- Status: O
- Enrollment: 0
- Capacity: 160
- Class Number: 22648
- Schedule: MW 10:40 AM-12:00 PM
Section P01
- Type: Precept
- Section: P01
- Status: O
- Enrollment: 0
- Capacity: 20
- Class Number: 22649
- Schedule: Th 01:20 PM-02:10 PM
Section P02
- Type: Precept
- Section: P02
- Status: O
- Enrollment: 0
- Capacity: 20
- Class Number: 22650
- Schedule: Th 02:25 PM-03:15 PM
Section P03
- Type: Precept
- Section: P03
- Status: O
- Enrollment: 0
- Capacity: 20
- Class Number: 22651
- Schedule: Th 02:25 PM-03:15 PM
Section P04
- Type: Precept
- Section: P04
- Status: O
- Enrollment: 0
- Capacity: 20
- Class Number: 22652
- Schedule: F 01:20 PM-02:10 PM
Section P05
- Type: Precept
- Section: P05
- Status: O
- Enrollment: 0
- Capacity: 20
- Class Number: 22653
- Schedule: F 01:20 PM-02:10 PM