| Course Unit Title | Course Unit Code | Type of Course Unit | Level of Course Unit | Year of Study | Semester | ECTS Credits |
|---|---|---|---|---|---|---|
| Algorithm Analysis | YZM210 | Compulsory | Bachelor's degree | 2 | Spring | 4 |
Name of Lecturer(s)
Associate Prof. Dr. Mehmet Zeki KONYAR
Learning Outcomes of the Course Unit
1) Defines basic data structures (such as tree, list, stack, queue, graph representation)
2) Compare main algorithmic design paradigms (such as divide and conquer, reduce and conquer, transform and conquer dynamic)
3) Solves general types of algorithmic problems
4) Applies basic algorithms and data structures to real-world problems
5) Applies algorithms, data structures and program relationships.
6) Analyzes the accuracy of the algorithm
Program Competencies-Learning Outcomes Relation
| Program Competencies | |||||||||||||
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | ||
| Learning Outcomes | |||||||||||||
| 1 | Low | High | Low | Low | Low | Low | No relation | High | High | Middle | Middle | Middle | |
| 2 | Middle | High | High | Middle | Low | Low | No relation | High | High | Middle | Middle | Middle | |
| 3 | Middle | High | High | Low | Low | Low | No relation | High | High | Middle | Middle | Middle | |
| 4 | Middle | High | High | Middle | Low | Low | No relation | High | High | Low | Low | Low | |
| 5 | Middle | High | High | Middle | No relation | Middle | No relation | High | High | Low | Low | Low | |
| 6 | Middle | High | High | Low | Low | Middle | No relation | High | High | Low | Low | Low | |
Mode of Delivery
Face to Face
Prerequisites and Co-Requisites
None
Recommended Optional Programme Components
Not Required
Course Contents
Algorithm activity, Analysis of computer algorithms, Classification, search, paging and parallelization, Analysis of mathematical algorithms, Game and puzzle, network algorithms and probability algorithms analysis, Divide and conquer and transform and manage approaches, Basic graph structures, functions and algorithms, Random algorithms and to teach analysis, dynamic programming algorithms.
Recommended or Required Reading
Planned Learning Activities and Teaching Methods
1) Lecture
2) Lecture
3) Question-Answer
4) Question-Answer
5) Problem Solving
6) Problem Solving
7) Project Based Learning
8) Project Based Learning
Assessment Methods and Criteria
Contribution of Semester Studies to Course Grade |
40% |
|||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|
|
||||||||||||
Contribution of Final Examination to Course Grade |
60% |
|||||||||||
Total | 100% | |||||||||||
Language of Instruction
English
Work Placement(s)
Not Required