COURSE UNIT TITLE

: DISTRUBITED ALGORITHMS

DEGREE PROGRAMMES

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
BIL 4102 DISTRUBITED ALGORITHMS ELECTIVE 3 0 0 5

Offered By

Computer Science

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

ASSISTANT PROFESSOR ERDEM ALKIM

Offered to

Computer Science

Course Objective

The goal of this course is to introduce a design and implementation study of distributed algorithms, where data, computation, and resources are distributed across a network. The course will take a formal approach to algorithmic analysis.

Learning Outcomes of the Course Unit

1   Have a basic knowledge of data distribution algorithms.
2   Have a basic knowledge of fault tolerance and recovery.
3   Have a basic knowledge of topology discovery.
4   Have ability to prove the correctness of distributed algorithms.
5   Have ability to analyze the complexity of distributed algorithms.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction and Graph Theory
2 Graph Types, Introduction to Models
3 Communication Models
4 Events, Fairness, Invariants
5 Causality, Wave algorithms
6 Waves Algorithms (continue )
7 Traversal, Depth Fist Search (DFS)
8 Midterm exam
9 Balanced Sliding Window
10 Balanced Sliding Window (continue )
11 Timer Window
12 Timer Window (continue )
13 Routing algorithms
14 Routing algorithms (continue )

Recomended or Required Reading

Textbook(s):
Gerard Tel. Introduction to Distributed Algorithms. Cambridge University Press, Cambridge, UK, 2nd edition, 2000.
Supplementary Book(s):
Sukumar Ghosh, Chapman and Hall, Distributed Systems : An Algorithmic Approach, 2006.

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format. Besides the taught lecture, group presentations are to be prepared by the groups assigned and presented in a discussion session. In some weeks of the course, results of the homework given previously are discussed.

Assessment Methods

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


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

Further Notes About Assessment Methods

None

Assessment Criteria

To be announced.

Language of Instruction

Turkish

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

efendi.nasibov@deu.edu.tr
murat.berberler@deu.edu.tr

Office Hours

Will be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 13 3 39
Preparations before/after weekly lectures 12 3 36
Preparation for midterm exam 1 13 13
Preparation for final exam 1 20 20
Preparing assignments 2 10 20
Final 1 2 2
Midterm 1 2 2
TOTAL WORKLOAD (hours) 132

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13
LO.1545355455
LO.255525455
LO.3554355
LO.455332255
LO.54554345

CONTACT INFORMATION
Dokuz Eylül Üniversitesi Cumhuriyet Bulvarı No: 144 35210 Alsancak / İZMİR
Phone: +90(232) 412 12 12 - Fax: +90 (232) 464 81 35

Copyright 2015 DEÜ. BİD

HOME / ABOUT US / DEGREE PROGRAMMES / GENERAL INFORMATION FOR STUDENTS / INTERNATIONAL RELATIONS