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