545-0407/05 – System Analysis (SA)
Gurantor department | Department of Economics and Control Systems | Credits | 5 |
Subject guarantor | Ing. Jiří Švub, Ph.D. | Subject version guarantor | Ing. Jiří Švub, Ph.D. |
Study level | undergraduate or graduate | Requirement | Compulsory |
Year | 2 | Semester | summer |
| | Study language | Czech |
Year of introduction | 2015/2016 | Year of cancellation | 2020/2021 |
Intended for the faculties | HGF | Intended for study types | Bachelor |
Subject aims expressed by acquired skills and competences
Students learn to use the instrument used for formalized analysis of the structure and behavior.
Teaching methods
Lectures
Tutorials
Project work
Summary
Systems analysis is a summary of the logical and formalized procedures
used for detailed examination of the system in terms of its structure and behavior. The subject of the course are application exercises based on graph theory and tools of structured analysis.
Compulsory literature:
1. Glover, Duncan, Sarma a kol.: Power System Analysis and Design. Thomson Engineering 2011. ISBN 9781111425791 1111425795.
Recommended literature:
Way of continuous check of knowledge in the course of semester
E-learning
Other requirements
No further requirements.
Prerequisities
Subject has no prerequisities.
Co-requisities
Subject has no co-requisities.
Subject syllabus:
1.System Analysis topic of interest. System approach systems thinking in solving classical problems of system analysis. Hard and soft systems in light of system analysis.
2.Basic concepts of graph theory I - a simple graph, multigraph, pseudograph, directed, undirected, partially oriented, matrix adjacency and incidence matrix, subgraph.
3.Basic terms graph theory II - a factor graph, sequence, trail, path,
link graph, tree, spanning tree.
4.Interface problem, the regularity of the links in the system.
5.Path in the system - to find all paths between two elements in
system, determine the length of the identified paths, determining the shortest (longest) path between two elements of the system, computation complexity of the system.
6.Predecessors and successors, to find the paths between the two elements
system using the reverse algorithm.
7.Feedback cycle in the system, types of cyclic connection
identification cycles through the adjacency matrix..
8.The minimum distance, Dantzig algorithm. Role of minimum
(maximum) spanning tree.
9. Hamiltonian paths in graphs. Eulerian paths in graphs.
10. Petri nets - a description of the network structure, simulation of dynamic system behavior.
11. Graph theory in Project management, CPM method.
12. Topological decomposition of the system - minimum cut algorithm according to Vlček
13.Cluster analysis for the system decomposition, matrix of observations.
14.Techniques for structured analysis of information system.
Conceptual diagram. Yourdon structured method.
Conditions for subject completion
Occurrence in study plans
Occurrence in special blocks
Assessment of instruction