In the sequential algorithm, how are remaining calls in the current travel direction treated?

In the sequential algorithm, how are remaining calls in the current travel direction treated?

• A. Continue in the same direction as long as there are remaining calls in that direction.
• B. Stop at every floor in the same direction regardless of calls.
• C. Reverse direction immediately.
• D. Ignore all calls and stay idle.

Answer: (A)

The idea being tested is that a sequential service strategy keeps moving in the current direction while there are still requests ahead in that direction. In practice, this means if the system is traveling upward, it continues moving up and services any pending calls on floors above. It does not stop at every floor unless there’s a call there, and it does not reverse immediately or stay idle. Only when there are no remaining calls in the travel direction does it turn around to service the requests behind it. This approach minimizes back-and-forth travel and reduces waiting times by grouping requests in the same direction.

The idea being tested is that a sequential service strategy keeps moving in the current direction while there are still requests ahead in that direction. In practice, this means if the system is traveling upward, it continues moving up and services any pending calls on floors above. It does not stop at every floor unless there’s a call there, and it does not reverse immediately or stay idle. Only when there are no remaining calls in the travel direction does it turn around to service the requests behind it. This approach minimizes back-and-forth travel and reduces waiting times by grouping requests in the same direction.