COURSE UNIT TITLE

: NETWORK ANALYSIS

Description of Individual Course Units

Course Unit Code Course Unit Title Type Of Course D U L ECTS
IST 4175 NETWORK ANALYSIS ELECTIVE 3 0 0 5

Offered By

Statistics

Level of Course Unit

First Cycle Programmes (Bachelor's Degree)

Course Coordinator

PROFESSOR DOCTOR UMAY ZEYNEP UZUNOĞLU KOÇER

Offered to

Statistics
Statistics(Evening)

Course Objective

This course focuses on an important class of optimization problems known as network flow problems that arise in the analysis of systems whose operation involves determining how to direct the flow of certain commodities through an underlying network. The course will address the modeling of such systems arising in a variety of settings and the development of efficient algorithms for performing the analysis.

Learning Outcomes of the Course Unit

1   Defining basic concepts of network flows
2   Using the methods which analyze systems in which there is a flow of products and/or services
3   Developing efficient algorithms for performing the analysis of network optimization problems
4   Modeling the systems mathematically which desires to optimize different objectives
5   Analyzing different algorithms which is developed for different objectives
6   Developing skills on project planning
7   Interpreting consequences obtained as a result of the different models
8   Developing solutions and suggestions to optimize the network

Mode of Delivery

Face -to- Face

Prerequisites and Co-requisites

None

Recomended Optional Programme Components

None

Course Contents

Week Subject Description
1 Introduction to network flow problems and basic definitions
2 The Shortest Path Problems: Dijkstra s algorithm
3 Floyd Algorithm
4 Maximum Flow Problems: Labeling algorithm
5 Maximum flow-minimum cut theorem and algorithms
6 Minimum cost network flows
7 Out-of-Kilter algorithm, Simpleks method on network
8 Recitation
9 Mid-term exam
10 Minimum Spanning Trees
11 Algorithms for minimum spanning tree problems
12 Project planning methods: CPM
13 Floats
14 Project planning methods: PERT
15 Usage of sources for project planning

Recomended or Required Reading

Textbook(s):
Ahuja R., Magnanti T, Orlin J., Network Flows, Theory, Algorithms, and Applications, Prentice Hall, 1993.
Supplementary Book(s):
1. H. Taha, Operations Research, McGraw Hill, 7th edition, 2003.
2. F.S. Hillier, G.J. Lieberman, Introduction to Operations Research, McGraw Hill, 1995.

Planned Learning Activities and Teaching Methods

Lecture and problem solving.

Assessment Methods

SORTING NUMBER SHORT CODE LONG CODE FORMULA
1 MTE MIDTERM EXAM
2 ASG ASSIGNMENT
3 FIN FINAL EXAM
4 FCG FINAL COURSE GRADE MTE * 0.40 + ASG * 0.10 + FIN * 0.50
5 RST RESIT
6 FCGR FINAL COURSE GRADE (RESIT) MTE * 0.40 + ASG * 0.10 + RST * 0.50


Further Notes About Assessment Methods

None

Assessment Criteria

Evaluation of midterm exam and homework.

Language of Instruction

Turkish

Course Policies and Rules

Attendance to at least 70% for the lectures is an essential requirement of this course and is the responsibility of the student. It is necessary that attendance to the lecture and homework delivery must be on time. Any unethical behavior that occurs either in presentations or in exams will be dealt with as outlined in school policy. You can find the undergraduate policy at http://web.deu.edu.tr/fen

Contact Details for the Lecturer(s)

DEU Fen Fakültesi Istatistik Bölümü
e-mail: cengiz.celikoglu@deu.edu.tr
Tel: 0232 301 85 50

Office Hours

To be announced.

Work Placement(s)

None

Workload Calculation

Activities Number Time (hours) Total Work Load (hours)
Lectures 14 3 42
Preparations before/after weekly lectures 12 2 24
Preparation for midterm exam 1 14 14
Preparation for final exam 1 23 23
Preparing assignments 1 4 4
Preparing presentations 1 2 2
Final 1 2 2
Midterm 1 2 2
TOTAL WORKLOAD (hours) 113

Contribution of Learning Outcomes to Programme Outcomes

PO/LOPO.1PO.2PO.3PO.4PO.5PO.6PO.7PO.8PO.9PO.10PO.11PO.12PO.13PO.14
LO.154
LO.2554
LO.3524
LO.45454
LO.5534
LO.65354
LO.755544
LO.855544