Week - 1 |
Algorithm analysis, types of complexities |
Week - 2 |
Performance of basic data structures |
Week - 3 |
Stack, queue, deck |
Week - 4 |
Lists, unordered lists, ordered lists, linked lists |
Week - 5 |
Performance comparisons of lists and linked lists |
Week - 6 |
1. midterm exam |
Week - 7 |
Recursion: Linear recursion, binary recursion, tail recursion |
Week - 8 |
Searching algorithms: Ardışık arama, ikili arama |
Week - 9 |
Searching algorithms: Hashing, hashsets, hashmaps |
Week - 10 |
Sorting algorithms: Bubble sort, selection sort, insertion sort, shell sort, merge sort, quick sort |
Week - 11 |
2. midterm exam |
Week - 12 |
Trees, binary search trees, heaps |
Week - 13 |
Balanced binary search trees |
Week - 14 |
Graphs |