3, 4, or 5 on AP® Computer Science A Exam OR Placement Exam covering basic programming
This course covers the modern theory of discrete structures and algorithms, focusing on the themes of efficient algorithms and intractable problems. The course's goal is to provide a solid background in algorithms for computer science students. It is encouraged that mathematicians, biologists, physicists, and other STEM-intent majors to take this course. Please expect the course to be challenging, both in terms of the workload and the difficulty of the material. Students should be prepared to do a lot of work outside of class.
Completion Time (Weeks) (Approx.)
Relation to Copy of Subjects