At the end of this course, the students; 1) Learn algorithm complexity anlaysis and how to compare algorithms 2) Get practice on time and space efficient programming 3) Get ability to use advanced data structures for effective algorithm development.
Cormen, Introduction to Algorithms, 2.Ed., MIT Press, 2001 Gilles Brassard, Paul Bratley. Fundamentals of algorithmics. Prentice Hall, 1996. D.R. Stinson, An introduction to the design and analysis of algorithms, Charles Babbage Research Centre, Winnipeg, Manitoba, 1987
PLANNED LEARNING ACTIVITIES AND TEACHING METHODS
Project
ASSESSMENT METHODS AND CRITERIA
Quantity
Percentage(%)
Mid-term
1
30
Project
1
30
Total(%)
60
Contribution of In-term Studies to Overall Grade(%)
60
Contribution of Final Examination to Overall Grade(%)
40
Total(%)
100
ECTS WORKLOAD
Activities
Number
Hours
Workload
Midterm exam
1
2
2
Preparation for Quiz
Individual or group work
14
11
154
Preparation for Final exam
1
69
69
Course hours
14
3
42
Preparation for Midterm exam
1
44
44
Laboratory (including preparation)
Final exam
1
2
2
Homework
Total Workload
313
Total Workload / 30
10,43
ECTS Credits of the Course
10
LANGUAGE OF INSTRUCTION
Turkish
WORK PLACEMENT(S)
No
KEY LEARNING OUTCOMES (KLO) / MATRIX OF LEARNING OUTCOMES (LO)