Probability and Queueing Theory detail syllabus for Computer Science & Engineering (Cse), 2017 regulation is taken from Anna University official website and presented for students of Anna University. The details of the course are: course code (MA8402), Category (BS), Contact Periods/week (4), Teaching hours/week (4), Practical Hours/week (0). The total course credits are given in combined syllabus.
For all other cse 4th sem syllabus for be 2017 regulation anna univ you can visit Cse 4th Sem syllabus for BE 2017 regulation Anna Univ Subjects. The detail syllabus for probability and queueing theory is as follows.”
Course Objective:
- To provide necessary basic concepts in probability and random processes for applications such as random signals, linear systems in communication engineering.
- To understand the basic concepts of probability, one and two dimensional random variables and to introduce some standard distributions applicable to engineering which can describe real life phenomenon.
- To understand the basic concepts of random processes which are widely used in IT fields.
- To understand the concept of queueing models and apply in engineering.
- To understand the significance of advanced queueing models.
- To provide the required mathematical support in real life problems and develop probabilistic models which can be used in several areas of science and engineering.
Unit I
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Unit II
Two – Dimensional Random Variables
Joint distributions – Marginal and conditional distributions – Covariance – Correlation and linear regression – Transformation of random variables – Central limit theorem (for independent and identically distributed random variables).
Unit III
Random Processes
Classification – Stationary process – Markov process – Poisson process – Discrete parameter Markov chain – Chapman Kolmogorov equations – Limiting distributions.
Unit IV
For complete syllabus and results, class timetable and more pls download iStudy. Its a light weight, easy to use, no images, no pdfs platform to make students life easier.
Unit V
Advanced Queueing Models
Finite source models – M/G/1 queue – Pollaczek Khinchin formula – M/D/1 and M/EK/1 as special cases – Series queues – Open Jackson networks.
Course Outcome:
Upon successful completion of the course, students should be able to:
- Understand the fundamental knowledge of the concepts of probability and have knowledge of standard distributions which can describe real life phenomenon.
- Understand the basic concepts of one and two dimensional random variables and apply in engineering applications.
- Apply the concept of random processes in engineering disciplines.
- Acquire skills in analyzing queueing models.
- Understand and characterize phenomenon which evolve with respect to time in a probabilistic manner
Text Books:
- Gross, D., Shortle, J.F, Thompson, J.M and Harris. C.M., Fundamentals of Queueing Theory”, Wiley Student 4th Edition, 2014.
- Ibe, O.C., Fundamentals of Applied Probability and Random Processes”, Elsevier, 1st Indian Reprint, 2007.
References:
- Hwei Hsu, “Schaums Outline of Theory and Problems of Probability, Random Variables and Random Processes”, Tata McGraw Hill Edition, New Delhi, 2004.
- Taha, H.A., “Operations Research”, 9th Edition, Pearson India Education Services, Delhi, 2016.
- Trivedi, K.S., “Probability and Statistics with Reliability, Queueing and Computer Science Applications”, 2nd Edition, John Wiley and Sons, 2002.
- Yates, R.D. and Goodman. D. J., “Probability and Stochastic Processes”, 2nd Edition, Wiley India Pvt. Ltd., Bangalore, 2012.
For detail syllabus of all other subjects of BE Cse, 2017 regulation do visit Cse 4th Sem syllabus for 2017 Regulation.
Dont forget to download iStudy for latest syllabus and results, class timetable and more.