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.
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.