Dokuz Eylül University Information Package / Courses Catalog

Description of Individual Course Units

Course Unit Code	Course Unit Title	Type Of Course	D	U	L	ECTS
CME 2204	ALGORITHM ANALYSIS	COMPULSORY	2	2	0	6

Offered By

Computer Engineering

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSOCIATE PROFESSOR ZERRIN IŞIK

Offered to

Computer Engineering

Course Objective

Main goal of this course is to explain advanced algorithm design and analysis techniques, search and sorting algorithms, time complexity computations, NP-completeness, linear and dynamic programming.

Learning Outcomes of the Course Unit

1	Learn algorithm analysis methods and apply complexity analysis for a given algorithm.
2	Learn and implement fundamental sorting algorithms.
3	Design a modular solution for a problem by decomposing it into smaller sub-problems.
4	Learn amortized analysis.
5	Apply dynamic programming and greedy strategies in real-life problems.
6	Apply approximation methods in real-life problems.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

CME 1212 - ALGORITHMS AND PROGRAMMING II

Recomended Optional Programme Components

None

Course Contents

Week	Subject	Description
1	Review of Sets, Mathematical Induction and Recursion
2	Insertion sort, Divide and Conquer Design, Merge sort
3	Recurrences, Recurrence Solving with Substitution Method
4	Recurrence Solving with Recursion Tree and Master Method
5	Heapsort
6	Quicksort, Binary Sort
7	Linear-Time Sorting
8	Midterm Exam
9	Dynamic Programming - Intro
10	Dynamic Programming - Examples
11	String matching problem
12	Greedy Algorithms
13	Greedy Algorithms - Examples
14	Approximation Algorithms

Recomended or Required Reading

Textbook:
Introduction To Algorithms, Third Edition, Cormen TH, Leiserson CE, Rivest RL, and Stein C. The MIT Press, 2009.

Planned Learning Activities and Teaching Methods

Lectures / Presentation
Guided problem solving
Laboratory exercises
Homeworks

Assessment Methods

SORTING NUMBER	SHORT CODE	LONG CODE	FORMULA
1	ASG	ASSIGNMENT
2	MTE	MIDTERM EXAM
3	FIN	FINAL EXAM
4	FCGR	FINAL COURSE GRADE (RESIT)	ASG * 0.40 + MTE * 0.20 + FIN * 0.40
5	RST	RESIT
6	FCGR	FINAL COURSE GRADE (RESIT)	ASG * 0.40 + MTE * 0.20 + RST * 0.40

*** Resit Exam is Not Administered in Institutions Where Resit is not Applicable.

Further Notes About Assessment Methods

In-semester studies will be evaluated with a midterm exam and several laboratory / homework activities.
The final exam will cover all course topics.

Assessment Criteria

All the following criteria will be evaluated with exams, homework and laboratory exercises.
1. Learnability of basic concepts will be evaluated with the correct understanding of given problem.
2. Students should able to analyze the complexity of a given algorithm by applying any technique taught in the course.
3. Optimal solution strategies will be asked to find a solution for real-life problems.
4. Producing correct results of programs that developed as solution strategies will be expected.

Language of Instruction

English

Course Policies and Rules

1. Participation is mandatory (%70 theoretical courses and 80% practices)
2. Every cheating attempt will be finalized with disciplinary action.
3. Instructor reserves the right to quizzes. Notes should be added to these examinations, midterm and final exam grades.

Contact Details for the Lecturer(s)

Assoc. Prof. Dr. Zerrin IŞIK
Dokuz Eylul University
Department of Computer Engineering
Tinaztepe Campus 35160 BUCA/IZMIR
Tel: 0232 3017413
E-mail: zerrin@cs.deu.edu.tr

Office Hours

TBA

Work Placement(s)