ALGORITHM DESIGN AND ANALYSIS

BİL567

Course Code: BİL567
Semester: -
Theory+Practice: 3 + 0
ECTS: 10

Course Type

Compulsory Course

Course Level

Master's Degree With Thesis

Year of Study

Semester

ECTS

Name of Lecturer(s)

Assistant Professor Didem Ölçer

Learning Outcomes

At the end of this course, the students;

Learn algorithm complexity anlaysis and how to compare algorithms
Get practice on time and space efficient programming
Get ability to use heuristics in problem solving

Mode of Delivery

Face to face

Prerequisites

Recommended Optional Programme Components

None

Course Description

Algorithm complexity. Asymptotic notation. Searching. Sorting. Divide-and-Conquer. Dynamic programming. Greedy methods and applications. Graph theory. Shortest paths. Minimum spanning tree. Heuristics. NP hardness and completeness. Recent challenges.

Course Contents

WEEK	TOPICS
1^st Week	Introduction to Algorithms
2^nd Week	Algorithm Analysis
3^rd Week	Search Algorithms / Sort Algorithms
4^th Week	Sort Algorithms
5^th Week	Algorithm Design Approaches (Greedy ? Dynamic)
6^th Week	Introduction to Graph Data Structure
7^th Week	Graph Algorithms (BFS, DFS)
8^th Week	Midterm
9^th Week	Minimum Spanning Tree Algorithms (Prim and Kruskal)
10^th Week	Shortest path Algorithms (Dijkstra, Bellmann Ford)
11^th Week	Algorithm Design Approaches (Backtracking ? Branch and Bound)
12^th Week	Algorithm Design Approaches (Backtracking ? Branch and Bound)
13^th Week	Presentations
14^th Week	Presentations
15^th Week	Presentations

Recommended or Required Reading

1. Cormen, Introduction to Algorithms, 2.Ed., MIT Press, 2001
2. Gilles Brassard, Paul Bratley. Fundamentals of algorithmics. Prentice Hall, 1996.
3. 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 Allocated Based on Student Workload

Activities	Quantity	Duration (Hour)	Total Workload (Hour)
Midterm exam	1	2	2
Preparation for Quiz
Individual or group work
Preparation for Final exam	1	70	70
Course hours	14	3	42
Preparation for Midterm exam	1	50	50
Laboratory (including preparation)
Final exam	1	2	2
Homework	2	40	80
Presentation (including preperation)	1	40	40
Total Work Load			286
Total Work Load / 30 (h)			9.53
ECTS Credit of the Course			10

Language of Instruction

Turkish

Work Placement(s)

Programme Qualifications / Learning Outcomes

	LO1	LO2	LO3
K1	X	X	X
K2
K3	X	X	X
K4	X	X	X
K5	X	X	X
K6	X	X	X
K7
K8	X	X	X
K9
K10
K11
K12