Course Information


Course Information
Course Title Code Semester L+U Hour Credits ECTS
ANALYSIS OF ALGORITHMS YMH317 5. Semester 3 + 0 3.0 3.0

Prerequisites None

Language of Instruction Turkish
Course Level Bachelor's Degree
Course Type Compulsory
Mode of delivery
Course Coordinator
Instructors Şahin EMRAH
Assistants
Goals The purpose of the course is to give students a thorough understanding the methods of design of algorithms
Course Content Analysis of algorithms, Methods of design of algorithms (Brute Force Method, Divide and Conquer Method, Decrease and Conquer Method, Transform and Conquer Method), Advanced Data Structures (Balanced trees: AVL trees, Red black trees, Multiways trees
Learning Outcomes 1) Learns Algorithm Analysis
2) Learns Algorithm Design
3) Learns Advanced Data Structures

Weekly Topics (Content)
Week Topics Teaching and Learning Methods and Techniques Study Materials
1. Week Introduction to Algorithms Lecture
Brainstorming
Problem Based Learning 		Presentation (Including Preparation Time)
2. Week Fundamentals of Algorithm Analysis Lecture
Brainstorming
Problem Based Learning 		Presentation (Including Preparation Time)
3. Week Recurrences Lecture
Brainstorming
Problem Based Learning 		Presentation (Including Preparation Time)
4. Week Designing Brute Force Algorithms Lecture
Brainstorming
Problem Based Learning 		Presentation (Including Preparation Time)
5. Week Designing Divide and Conquer Algorithms Lecture
Brainstorming
Problem Based Learning 		Presentation (Including Preparation Time)
6. Week Divide and Conquer Applications Lecture
Brainstorming
Problem Based Learning 		Presentation (Including Preparation Time)
7. Week Midterm Lecture
Brainstorming
Problem Based Learning 		Presentation (Including Preparation Time)
8. Week Designing Reduce and Conquer Algorithms Lecture
Brainstorming
Problem Based Learning 		Presentation (Including Preparation Time)
9. Week Selection Problem Lecture
Brainstorming
Problem Based Learning 		Presentation (Including Preparation Time)
10. Week Designing Transform and Conquer Algorithms Lecture
Brainstorming
Problem Based Learning 		Presentation (Including Preparation Time)
11. Week AVL Trees Lecture
Brainstorming
Problem Based Learning 		Presentation (Including Preparation Time)
12. Week Red-Black Trees Lecture
Brainstorming
Problem Based Learning 		Presentation (Including Preparation Time)
13. Week Multi-Way Trees Lecture
Brainstorming
Problem Based Learning 		Presentation (Including Preparation Time)
14. Week Balanced Tree Applications Lecture
Brainstorming
Problem Based Learning 		Presentation (Including Preparation Time)

Sources Used in This Course
Recommended Sources
Anany Levitin, Introduction to the Design and Analysis of Algorithms, Pearson, 3rd Ediiton, 2003
T.Cormen, C. Leiserson, R. Rivest, C. Stein, Introduction to Algorithms, The Second Edition, MIT Press, 2003

Relations with Education Attainment Program Course Competencies
Program RequirementsContribution LevelDK1DK2DK3
PY15000
PY25000
PY35000

*DK = Course's Contrubution.
0 1 2 3 4 5
Level of contribution None Very Low Low Fair High Very High
.

ECTS credits and course workload
Event Quantity Duration (Hour) Total Workload (Hour)
Course Duration (Total weeks*Hours per week) 14 4
Work Hour outside Classroom (Preparation, strengthening) 14 1
Midterm Exam 1 1
Time to prepare for Midterm Exam 1 10
Final Exam 1 2
Time to prepare for Final Exam 1 10
Total Workload
Total Workload / 30 (s)
ECTS Credit of the Course
Quick Access Hızlı Erişim Genişlet
Course Information
  • Course Information
  • Weekly Topics (Content)
  • Sources Used in This Course
  • Relations with Education Attainment Program Course Competencies
  • ECTS credits and course workload