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

COURSE INFORMATION

Course Code	Course Title	L+P Hour	Semester	ECTS
CENG 535	MODELLING OF COMMUNICATION NETWORKS AND CONSEPT OF VULNERABILITY	3 + 0	2nd Semester	7,5

COURSE DESCRIPTION

Course Level	Master's Degree
Course Type	Elective
Course Objective	The aim of this course, to model networks with the graphs and to examine the vulnerability values that gives the value of reliabilty for these networks.
Course Content	Basic definitions of graphs, Modelling of communication networks, Network flows, Connectivity, k- Connectivity, k- edge Connectivity, Menger’s Theorem, Maximum flow problem, Vulnerability of communication networks, vulnerability measures and algorithms, Vertex and edge integrity numbers, thoughness number, binding number, Rupture degree.
Prerequisites	No the prerequisite of lesson.
Corequisite	No the corequisite of lesson.

COURSE LEARNING OUTCOMES

1	Expresses the basic definitions and theorems of graphs.
2	Models Communication Networks.
3	Applies the Menger’s Theorem.
4	Expresses consept of vulerability in graphs.
5	Computes the vulnerability parameters and uses theirs algorithms.

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	3	42
Mid-terms	1	21	21
Final examination	1	40	40
Report / Project	1	50	50
Total Work Load ECTS Credit of the Course			195 7,5

COURSE DETAILS

Select Year

Course Details

Course Code	Course Title	L+P Hour	Course Code	Language Of Instruction	Course Semester	Mode of Delivery
CENG 535	MODELLING OF COMMUNICATION NETWORKS AND CONSEPT OF VULNERABILITY	3 + 0	1	Turkish	2025-2026 Spring	Face to Face

Course Coordinator	E-Mail	Phone Number	Course Location	Attendance
Prof. Dr. TUFAN TURACI	tturaci@pau.edu.tr		Course location is not specified.	%

Goals		The aim of this course, to model networks with the graphs and to examine the vulnerability values that gives the value of reliabilty for these networks.
Content		Basic definitions of graphs, Modelling of communication networks, Network flows, Connectivity, k- Connectivity, k- edge Connectivity, Menger’s Theorem, Maximum flow problem, Vulnerability of communication networks, vulnerability measures and algorithms, Vertex and edge integrity numbers, thoughness number, binding number, Rupture degree.

Topics

Materials

Materials are not specified.

Resources

Course Assessment

Assesment Methods	Percentage (%)	Assesment Methods Title
Final Exam	50	Final Exam
Midterm Exam	50	Midterm Exam

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

Prospective Student