COURSE UNIT TITLE

: THEORETICAL ASPECTS OF ALGORITHMS DESIGN AND ANALYSIS

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

ASSISTANT PROFESSOR CAN ATILGAN

Offered to

Ph.D. in Computer Science (English)
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 Introduction
2 Complexity of algorithms
3 Growth of functions
4 Probability analysis and random processes
5 Graphs and their representations
6 Advanced data structures
7 Advanced data structures cntd.
8 Review and Excercises
9 Search in graphs
10 Sort in graphs
11 Matrix operations
12 String operations
13 Approximate algorithms
14 Project presentations

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

Project evaluation

Language of Instruction

English

Course Policies and Rules

To be announced

Contact Details for the Lecturer(s)

can.atilgan@deu.edu.tr

Office Hours

To be announced

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 14 3 42
Preparation before/after weekly lectures 13 4 52
Project Preparation 1 80 80
Preparing presentations 1 20 20
TOTAL WORKLOAD (hours) 194

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10
LO.1555
LO.2555
LO.3555
LO.4555
LO.5555