• HOME
• ABOUT US
  • Name Address
  • General Description
  • Governance
  • Academic Calendar
  • Degree Programmes
  • List of Programmes in English
  • General Admission and Registration Procedures
  • Credit Mobility and Recognition of Prior Learning
  • ECTS Credit Allocation
  • Academic Guidance
  • Contacts
• Degree Programmes
  • Third Cycle Programmes (Doctorate Degree)
  • Second Cycle Programmes (Master's Degree)
  • First Cycle Programmes (Bachelor's Degree)
  • Short Cycle Programmes (Associate's Degree)
• GENERAL INFORMATION FOR STUDENTS
  • Cost of Living
  • Accommodation
  • Meals
  • Medical Facilities
  • Facilities for Disabled Students
  • Insurance
  • Financial Supports
  • Student Affairs Office
  • Practical Information for International Students
  • Language Courses
  • Work Placement Possibilities
  • Sports, Social and Cultural Facilities
  • Student Associations and Clubs
  • About İzmir - Turkey
• INTERNATIONAL RELATIONS
  • International Relations Office
  • Registration Procedures
  • Agreements
  • Coordinators
  • Documents
  • List of Programmes in English
  • ECTS / DS Labels

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS CSC 5052 COMMUNICATION NETWORKS AND VULNERABILITY ELECTIVE 3 0 0 8

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Second Cycle Programmes (Master's Degree)

Course Coordinator

ASSOCIATE PROFESSOR ZEYNEP NIHAN BERBERLER

Offered to

Computer Science Ph.D. in Computer Science

Course Objective

To introduce the vulnerability parameters which gives the vulnerability values of communication networks modelled by graphs.

Learning Outcomes of the Course Unit

1   Have a knowledge of basic concepts of communication networks. 2   Have a knowledge of concept of vulnerability. 3   Have a knowledge of the measures for determining the vulnerability. 4   Be able to make comparisons between different vulnerability measurements. 5   To be able to develop an algorithmic approach to the measurement of vulnerability parameters.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Communication networks 2 Modeling of communication networks 3 Vulnerability in communication networks 4 Vertex and edge connectivity in communication networks 5 Vertex and edge integrity 6 Binding number 7 Scattering number 8 Rupture degree 9 Midterm exam 10 Isolated rupture degree 11 Residual closeness 12 Link residual closeness 13 Relationships between the vulnerability parameters 14 Algorithmic approach for computing the vulnerability measures

Recomended or Required Reading

Textbook(s): West, B. Douglas, Introduction to Graph Theory, Prentice Hall, ISBN: 0130144002, 2001. Supplementary Book(s): Buckley, F., Harary F., Distance in Graphs, Perseus Books, ISBN: 0201095912, 1990.

Planned Learning Activities and Teaching Methods

The course is given by the lecturer generally, some periods of the course will continue interactively and the student will hold the project presentation.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 PRS PRESENTATION 2 ASG ASSIGNMENT 3 FCG FINAL COURSE GRADE PRS * 0.50 + ASG * 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

English

Course Policies and Rules

To be announced.

Contact Details for the Lecturer(s)

zeynep.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 13 4 52 Project Preparation 1 30 30 Preparing presentations 1 30 30 Preparing assignments 2 25 50 Final Assignment 1 2 2 Project Assignment 1 2 2 TOTAL WORKLOAD (hours) 205

Contribution of Learning Outcomes to Programme Outcomes

PO/LO PO.1 PO.2 PO.3 PO.4 PO.5 PO.6 PO.7 PO.8 PO.9 PO.10 LO.1 4 4 3 4 3 5 4 5 4 LO.2 4 4 5 3 5 3 5 4 4 LO.3 4 5 3 3 3 3 3 5 5 5 LO.4 5 4 5 3 5 5 3 3 4 4 LO.5 3 5 4 5 3 3 5 4 4 4