This is a theoretical course covering algorithms for solving real problems that arise frequently in computer applications. The emphasis is on fundamental concepts not on specific software and implementation. In addition, the areas of NP-completeness will be introduced. Each students will select topic related to materials covered in the course and write a paper. Each student will also have an oral presentation in front of the class.
Projects are due as mentioned.
You may submit a project at most one class after the due date in which case a penalty of two points will occur. After that projects are unacceptable. You are supposed to attend classes regularly. In case of absence it is your responsibility to cover the topics done in the class. In case of missing a test date your final exam score will be used to replace the missing test score.