CYBER SECURITY (ENGLISH, NONTHESIS) | |||||
Master | TR-NQF-HE: Level 7 | QF-EHEA: Second Cycle | EQF-LLL: Level 7 |
Course Code | Course Name | Semester | Theoretical | Practical | Credit | ECTS |
CMP6138 | Analysis of Algorithms | Spring | 3 | 0 | 3 | 6 |
This catalog is for information purposes. Course status is determined by the relevant department at the beginning of semester. |
Language of instruction: | English |
Type of course: | Departmental Elective |
Course Level: | |
Mode of Delivery: | Face to face |
Course Coordinator : | Dr. Öğr. Üyesi TEVFİK AYTEKİN |
Course Lecturer(s): |
Prof. Dr. NAFİZ ARICA |
Recommended Optional Program Components: | None |
Course Objectives: | Rigorous analysis of the time and space requirements of important algorithms, including worst case, average case, and amortized analysis will be done. Techniques include order-notation, recurrence relations, etc. Analysis of the key data structures: trees, hash tables, balanced tree schemes, priority queues, Fibonacci and binomial heaps will be presented. Algorithmic paradigms such as divide and conquer, dynamic programming will be introduced. Selected advanced algorithms will be explored. |
The students who have succeeded in this course; I. Apply basic algorithm analysis methodology II. Implement and analyze sorting algorithms III. Implement and analyze recurrent algorithms and tree structures IV. Model problems with heaps and queues and analyze runtime characteristics V. Model problems with graphs VI. Optimize problems with dynamic programming VII. Independently choose and investigate new algorithms when needed. |
Complexity of functions, sorting algorithms, recurrences, trees, heaps and priority queues, graph algorithms, dynamic programming, special techniques. |
Week | Subject | Related Preparation |
1) | Introduction | |
2) | Growth of functions | |
3) | Basic Sorting Algorithms | |
4) | Advanced Sorting Algorithms | |
5) | Recurrences | |
6) | Trees 1 | |
7) | Trees 2 | |
8) | Midterm | |
9) | Heaps and Priority Queues | |
10) | Graph Algorithms 1 | |
11) | Graph Algorithms 2 | |
12) | Dynamic Programming | |
13) | Special Techniques | |
14) | Project presentations |
Course Notes / Textbooks: | "Introduction to Algorithms" Thomas H. Cormen, The MIT Press |
References: |
Semester Requirements | Number of Activities | Level of Contribution |
Project | 1 | % 35 |
Midterms | 1 | % 25 |
Final | 1 | % 40 |
Total | % 100 | |
PERCENTAGE OF SEMESTER WORK | % 25 | |
PERCENTAGE OF FINAL WORK | % 75 | |
Total | % 100 |
Activities | Number of Activities | Duration (Hours) | Workload |
Course Hours | 14 | 3 | 42 |
Project | 1 | 72 | 72 |
Midterms | 1 | 40 | 40 |
Final | 1 | 40 | 40 |
Total Workload | 194 |
No Effect | 1 Lowest | 2 Low | 3 Average | 4 High | 5 Highest |
Program Outcomes | Level of Contribution | |
1) | Being able to develop and deepen their knowledge at the level of expertise in the same or a different field, based on undergraduate level qualifications. | 4 |
1) | Being able to independently carry out a work that requires expertise in the field. | 4 |
1) | To be able to supervise and teach these values by observing social, scientific, cultural and ethical values in the stages of collecting, interpreting, applying and announcing the data related to the field. | 4 |
1) | To be able to critically evaluate the knowledge and skills acquired in the field of expertise and to direct their learning. | 4 |
1) | To be able to interpret and create new knowledge by integrating the knowledge gained in the field with the knowledge from different disciplines, | |
1) | To be able to systematically transfer current developments in the field and their own studies to groups in and outside the field, in written, verbal and visual forms, by supporting them with quantitative and qualitative data. | 4 |
2) | To be able to comprehend the interdisciplinary interaction with which the field is related. | 5 |
2) | To be able to use the theoretical and applied knowledge at the level of expertise acquired in the field. | 5 |
2) | To be able to critically examine social relations and the norms that guide these relations, to develop them and take action to change them when necessary. | 5 |
2) | To be able to develop strategy, policy and implementation plans in the fields related to the field and to evaluate the obtained results within the framework of quality processes. | 5 |
2) | To be able to develop new strategic approaches for the solution of complex and unpredictable problems encountered in applications related to the field and to produce solutions by taking responsibility. | 5 |
3) | To be able to use the knowledge, problem solving and/or application skills they have internalized in their field in interdisciplinary studies. | 5 |
3) | Being able to lead in environments that require the resolution of problems related to the field. | 5 |
3) | To be able to solve the problems encountered in the field by using research methods. | 5 |