Markov Chain and Queuing System
Get the full GTU study material, English & Gujarati textbook PDFs, syllabus curriculum, and solved previous year question papers.
English Book & Chapters
English Book Coming Soon
We are working hard to add this material. Stay tuned for updates!
Follow on Instagram for UpdatesGTU Previous Year Papers
Papers Coming Soon
We are working hard to add this material. Stay tuned for updates!
Follow on Instagram for UpdatesMarkov Chain and Queuing System Syllabus — Unit-wise Content
The official GTU curriculum for Markov Chain and Queuing System (subject code 3720517) as prescribed for EACE · Semester 2 divides the course into 6 units, covering 28 listed topics. The unit-wise breakdown below is read from the GTU syllabus document for this subject code, so you can check what the course actually covers before deciding which papers to attempt.
Download the official syllabus PDF (3720517)Unit 1 Unit 1
- Introduction: Review of basic probability
- properties of nonnegative random variables
- laws of large numbers and the Central Limit Theorem
Unit 2 Unit 2
- Renewal Processes: Basic definitions
- recurrence times
- rewards and renewal reward theorem
- point processes
- Poisson process
- Walds equation
- Blackwell's theorem
Unit 3 Unit 3
- Discrete time Markov chains: definitions and properties
- matrix representation
- Perron- Frobenius theory
Unit 4 Unit 4
- Continuous time Markov chains: basic definitions
- birth-death processes
- quasi birth death Processes
- Embedded Markov processes
- semi Markov processes
- reversible Markov chains
- Random walks
Unit 5 Unit 5
- Fundamental queuing results: Little's theorem
- invariance of the mean delay
- Conservation law
- Markovian queues: Jackson and BCMP networks
- numerical Algorithms
- M/G/1 & G/M/1 queues and G/G/1 queues
Unit 6 Unit 6
- Advanced queuing models: priority
- vacation and retrials in queues Subject Code: 3720517 w.e.f
Study on Android App:
