Description and Goals
Introduces foundational methods in the design and analysis of information-processing and problem-solving techniques. Asymptotic time and space complexity are used as an evaluation framework throughout. Data structures include maps, trees, and heaps. Algorithmic approaches include greedy, divide-and-conquer, dynamic programming, and dealing with intractability. Graphs are used extensively, and important graph problems and their algorithms are examined closely.
Organization
Lecture Meeting Times
Section |
Instructor |
Room |
Time |
A |
Amir Manzourolajdad |
McGregory 314 |
TR 8:30 - 9:45 AM |
B |
Grusha Prasad |
McGregory 315 |
TR 8:30 - 9:45 AM |
C |
Amir Manzourolajdad |
McGregory 314 |
TR 9:55 - 11:10 AM |
Lab Meeting Times
Section |
Instructor |
TA |
Room |
Time |
L_A |
Amir Manzourolajdad |
Cristofer Jimenez |
McGregory 328 |
W 9:20 – 11:10 AM |
L_B |
Amir Manzourolajdad |
Grace Kenney |
McGregory 328 |
W 1:20 - 3:10 PM |
L_C |
Grusha Prasad |
Anzi Wang |
McGregory 329 |
R 9:20 - 11:10 AM |
L_D |
Amir Manzourolajdad |
James Njoroge |
McGregory 315 |
W 3:20 – 5:10 PM |
Open lab hours
- Hours: Thursdays from 4:00-6:00 pm and Fridays 3:00-5:00 pm
- Location: McGregory 319 (Student lounge)
Important links
- Lecture Section A:
- Lecture Section B:
- Lecture Section C:
- Lab Section A, B & D:
- Lab Sections C: