|
Week - 1 |
Problem solving and algorithm development: determinism, finiteness, efficiency, input/output and analysis of algorithms |
|
Week - 2 |
Algorithmic program design and flowcharts |
|
Week - 3 |
Program execution speed and memory requirements: Execution time, time complexity, area cost and complexity, algorithm analysis, complexity, memory requirement, asymptotic notations, sustainable algorithm design |
|
Week - 4 |
Sorting algorithms: Bubble sort, cluster sort, interleaving sort, selective sort, fast sort, etc |
|
Week - 5 |
Search algorithms: Linear search, binary search |
|
Week - 6 |
Linked lists: One-way and two-way linked lists and their applications |
|
Week - 7 |
Stack and Queue Structures: Stack and queue design, stack and queue design with arrays and linked lists |
|
Week - 8 |
Hash function and its applications |
|
Week - 9 |
Tree structures: Basic tree concepts, storing trees in memory |
|
Week - 10 |
Binary trees, AVL tree structures |
|
Week - 11 |
B/B+ tree structures |
|
Week - 12 |
Graph data model: Graph concepts, memory storage of graphs, neighborhood matrices and lists |
|
Week - 13 |
Graph traversal algorithms: Depth-first search algorithm, breath first search algorithm |
|
Week - 14 |
Shortest path finding problem and its applications |
Eskisehir Technical University Info Package