Course Objectives: |
The objective of the course is to introduce the fundamental mathematical tools needed to analyze algorithms, basic algorithm design techniques, advanced data structures, and important algorithms from different problem domains. |
Course Content: |
Introduction, asymptotic notation, empirical analysis of algorithms, designing algorithms, amortized analysis, brute force algorithms, divide and conquer algorithms, transform and conquer algorithms, space and time trade-offs, dynamic programming, greedy algorithms, advanced data structures, B-trees, Insertion and Deletion from B-trees, graphs and graph algorithms, P, NP, and NP-complete problems. |
Week |
Subject |
Related Preparation |
1) |
Introduction, asymptotic notation. |
|
2) |
Empirical analysis of algorithms, analysis of algorithms, amortized analysis |
|
3) |
Recurrences, substitution method, recursion-tree method, master method. |
|
4) |
Brute Force Algorithms |
|
5) |
Divide and Conquer Algorithms |
|
6) |
Merge sort, quicksort, randomized quicksort, binary search |
|
7) |
Transform and Conquer Algorithms: Solving systems of linear equations with Gaussian ination elimination, Balanced Search Trees, Heaps and Heapsort, Horner's Rule and Binary Exponentiation
|
|
8) |
Space and Time Trade-offs: Input Enhancement (Counting based sorting, string matching), Prestructuring (Hashing, Hash functions, open addressing).
|
|
9) |
Midterm |
|
10) |
Dynamic Programming: Coin-row problem, Knapsack problem, Longest common subsequence. |
|
11) |
Dynamic Programming: Knapsack problem, Longest common subsequence. |
|
12) |
Greedy Algorithms: Activity selection, Huffman codes, Prim’s algorithm, Kruskal’s Algorithm |
|
13) |
Single-source shortest paths: The Bellman-Ford algorithm, Dijkstra's algorithm. |
|
14) |
P, NP, and NP-complete problems |
|
Course Notes / Textbooks: |
Anany Levitin, The Design and Analysis of Algorithms, Pearson International Third Edition.
Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C., Introduction to Algorithms (3rd Edition), MIT Press, 2009.
Sanjoy Dasgupta , Christos Papadimitriou, Umesh Vazirani, Algorithms, McGraw-Hill Education.
|
References: |
Yok - None |
|
Program Outcomes |
Level of Contribution |
1) |
The student acquires theoretical and practical knowledge related to his field at a basic level. |
|
2) |
The student owns information about moral discipline and ethical rules related to his field. |
|
3) |
The student uses theoretical and practical knowledge related to his field at a basic level; basic fundamental computer programs and related technologies. |
|
4) |
The student manages a duty independently by using the knowledge about his field at a basic level. |
|
5) |
The student evaluates the knowledge about his field at a basic level with a critical approach, he designates his learning needs and directs his learning. |
|
6) |
The student uses information and communication technologies with at least at basic level of European Computer Using Licence basic level of computer software which his field of study requires. |
|
7) |
The student complies with and contributes to quality management and processes. |
|
8) |
The student has sufficient consciousness about individual and public health, environmental protection and work safety issues. |
|
9) |
The student acts in accordance with laws, regulations, legislations and professional ethics related to individual duties, rights and responsibilities. |
|