Home | FAQ | Contact Us | Pricing | How to Subscribe | Forgot Password

Networks and Queuing Category.

Provides practice on minimum spanning trees using a simple algorithmic method to identify the most efficient pathway to visit all nodes.

Requires students to identify the shortest path through a network. It uses the Dijkstra algorithm.

Series of 3 worksheets, requiring students to find the critical path through a network to identify the optimal sequence of events to complete an activity. The network is given for this activity.

Series of 3 worksheets, requiring students to find the critical path through a network to identify the optimal sequence of events to complete an activity. Students must complete an activity table and use this to construct the network.

This worksheet provides students with practice in solving problems involving queuing. Problems involve looking at arrival times, service times, wait time etc.to determine optimum server numbers.