Lecture, four hours; outside study, eight hours. Requisites: course 112, Electrical Engineering 131A. Resource sharing issues and theory of queueing (waiting-line) systems. Review of Markov chains and baby queueing theory. Method of stages. M/Er/1. Er/M/1. Bulk arrival and bulk service systems. Series-parallel stages. Fundamentals of open and closed queueing networks. Intermediate queueing theory: M/G/1, G/M/m. Collective marks. Advanced queueing theory: G/G/1, Lindley integral equation, spectral solution. Inequalities, bounds, approximations. Letter grading.