1. FIRST CYCLE - BACHELOR'S DEGREE
  2. FACULTY OF ENGINEERING
  3. COMPUTER ENGINEERING DEPARTMENT
  4. 253 Computer Engineering
Course Information Course Learning Outcomes Course's Contribution To Program ECTS Workload Course Details
Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
CENG 469DISTRIBUTED ALGORITHMS3 + 08th Semester5

COURSE DESCRIPTION
Course Level Bachelor's Degree
Course Type Elective
Course Objective In this course, appreciation for the challenges of designing algorithms for distributed systems, familiarity with several classical models, problems, and algorithms including consensus, commit, logical time, reliable broadcast, and routing, ability to reason about distributed algorithm correctness and performance are aimed.
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
1to understand and explain the concepts behind distributed algorithms
2o assess the applicability of distributed algorithms to a particular circumstance

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10PO 11PO 12
LO 001222233334444
LO 002555533322211
Sub Total777766656655
Contribution444433333333

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)14342
Hours for off-the-classroom study (Pre-study, practice)14228
Mid-terms13030
Final examination13030
Total Work Load

ECTS Credit of the Course





130

5
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2023-2024 Spring1MUSTAFA TOSUN
Details 2022-2023 Fall1ELİF HAYTAOĞLU


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
CENG 469 DISTRIBUTED ALGORITHMS 3 + 0 1 Turkish 2023-2024 Spring
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Res. Assist. MUSTAFA TOSUN mustafatosun@pau.edu.tr SABF C0206 %
Goals In this course, appreciation for the challenges of designing algorithms for distributed systems, familiarity with several classical models, problems, and algorithms including consensus, commit, logical time, reliable broadcast, and routing, ability to reason about distributed algorithm correctness and performance are aimed.
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
Topics
Materials
Materials are not specified.
Resources
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam60Final Exam
Midterm Exam40Midterm Exam
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes