1. SECOND CYCLE - MASTER'S DEGREE
  2. THE GRADUATE SCHOOL OF NATURAL AND APPLIED SCIENCES
  3. COMPUTER ENGINEERING DEPARTMENT
  4. 1281 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 535MODELLING OF COMMUNICATION NETWORKS AND CONSEPT OF VULNERABILITY3 + 02nd Semester7,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.
Mode of Delivery Face to Face

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

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10PO 11PO 12
LO 001            
LO 002            
LO 003            
LO 004            
LO 005            
Sub Total            
Contribution000000000000

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)14570
Assignments5840
Mid-terms11515
Final examination12828
Total Work Load

ECTS Credit of the Course





195

7,5
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2023-2024 Spring1TUFAN TURACI
Details 2021-2022 Fall1TUFAN TURACI


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
CENG 535 MODELLING OF COMMUNICATION NETWORKS AND CONSEPT OF VULNERABILITY 3 + 0 1 Turkish 2023-2024 Spring
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Prof. Dr. TUFAN TURACI tturaci@pau.edu.tr FEN A0216 MUH A0257 %70
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
WeeksTopics
1 Graph concept and Importance of Graph Theory.
2 Constructing graphs. Havel-Hakim Theorem. Basic graph definitions.
3 Graph Operations. Tree definition and some Theorems. Induced subgraph.
4 Independence number, Covering number and Domination number in Graphs and Algorithms.
5 Coloring of graphs and Chromatic Polynomials.
6 Representing graphs on computer and Matrices.
7 Matching. Maximal matching, perfect matching, (augmenting path), assignment problem, the modeling of assignment problem with graphs and Hungarian algorithm.
8 Connectivity number in Networks and Algorithms.
9 Menger's Theorem and the Maximum flow problem.
10 The Concept of Vulnerability in Networks.
11 The vertex and edge Integrity in Networks and Algorithms.
12 The Thoughness number in Networks and Algorithms.
13 The Binding number in Networks and Algorithms.
14 The Rupture Degree in Networks and Algorithms.
Materials
Materials are not specified.
Resources
ResourcesResources Language
Chartrand, G.,Lesniak L. GraphsandDigraphs.WadsworthInc., ISBN : 0534063241.English
Bondy, J. A., 1976. “GraphTheorywith Applications”. ElsevierScienceLtd, ISBN: 0444194517.English
Buckley,F. AndHarary,F.,Distance in Graphs,AddisonWesleyPub.California.English
Ronald E. Prather, Discrete Mathematical StructersforComputerScience, HoughtonMiffinCompany,English
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam50Final Exam
Midterm Exam50Midterm Exam
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes