IIT Bombay Data Structures and Algorithms Prof. Ajit A. Diwan Prof. Ganesh Ramakrishnan Prof. Deepak B. Phatak Department of Computer Science and Engineering.

Slides:



Advertisements
Similar presentations
How to be safe and responsible passengers on a bus!
Advertisements

E&CE 418: Tutorial-4 Instructor: Prof. Xuemin (Sherman) Shen
Speed and Schedule Stability in Supply Chains Michael G H Bell Professor of Transport Operations Imperial College London P O R T e C GCSL2006, Hong Kong,
This session will resume in 15 minutes. This session will resume in 14 minutes.
Simulation with ArenaChapter 2 – Fundamental Simulation Concepts Discrete Event “Hand” Simulation of a GI/GI/1 Queue.
Uniprocessor Scheduling III CPSC 410 Operating Systems Department of Physics, Computer Science and Engineering Christopher Newport University.
1 QUEUES. 2 Definition A queue is a linear list in which data can only be inserted at one end, called the rear, and deleted from the other end, called.
MAT 1235 Calculus II Section 8.5 Probability
Famous Frank’s Queuing Michael Dettloff- Sam Ross Marc
1 Some Interesting Problems In Probability Prof. Alagar Rangan Dept of Industrial Engineering Eastern Mediterranean University Dept of Industrial Engineering.
January 2011 Sessions (Estimated Eight Sessions in a 4 Week Rotation)
IIT Bombay Computer Programming Dr. Deepak B Phatak Dr. Supratik Chakraborty Department of Computer Science and Engineering IIT Bombay Session: Operator.
IIT Bombay Computer Programming Dr. Deepak B Phatak Dr. Supratik Chakraborty Department of Computer Science and Engineering IIT Bombay Session: Friends.
Weihua Gu Department of Electrical Engineering The Hong Kong Polytechnic University Bus and Car Delays at Near-Side/Far-Side Stops.
IIT Bombay Data Structures and Algorithms Prof. Ajit A. Diwan Prof. Ganesh Ramakrishnan Prof. Deepak B. Phatak Department of Computer Science and Engineering.
IIT Bombay Data Structures and Algorithms Prof. Ajit A. Diwan Prof. Ganesh Ramakrishnan Prof. Deepak B. Phatak Department of Computer Science and Engineering.
IIT Bombay Data Structures and Algorithms Prof. Ajit A. Diwan Prof. Ganesh Ramakrishnan Prof. Deepak B. Phatak Department of Computer Science and Engineering.
IIT Bombay Data Structures and Algorithms Prof. Ajit A. Diwan Prof. Ganesh Ramakrishnan Prof. Deepak B. Phatak Department of Computer Science and Engineering.
CSE 4705 Artificial Intelligence
Data Structures and Algorithms
Data Structures and Algorithms
Data Structures and Algorithms
Data Structures and Algorithms
Data Structures and Algorithms
Data Structures and Algorithms
ONE DIMENSIONAL RANDOM VARIABLES
CPU Scheduling CSSE 332 Operating Systems
How to Read a Bus Schedule
Data Structures and Algorithms
City Bus Information.
The Poisson Process.
Computer Programming Dr. Deepak B Phatak Dr. Supratik Chakraborty
Models of Traffic Flow 1.
Data Structures and Algorithms
Learning Representations of Data
Data Structures and Algorithms
Discrete Event Simulation
Data Structures and Algorithms
Data Structures and Algorithms
Chapter 7 Lesson 8 Objective: To use segment and area models to find the probabilities of events.
Computer Programming Dr. Deepak B Phatak Dr. Supratik Chakraborty
Data Structures and Algorithms
Insert image or graphic
CS621: Artificial Intelligence
Computer Science cpsc322, Lecture 14
Groveport Madison Schools
Complex World 2015 Workshop
Transportation Engineering Basic Queuing Theory February 18, 2011
Bryan Russell Computer Demonstration
Computer Programming Dr. Deepak B Phatak Dr. Supratik Chakraborty
Variability 8/24/04 Paul A. Jensen
Greedy Methods Knapsack Problem Hoffman Codes
CSC4005 – Distributed and Parallel Computing
Chandler School Kindergarten Information – Full Day or Half Day?
Connecting Between Buses FOR MORE INFORMATION PLEASE CALL:
Problem 8.3 John Doe has promised a total service time of 20 minutes. Processing time at the oven = 15 min Preparation = 2 min At most 3 minutes waiting.
Discrete Event “Hand” Simulation of a GI/GI/1 Queue
Karthick S.B. (VIT, Pune) Kulkarni V.Y. (MIT Pune)
Chandler School Kindergarten Full Day or Half Day?
Bottom Up: Soundness and Completeness
Indian Institute of Technology Bombay
USING ARRAYS IN MATLAB BUILT-IN MATH FUNCTIONS
Centre for Technology Alternatives for Rural Areas, IIT Bombay
Prof. Deptii Chaudhari.
CS621: Artificial Intelligence Lecture 22-23: Sigmoid neuron, Backpropagation (Lecture 20 and 21 taken by Anup on Graphical Models) Pushpak Bhattacharyya.
Comparative Visualization
Computer Programming Dr. Deepak B Phatak Dr. Supratik Chakraborty
Computer Programming Dr. Deepak B Phatak Dr. Supratik Chakraborty
Chapter 5 Process Analysis.
Modeling and Simulation: Exploring Dynamic System Behaviour
Presentation transcript:

IIT Bombay Data Structures and Algorithms Prof. Ajit A. Diwan Prof. Ganesh Ramakrishnan Prof. Deepak B. Phatak Department of Computer Science and Engineering IIT Bombay Session: Bus Queue 1Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay

IIT Bombay Bus Queue: Overview Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay2 People Arrive and stand in a queue at the bus stop Wait for the bus to arrive Buses Arrive at around scheduled time Limited available seats (varies for each bus) Waiting time of a person = Time of boarding the bus – Arrival time of person at bus stop

IIT Bombay Let us demonstrate the entire process Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay3

IIT Bombay Demonstration Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay4 A bus stop

IIT Bombay Demonstration Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay5 Waiting for bus to arrive PersonArrival Time :15

IIT Bombay Demonstration Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay6 Waiting for bus to arrive PersonArrival Time : :19

IIT Bombay Demonstration Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay7 Waiting for bus to arrive PersonArrival Time : : :21

IIT Bombay Demonstration Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay8 Waiting for bus to arrive PersonArrival Time : : : :22

IIT Bombay Demonstration Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay9 Waiting for bus to arrive PersonArrival Time : : : : :27

IIT Bombay Demonstration Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay10 Bus arrived: 14:30 Available Seats: 2 PersonArrival Time : : : : :27

IIT Bombay Demonstration Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay11 Bus arrived: 14:30 Available Seats: 2 Person 1 waited for 15 min Person 2 waited for 11 min PersonArrival Time : : : : :27

IIT Bombay Demonstration Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay12 Waiting for next bus to arrive PersonArrival Time : : : : :27

IIT Bombay Demonstration Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay13 Bus arrived: 14:40 Available Seats: 7 PersonArrival Time : : : : :27

IIT Bombay Demonstration Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay14 PersonArrival Time : : : : :27 Bus arrived: 14:40 Available Seats: 7 Person 3 waited for 19 min Person 4 waited for 18 min Person 5 waited for 13 min

IIT Bombay Average wait time Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay15 In our example, with assumed ‘hypothetical’ timings, we have: Person 1 waited for 15 min Person 2 waited for 11 min Person 3 waited for 19 min Person 4 waited for 18 min Person 5 waited for 13 min 5 persons waited for 76 minutes The ‘average’ wait time, is thus minutes In actual practice, passengers will arrive randomly. Buses will also have random arrivals around their scheduled time. Even the number of available seats will have to be generated randomly

IIT Bombay References Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay16 All images are taken from These are released in public domain

IIT Bombay Thank you Ajit A. Diwan, Ganesh Ramakrishnan, and Deepak B. Phatak, IIT Bombay17