|
|
| YZLM7070 | Graph Theory and Its Engineering Applications | 3+0+0 | ECTS:7.5 | | Year / Semester | Spring Semester | | Level of Course | Second Cycle | | Status | Elective | | Department | DEPARTMENT of SOFTWARE ENGINEERING | | Prerequisites and co-requisites | None | | Mode of Delivery | | | Contact Hours | 14 weeks - 3 hours of lectures per week | | Lecturer | Öğr. Gör. Dr Celal ATALAR | | Co-Lecturer | | | Language of instruction | Turkish | | Professional practise ( internship ) | None | | | | The aim of the course: | | Development of computer applications for modelable problems in many engineering branches.
Guidance entrepreneurial and innovative actions. |
| Programme Outcomes | CTPO | TOA | | Upon successful completion of the course, the students will be able to : | | | | PO - 1 : | Can develop software for solving various engineering branch problems | 1,3,4 | 1,3, | | PO - 2 : | Developing experience in software lifecycle, process modeling and project management | 1,3,4 | 1,3, | | PO - 3 : | Implement electrical network theory and analysis with graph analysis method. | 1,3,4 | 1,3, | | PO - 4 : | Explain the various concepts involved in graph theory | 1,3,4 | 1,3, | | CTPO : Contribution to programme outcomes, TOA :Type of assessment (1: written exam, 2: Oral exam, 3: Homework assignment, 4: Laboratory exercise/exam, 5: Seminar / presentation, 6: Term paper), PO : Learning Outcome | | |
| Dealing with the concepts involved in graph theory. To examine the concepts of spanning tree, branch and chord. Realizing the Winter algorithm. Detection of all spanning trees, minimum spanning tree and minimum cut set. Creating the fundamental relationship, circuit and cut matrices. Vector spaces associated with a graph, circuit and cut set subspaces and their relations. Prim and Kruskal algorithms. Solving the electrical network problem with graph analysis method. Design and implementation of a software for modeling and analysis of an electrical network. |
| |
| Course Syllabus | | Week | Subject | Related Notes / Files | | Week 1 | General definitions (Graph, node, edge, subgraph, isolated node, associated nodes) | | | Week 2 | Connected graphs, directed graphs, spanning subgraphs, circuit, cut, path, rank and nullity concepts | | | Week 3 | Node-edge relation, relation and fundamental relation matrices in directed graphs | | | Week 4 | Spanning tree, branch, chord concepts | | | Week 5 | Winter Algorithm | | | Week 6 | Detection of all spanning trees, minimum spanning tree and minimum cut set | | | Week 7 | Circuit-edge relationship, fundamental circuit matrix, cut-edge relationship, fundamental cut matrix concepts | | | Week 8 | Obtaining fundamental circuit and cut matrices over the fundamental relationship matrix | | | Week 9 | Midterm Exam | | | Week 10 | Vector spaces associated with a graph, circuit and cut set subspaces and their relations. | | | Week 11 | Prim and Kruskal Algorithms | | | Week 12 | Modeling of DC electrical network, electrical network equations and introduction to software implementation. Spanning tree, fundamental circuit and cut matrices and independent voltage and current equations relations | | | Week 13 | Fundamental circuit impedance and admittance matrices, fundamental circuit voltage and current source vectors | | | Week 14 | Loop and Cut System equations | | | Week 15 | Obtaining edge voltage and edge current vectors by solving equation systems | | | Week 16 | Final Exam | | | |
| 1 | Deo, N. 2016; Graph Theory with Applications to Engineering and Computer Science, Dover Publications | | | |
| 1 | Chen, W. 1997; Graph Theory and Its Engineering Applications, World Scientific | | | |
| Method of Assessment | | Type of assessment | Week No | Date | Duration (hours) | Weight (%) | | Mid-term exam | 9 | | 1 | 20 | | Homework/Assignment/Term-paper | 15 | | | 30 | | End-of-term exam | 16 | | 2 | 50 | | |
| Student Work Load and its Distribution | | Type of work | Duration (hours pw) | No of weeks / Number of activity | Hours in total per term | | Yüz yüze eğitim | 3 | 14 | 42 | | Sınıf dışı çalışma | 3 | 15 | 45 | | Arasınav için hazırlık | 4 | 2 | 8 | | Arasınav | 2 | 1 | 2 | | Proje | 5 | 15 | 75 | | Dönem sonu sınavı için hazırlık | 4 | 6 | 24 | | Dönem sonu sınavı | 2 | 1 | 2 | | Total work load | | | 198 |
|