GANADIPATHY TULSIS JAIN ENGINEERING COLLEGE,

Chittoor Cuddalore Road, Kaniyambadi (Post),

Vellore 632102.
LESSON PLAN

Form No:
GTEC/ACADEMIC/0
1
Rev No: 1

ACADEMIC YEAR 2015-16 EVEN SEMESTER

Department

:S&H(Mathematics)

Faculty Name
Subject Code/Subject
Name
Year/Semester/Section

: S.Mahendrakumar

Branch

: CSE

Required or elective course

:Required

: MA2262 /

Probability
&Queuing theory

:II / IV /-

AIM
The probabilistic models are employed in countless applications in all areas of science and
engineering. Queuing theory provides models for a number of situations that arise in real life.
The course aims at providing necessary mathematical support and confidence to tackle real life
problems
.
Contacts hours
Assessment methods
& Type of Course
Lecture: 5Hrs/Week
Internal Examination : 20 Marks
Tutorial: 1
Semester End Examination: 100 Marks
GRADING OF EXISTING SYLLABUS: 4
COURSE OUTCOMES (CO):
Co1: To develop the fundamentals and basic concepts in QUEUEING THEORY
.
Co2 Students will be able to solve problems related to engineering applications by using these
techniques
Co3: The subject helps the students to learn about the basic concepts of MARKOV PROCESSES and
solve a variety of problems in Poisson process
Co4: Apply concepts and solving Markovian models by using QUEUEING THEORY
Co5: To learn the basic ideas of complex variables and able to know construction of analytic functions

CONTENT-BEYOND-SYLLABUS:
Page 1 of 7

GANADIPATHY TULSIS JAIN ENGINEERING COLLEGE,

Chittoor Cuddalore Road, Kaniyambadi (Post),

Vellore 632102.
LESSON PLAN

Form No:
GTEC/ACADEMIC/0
1
Rev No: 1

With the presence development of the computer technology, it is necessary to develop efficient
algorithms for solving problems in science, engineering and technology. This course gives a complete
procedure for solving different kinds of problems occur in engineering problems.
TEACHING / LEARNING METHODOLOGY: BB /SMARTBOARD/NPTEL/ EDUSAT/
PPT/ IV /GL /IPT/SEMINAR / GD / Others

TOPICS COVERED: RANDOM VARIABLES, TWO DIMENSIONAL RANDOM VARIABLES, MARKOV

PROCESSES AND MARKOV CHAINS, QUEUEING THEORY, NON-MARKOVIAN QUEUES AND
QUEUE NETWORKS
.TEXT

1.
2.

BOOKS

O.C. Ibe, Fundamentals of Applied Probability and Random Processes,

Elsevier, 1st Indian Reprint, 2007 (For units 1, 2 and 3).
D. Gross and C.M. Harris, Fundamentals of Queueing Theory, Wiley
Student edition, 2004 (For units 4 and 5).

REFERENCES
1.

A.O. Allen, Probability, Statistics and Queueing Theory with Computer

Applications, Elsevier, 2nd edition, 2005.
2. H.A. Taha, Operations Research, Pearson Education, Asia, 8th edition,
2007.
3.
K.S. Trivedi, Probability and Statistics with Reliability, Queueing and
Computer Science Applications, John Wiley and Sons, 2nd edition, 2002.

WEB RESOURCES: EDUSAT

Prepared by

Approved by

Date

Date

DISTRIBUTION (Page No.1 alone)

Class in charge

HOD

Principal

Page 2 of 7

Management
Representative

GANADIPATHY TULSIS JAIN ENGINEERING COLLEGE,

Chittoor Cuddalore Road, Kaniyambadi (Post),

Vellore 632102.
LESSON PLAN

Form No:
GTEC/ACADEMIC/0
1
Rev No: 1

SYLLABUS
MA2262

UNIT I

PROBABILITY AND QUEUEING THEORY

(Common to CSE & IT)
RANDOM VARIABLES

9+3

Discrete and continuous random variables - Moments - Moment generating functions and their
properties. Binomial, Poisson ,Geometric ,Negative binomial, Uniform, Exponential, Gamma, and
Weibull distributions .
UNIT II
TWO DIMENSIONAL RANDOM VARIABLES
9+3
Joint distributions - Marginal and conditional distributions Covariance - Correlation and regression Transformation of random variables - Central limit theorem.
UNIT III

MARKOV PROCESSES AND MARKOV CHAINS

Classification - Stationary process - Markov process Limiting distributions-Poisson process

UNIT IV

9+3

Markov chains - Transition probabilities -

QUEUEING THEORY

9+3

Markovian models Birth and Death Queuing models- Steady state results: Single and multiple server
queuing models- queues with finite waiting rooms- Finite source models- Littles Formula
UNIT V

NON-MARKOVIAN QUEUES AND QUEUE NETWORKS

9+3

M/G/1 queue- Pollaczek- Khintchine formula, series queues- open and closed networks
TUTORIAL
15
TOTAL : 60

Page 3 of 7

GANADIPATHY TULSIS JAIN ENGINEERING COLLEGE,

Chittoor Cuddalore Road, Kaniyambadi (Post),

Vellore 632102.
LESSON PLAN
S. No.

Date

Hour

Topic

RANDOM VARIABLE:

1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.

01.02.
16
02.02.
16
03.02.
16
04.02.
16
05.02.
16
08.02.
16
09.02.
16
10.02.
16
11.02.
16
12.02.
16
15.02.
16
16.02.
16
17.02.
16
18.02.
16
19.02.
16
22.02.
16
23.02.
16
24.02.
16
25.02.
16
26.02.

Discrete random variable

Continuous random variable

Moments

Teaching
Methodolo
gy adopted

Form No:
GTEC/ACADEMIC/0
1
Rev No: 1

T/R

R-3

Pg. No.

55
109

111

185

2,8

Moment generating functions

Moment generating functions

4
4

Properties of Moment generating

functions
Binomial distribution

Binomial distribution

2,8

Poisson distribution

Poisson distribution

Geometric distribution

Geometric distribution

Negative binomial distribution

2,8

Negative binomial distribution

Uniform distribution

Uniform distribution

Exponential distribution

Exponential distribution

2,8

Gamma distribution

Gamma distribution
Page 4 of 7

39-57

39-57

92-98

92-98

109-170
109-170

GANADIPATHY TULSIS JAIN ENGINEERING COLLEGE,

Chittoor Cuddalore Road, Kaniyambadi (Post),

Vellore 632102.
LESSON PLAN

Form No:
GTEC/ACADEMIC/0
1
Rev No: 1

16
21. 29.01.
16
22. 01.03.
16

Weibull distribution

Weibull distribution
UNIT II TWO DIMENSIONAL
RANDOM VARIABLE:
Joint distributions Marginal
distributions
Joint distributions Marginal
distributions

23.

2,8

24.

25.

conditional distributions

26.

Covariance

27.

Correlation and regression

28.

2,8

Correlation and regression

29.

30.

31.

Transformation of random
variables
Transformation of random
variables
Central limit theorem

32.

Central limit theorem

33.

2,8

109-170

109-170

58

59

59

61
358

Revision

358

358

89

89

165

165

165

34.

UNIT III MARKOV PROCESSES

AND MARKOV CHAINS:
Classification - Stationary process

35.

Classification - Stationary process

36.

Classification - Stationary process

37.

Markov process

38.

2,8

Markov process

39.

165

185

185

186

446

446

Markov chains

447

Page 5 of 7

GANADIPATHY TULSIS JAIN ENGINEERING COLLEGE,

Chittoor Cuddalore Road, Kaniyambadi (Post),

Vellore 632102.
LESSON PLAN

447

40.

Markov chains

41.

Transition probabilities

42.

Transition probabilities

43.

2,8

Limiting distributions

44.

Limiting distributions

45.

Poisson process

46.

Poisson process

UNIT IV QUEUEING THEORY

4
4

Markovian models Birth and

Death Queuing models
Steady state results

Single and multiple server queuing

models
Single and multiple server queuing
models
Single and multiple server queuing
models
Queues with finite waiting rooms

Queues with finite waiting rooms

Finite source models

1
2,8
4

4
4
1

UNIT V NON-MARKOVIAN
QUEUES AND QUEUE NETWORKS
M/G/1 queue- PollaczekKhintchine formula, series queuesopen and closed networks
M/G/1 queue- PollaczekKhintchine formula
series queues

2,8

series queues

Open networks

Open networks

closed networks

Form No:
GTEC/ACADEMIC/0
1
Rev No: 1

447

448

436

436

436

436

470

470-490

470-490

470-490

470-490

470-490

470-490

470-490

336-393
T3
336-393

485-490

485-490

416
T3
413

423

Page 6 of 7

GANADIPATHY TULSIS JAIN ENGINEERING COLLEGE,

Chittoor Cuddalore Road, Kaniyambadi (Post),

Vellore 632102.
LESSON PLAN

1
2,8
4

423

closed networks

485-490

series queues

485-490

Revision

Prepared by

Approved by

Date

Date

DISTRIBUTION
HOD

Form No:
GTEC/ACADEMIC/0
1
Rev No: 1

Principal

Page 7 of 7