|
||
CS 202 |
Instructor:
|
TA:
|
Class
Hours:
Section 1: Mon: 10:40-12:30; Wed: 9:40-10:30 |
|
Schedule and Outline |
||
Week # |
Start Date |
Topic |
Jan 30, Thr |
Registration |
|
1 | Feb 3, Mon | Review of Algorithm Analysis |
2 | Feb 10, Mon |
Holiday (Kurban Bayramı) |
3 | Feb 17, Mon | Trees - Binary Trees, Tree Traversals |
Feb 24, Mon |
Last Day of Add/Drop |
|
4 | Feb 24, Mon |
Search Trees, AVL Trees |
5 | Mar 3, Mon |
Hashing |
6 | Mar 10, Mon |
Priority Queues |
7 | Mar 17, Mon |
Sorting |
8 | Mar 24, Mon |
Sets - Union/Find |
9 | Mar 31, Mon |
Graphs - Representation, topological sort |
10 | Apr 7, Mon |
Graph Algorithms: Shortest paths, minimum spanning trees |
11 | Apr 14, Mon |
Depth-First Search |
12 | Apr 21, Mon |
Algorithm Design Techniques - Greedy Algorithms |
Apr 23, Wed |
Holiday (23 Nisan Ulusal Egemenlik ve Çocuk Bayramı) |
|
13 | Apr 28, Mon |
Dynamic Programming |
14 | May 5, Mon |
Backtracking |
15 | May 12, Mon |
Branch and Bound |
May 19, Mon |
Holiday (19 Mayıs Gençlik ve Spor Bayramı) |
|
May 20, Tue | Final Exams Start | |
May 30, Fri | End of Academic Year |
Grading Policy (tentative)
Homeworks: 20%
Quizes: 15%
Projects:?
Midterm Exam: 30%
Final Exam: 35%
Attendance: Attendance is important in order to learn the topics in a
timely manner. Attendance will be forced either by taking attendance
explicitly or by making quizzes at random times.
Quizzes: There will quizzes every week or every other week. We may not
inform you about the quizzes. A quiz may be done at any time during a lecture
period.
Homeworks: Homeworks will be assigned about the topics that are
covered. Homeworks may include programming.
Projects: I did not decide if I will
give projects. I may assign programming work as part of homeworks. Otherwise I
will assign projects.
Midterm Exam:
There will be one midterm exam that will be given around
the mid of the semester.
Final Exam:
There will be one final exam that will be given during
final exams period of the semester.
Makeup Exam:
Depending on the need (for officially reported or
extraordinary cases) I may make a makeup exam. But I should warn you that makeup
exam will be much more difficult than the other exams in order to provide
fairness for students who work on time and take the exam on time, and
discourage students from unnecessarily omitting the exams.