| 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) |
Being familiar to the main concepts and methods of the social sciences and the fine arts devoted to understanding the world and the society |
4 |
| 2) |
Having comprehensive knowledge regarding different media and branches of art |
3 |
| 3) |
Knowing the historical background of audio-visual moving images in the world and in Turkey and keeping pace with the new developments in the area |
1 |
| 4) |
Having a good command of the language and the aesthetics of audio-visual moving images in the world and in Turkey |
1 |
| 5) |
Being able to create a narrative that could be used in a fiction or a non-fiction audio-visual moving image product |
2 |
| 6) |
Being able to write a script ready to be shot |
2 |
| 7) |
Having the skills to produce the photoboard of a script in hand and to shoot the film using the camera, the lights and other necessary equipment |
|
| 8) |
Being able to transfer the footage of a film to the digital medium, to edit and do other post-production operations |
|
| 9) |
Being able to create a documentary audio visual moving image from the preliminary sketch stage to shooting, editing and post-production stages |
|
| 10) |
Being able to produce an audio visual moving image for television and audio products for radio from preliminary stages through shooting and editing to the post-production stage |
|
| 11) |
Being culturally and theoretically equipped to make sense of an audio-visual moving image, to approach it critically with regard to its language and narration and being able to express his/her approach in black and white |
3 |
| 12) |
Having ethical values and a sense of social responsibility |
5 |