Little's Law Simulation
Computer Science 311 (Datastructures & Algorithms) Project #2
The purpose of this project was to model and demonstrate the truthfulness of Little's Law. Little's Law is a theorem that states N = λ × T where N is the total number of elements in a queue if λ is the number of new entrants per unit of time and T is the total time any element spends in the queue. This theorem is used in modelling real-life scenarios and we're going to demonstrate it using a Queue data structure.
The main UI.
A graph generated by the program for the above inputs.