638-0907/02 – System Analysis (SA)
| Gurantor department | Department of Automation and Computing in Industry | Credits | 10 |
| Subject guarantor | prof. Ing. Miluše Vítečková, CSc. | Subject version guarantor | prof. Ing. Miluše Vítečková, CSc. |
| Study level | postgraduate | Requirement | Choice-compulsory |
| Year | | Semester | winter + summer |
| | Study language | Czech |
| Year of introduction | 2013/2014 | Year of cancellation | |
| Intended for the faculties | FMT, HGF | Intended for study types | Doctoral |
Subject aims expressed by acquired skills and competences
This course provides doctoral students with the basics of optimal decision making in the use of applied probability theory, graphs and queuing.
Teaching methods
Individual consultations
Project work
Summary
Compulsory literature:
4. RARDIN R. L. Optimization in Operations Research. Prentice Hall, 2005.
5. KENDALL K., KENDALL J. System Analysis and Design. Pearson, 2013.
Recommended literature:
3. HILLIER F. S., LIBERMAN G. J. Introduction to Operational Research. Mc Graw Hill, 2005.
4. YEATES D., WAKEFIELD T. System Analysis and Design. Financial Times/Prentice Hall, 2003.
Way of continuous check of knowledge in the course of semester
E-learning
Other requirements
Elaboration of seminar work on a given topic.
Prerequisities
Subject has no prerequisities.
Co-requisities
Subject has no co-requisities.
Subject syllabus:
• Introduction to the topic and content of the studied subject. The theory of probability, conditional probability, relations between phenomena.
• The probability of the hypothesis, repeated independent experiments.
• Continuous random variables, characteristics, classification.
• Discrete random variables, characteristics, classification.
• Transformation of random variables, random variables.
• Use of the theory of random variables in technique.
• Graph theory, basic concepts and principles.
• Minimum and maximum path in the graph algorithms solutions.
• Critical path method - CPM and PERT, solution algorithms.
• Problems postman, Salesman, tree problem solving.
• Throughput transport network, solution algorithms.
• Queueing systems. The system M / M / 1st
• The M / M / n.
• The use of queuing theory in technology.
Conditions for subject completion
Occurrence in study plans
Occurrence in special blocks
Assessment of instruction
Předmět neobsahuje žádné hodnocení.