Centre for Computer Technology ICT114 Mathematics for Computing Week 5 Queueing Theory Algorithms and Flowchart
Welcome message from author
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Centre for Computer Technology
ICT114 Mathematics for ComputingWeek 5
Queueing Theory Algorithms and Flowcharts
ObjectivesReview Week4 Queueing Process Queue Characteristics Kendalls Notation Erlang Distribution Algorithms FlowchartsMay 29, 2012
Discrete Probability Distributionf(x) is a probability function if1.
f(x) 0 f(x) = 1x
2.
sum is taken over all possible values of xMay 29, 2012
Distribution function for a Discrete Random VariableThe distribution function for X can be obtained from the probability function for all x in (-, ), 0 -
Related Documents
