Syllabus

MA61020
Course name	Queuing Theory in Computer Science
Offered by	Mathematics
Credits	4
L-T-P	3-1-0
Previous Year Grade Distribution
	{{{grades}}}
Semester	{{{semester}}}

Syllabus mentioned in ERP

Prerequisite : Probability and StatisticsProbability and random variable, discrete and continuous univariate and multivariate distributions, moments, law of large numbers and central limit theorem (without proof), Poisson process, birth and death process, infinite and finite queueing models M/M/1, M/M/C, M/G/1, M/M/1/N, M/E/1, E/M/1, M/G/1/N, GI/M/1, priority queueing models, network of queues, finite processor sharing models, central server model of multiprogramming, performance evaluation of systems using queueing models. Concepts of bottleneck and system saturation point. Introduction to discrete time queues and its applications.

Concepts taught in class

Student Opinion

How to Crack the Paper

Classroom resources

Additional Resources