Exercises · Grade 12
Discrete queues and service systems — Grade 12 math exercises
Open an exercise and the tutor guides you step by step: it asks questions and checks each step, without giving the answer.
- Exercise 1 — Specify the order of service and arrivals within a slot (easy)
- Exercise 2 — Balance a finite sample path without assuming stationarity (easy)
- Exercise 3 — Build a capacity-limited queue transition law (easy)
- Exercise 4 — Separate offered traffic from admitted and completed flow (medium)
- Exercise 5 — Model random service before a Bernoulli arrival (medium)
- Exercise 6 — Identify the time at which occupancy is observed (medium)
- Exercise 7 — Compare capacities using admitted flow rather than nominal storage (medium)
- Exercise 8 — Retain observation-window boundary terms in a queue-area identity (hard)
- Exercise 9 — Compare completion deadlines under equal mean service times (hard)
- Exercise 10 — Use drift balance as a necessary condition with its assumptions (hard)