PAÜ .:. Eğitim Öğretim Bilgi Sistemi

COURSE INFORMATION

Course Code	Course Title	L+P Hour	Semester	ECTS
YBS 425	DISTRIBUTED ALGORITHMS	3 + 0	6th Semester	5

COURSE DESCRIPTION

Course Level	Bachelor's Degree
Course Type	Elective
Course Objective	Dağıtık hesaplama modelleri/ Senkron olma, haberleşme ve hata / Senkron mesaj geçiren dağıtık sistem / Hata olmayan sistemlerde algoritmalar / Lider eleme ve breadth-first arama algoritması / atomik commit programı / consensus problemi / Bizanslı generaller problemi / Asenkron mesaj geçiren dağıtık sistemler / Hata saptama / Mantıksal zaman / Lojik ve vektör saatlerin routing algoritmları
Course Content	Models of distributed computing / Synchrony, communication and failure concerns / Synchronous message-passing distributed systems / Algorithms in systems with no failures / Leader Election and Breadth-First Search algorithms / The atomic commit problem / Consensus problems / the Byzantine Generals Problem / Asynchronous message-passing distributed systems / Failure detectors / Logical time and vector clocks Routing algorithms
Prerequisites	No the prerequisite of lesson.
Corequisite	No the corequisite of lesson.
Mode of Delivery	Face to Face

COURSE LEARNING OUTCOMES

1	To understand and explain the concepts behind distributed algorithms
2	To assess the applicability of distributed algorithms to a particular circumstance

COURSE'S CONTRIBUTION TO PROGRAM

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION

Activities	Quantity	Duration (Hour)	Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)	14	3	42
Hours for off-the-classroom study (Pre-study, practice)	14	4	56
Mid-terms	1	15	15
Final examination	1	17	17
Total Work Load ECTS Credit of the Course			130 5

COURSE DETAILS

Select Year

This course is not available in selected semester.

L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes

Prospective Student