• 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 5031 GRAPH THEORY TECHNIQUES IN MATHEMATICAL MODELLING ELECTIVE 3 0 0 8

Offered By

Graduate School of Natural and Applied Sciences

Level of Course Unit

Third Cycle Programmes (Doctorate Degree)

Course Coordinator

ASSOCIATE PROFESSOR FIDAN NURIYEVA

Offered to

Computer Science Ph.D. in Computer Science

Course Objective

The aim of this course is to introduce to students the extremal problems and special graphs.

Learning Outcomes of the Course Unit

1   Modeling real world problems with linear programming and graph. 2   Solving these problems with graph.

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description 1 Absolute centers 2 Algorithms for absolute center 3 Absolute p-centers 4 An algorithm for finding Absolute p-centers absolute p-centers 5 Location of median and p-median 6 Methods for the median and p-median 7 Trees and spanning tree 8 Midterm exam 9 The shortest spanning tree of a graph 10 Steiner problem 11 Linear programming model of shortest path problem 12 The shortest paths between all pairs of vertices and algorithms 13 The shortest problem two specified vertices and algorithms 14 Matching and transportation

Recomended or Required Reading

Textbook(s): 1. Chiristofides, N., Graph Theory An Algorithmic Approach , Academic Press, London,(1975). Supplementary Book(s): 1. Taha, H., Operation Research , Printice Hall, Fayetville, (1995)

Planned Learning Activities and Teaching Methods

The course is taught in a lecture, class presentation and discussion format. Besides the taught lecture, group presentations are to be prepared by the groups assigned and presented in a discussion session. In some weeks of the course, results of the homework given previously are discussed.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA 1 ASG ASSIGNMENT 2 MTE MIDTERM EXAM 3 FIN FINAL EXAM 4 FCG FINAL COURSE GRADE ASG * 0.30 + MTE * 0.30 + FIN * 0.40 5 RST RESIT 6 FCGR FINAL COURSE GRADE (RESIT) ASG * 0.30 + MTE * 0.30 + RST * 0.40 *** 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)

fidan.nuriyeva@deu.edu.tr

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours) Lectures 13 3 39 Preparation for midterm exam 1 20 20 Preparation for final exam 1 20 20 Preparing assignments 2 20 40 Preparing presentations 2 15 30 Preparations before/after weekly lectures 13 4 52 Final 1 2 2 Midterm 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 5 5 5 5 LO.2 5 5 5 5