CS 200: Applied Problem Solving
Course OverviewIn this course, we will introduce tricks and algorithmic techniques students are not typically exposed to in a conventional CS/CE program. Students will learn to approach problems similar to those seen in the ICPC (International Collegiate Programming Competition) or difficult interview questions and learn to implement their solutions in working code. This is a 1-credit P/F course, graded on attendance/participation. Some knowledge of conventional algorithms and data-structures is recommended.
- Learn to apply algorithms seen in class to approach problems
- Introduction of unconventional techniques and tricks
- Understand about optimization and speedup using algorithms
|Instructor:||Po Hao Chen (Howie), bupochen [at] bu [dot] edu|
|Office Hours:||Email to schedule|
|Instructor:||Benjamin Li, liben002 [at] bu [dot] edu|
|Office Hours:||Mon 7pm-8pm|
|Class Times:||Fri 2:30-3:20 (CAS B37)|
Course website: https://www.howchenn.com/teaching/ . All materials will be posted here.
While there is no strict prerequisites for this course, it is recommended that you have taken CS330 (Algorithms), CS112 (Data Structures). Otherwise, having a basic understanding of these also suffices
- Basics C++, programming tricks, how to approach and design the algorithm.
- Useful algorithms, graphs, advanced data structure, dynamic programming, string algorithms, combinatoric geometry
- Advanced Concepts
|9/23||Basic Graph Reductions||Lec3|
|9/30||Advanced Graph Algorithms||Lec4|
|11/11||Convex Hull Tricks|
|11/18||Fast Fourier Transform|
|12/2||In-Class Programming Contest|