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
CSC 5042	THEORETICAL ASPECTS OF ALGORITHMS DESIGN AND ANALYSIS	ELECTIVE	3	0	0	8

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

PROFESSOR DOCTOR EFENDI NASIBOĞLU

Offered to

Computer Science
Ph.D. in Computer Science

Course Objective

The objectives of the course are to prove the correctness of simple algorithms, understand asymptotic notation, analyze simple and advanced algorithms and learn a variety of useful algorithms.

Learning Outcomes of the Course Unit

1	Have a good understanding of the role of algorithms in computing
2	Have a good understanding of complexity of algorithms.
3	Have a good understanding of elementary graph algorithms.
4	Have a good understanding of elementary matrix algorithms.
5	Have a good understanding of approximate algorithms.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week	Subject	Description
1	Role of algorithms in calculations
2	Complexity of algorithms
3	Growth of functions
4	Probability analysis and random processes
5	Advanced data structures. Trees. Stacks.
6	Graphs and their representations
7	Breadth-first search in graphs
8	Midterm exam
9	Depth-first search in graphs
10	Topological sort in graphs
11	Matrix operations
12	String operations
13	Approximate algorithms
14	Graph coverage problems

Recomended or Required Reading

Anany V. Levitin, Introduction to the Design and Analysis of Algorithms (2nd Edition) , Addison Wesley; 2 edition, 2006.
Jon Kleinberg, Eva Tardos, Algorithm Design , Addison Wesley, 2005.
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Cliford Stein, Introduction to Algorithms , MIT Press, 2001.

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format.

Assessment Methods

SORTING NUMBER	SHORT CODE	LONG CODE	FORMULA
1	PRJ	PROJECT
2	FCG	FINAL COURSE GRADE	PRJ * 1

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

Further Notes About Assessment Methods

None

Assessment Criteria

If needed, other assessment methods can be added to the table given below.

Language of Instruction

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

efendi.nasiboglu@deu.edu.tr

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities	Number	Time (hours)	Total Work Load (hours)
			0
			0
			0
Lectures	13	3	39
Preparation before/after weekly lectures	13	4	52
Preparation for Mid-term Exam	1	20	20
Preparation for Final Exam	1	30	30
Preparing Individual Assignments	6	8	48
Final	1	2	2
Mid-term	1	2	2
TOTAL WORKLOAD (hours)			193

Contribution of Learning Outcomes to Programme Outcomes

PO/LO	PO.1	PO.4	PO.5
LO.1	5	5	5
LO.2	5	5	5
LO.3	5	5	5
LO.4	5	5	5
LO.5	5	5	5

COURSE UNIT TITLE

DEGREE PROGRAMMES

Description of Individual Course Units

Offered By

Level of Course Unit

Course Coordinator

Offered to

Course Objective

Learning Outcomes of the Course Unit

Mode of Delivery

Prerequisites and Co-requisites

Recomended Optional Programme Components

Course Contents

Recomended or Required Reading

Planned Learning Activities and Teaching Methods

Assessment Methods

Further Notes About Assessment Methods

Assessment Criteria

Language of Instruction

Course Policies and Rules

Contact Details for the Lecturer(s)

Office Hours

Work Placement(s)

Workload Calculation

Contribution of Learning Outcomes to Programme Outcomes

CONTACT INFORMATION