This course provides an introduction to the design and analysis of algorithms for solving computational
problems. It is expected that, upon completion of this course, the students will achieve the following learning objectives:
- Develop a comprehensive understanding of major algorithmic techniques and state-of-the-art algorithms
for common problems.
- Become fluent in analyzing algorithms in terms of correctness and required computational resources.
- Become comfortable with formalism and doing proofs.
- Develop a vision towards using computational thinking effectively to solve challenging problems in a
broad range of practical applications.
- Have fun! (make no mistake though, this is an important and rather challenging course that has to be
taken seriously)
| Instructor: |
Mehmet Koyuturk |
| Office: |
EA-501 |
| Classs Meeting: |
EE-05, Tue 10:40-12:30, Fri 8:40-10:30. |
|
Assignments
|
Midterm Exam
The midterm exam will be during class hours (10:40-11:55) on Tuesday, March 6,
in EB-102, EB-103, EB-104.
Final Exam
The final exam will be on Saturday, May 26 between 17:30 and 19:30 in EB-101,
EB-102, EB-103.
|