|
MCS 315 ALGORITHMS |
|
2008-2009 |
|
COURSE PAGE |
|
|
|
Section |
Instructor |
Phone |
|
Schedule |
|
01 |
Kerem Kaşkaloğlu |
586 8756 |
Tue: 12:30-13:20 (FEF232) Wed: 12:30-13:20 (FEF232) |
|
|
|
Announcements all topics covered are included in final examination. a few pages for vigenere cryptosystem mentioned in last lecture hour. last worksheet is here last part of the lecture notes are here Keep in mind that these are not complete, complete notes are given in class. lecture notes up to Oct 5: study these slides and these lecture notes. study these before MT1 MT1 topics; -asymptotic notations, finding running times of basic prog (loops, if-else structures) -solving recurrences (all methods we have covered) -sorting algorithms (insertion sort, merge sort, quicksort) -basic algorithms covered (like linear search, binary search, powering a number)
-the last lecture (counting/radix sort and finding fib nums) is NOT INCLUDED exam is at 13:30-15:20 in course hour at our regular class FEF 232
|
|
|
|
EXAMINATIONS and RESULTS |
|||
|
|
Exam Dates |
Questions and Solutions |
Grades |
|
Midterm 1 |
|
|
|
|
Midterm 2 |
|
|
|
|
Final Exam |
|
||
|
L. Notes |
|
||
|
Worksheets |
|
||
|
REMARK:
·
All the students should PROVIDE student ID cards to proctors to
serve as identification.
·
Make-up exams
will be given only if the proper medical documentation for the
|
|||