| Course Type | Elective Course |
| Course Level | Bachelor's Degree |
| Year of Study | - |
| Semester | - |
| ECTS | 5 |
| Name of Lecturer(s) |
- |
| Learning Outcomes |
At the end of this course, the students;
- learn the basic concepts and terminology of algorithms
|
| Mode of Delivery | Face to face |
| Prerequisites | No |
| Recommended Optional Programme Components | There is no recommended optional programme component for this course. |
| Course Description | Sorting Algorithms; Search Trees, Heaps, and Hashing; Divide and Conquer; Dynamic Programming; Graph Algorithms; Shortest Paths; Network Flow; Number-Theoretic Algorithms; Polynomial and Matrix Calculations; Paralel Computing |
| Course Contents |
| WEEK |
TOPICS |
|
1st Week |
Introduction |
|
2nd Week |
rowth of functions |
|
3rd Week |
Recurrences |
|
4th Week |
Quicksort |
|
5th Week |
Order Statistics |
|
6th Week |
Heaps |
|
7th Week |
Amortized Analysis |
|
8th Week |
MIDTERM |
|
9th Week |
Hashing |
|
10th Week |
Binary Search Trees |
|
11th Week |
Greedy Algorithms |
|
12th Week |
Shortest Paths |
|
13th Week |
Network Flow |
|
14th Week |
MIDTERM II |
|
| Recommended or Required Reading | "T. H. Cormen, C:E Leierson, R.L. Rivest And C. Stein, Introduction to ALgorithms, 2nd Edition, , Springer, 2001." |
| Planned Learning Activities and Teaching Methods |
- Lecture
- Questions/Answers
- Case Study
- Problem Solving
|
| Assessment Methods and Criteria |
|
Quantity |
Percentage (%) |
| Mid-term |
2 |
20 |
| Assignment |
5 |
5 |
| Quiz |
5 |
5 |
| Total(%) |
|
30 |
| Contribution of In-term Studies to Overall Grade(%) |
|
30 |
| Contribution of Final Examination to Overall Grade(%) |
|
70 |
| Total(%) |
|
100 |
|
| Language of Instruction | Turkish |
| Work Placement(s) | No |