The paper is about a single channel queuing problem. It shows how to solve queuing problems with a single-channel queuing model that has no losses. It consists of a queue and a service centre, and it uses the FIFO system. The service is provided by the station for the first element in line. This theory is the ordered analysis of this unique in order to find best result so that everyone gets helping hand without having to expect in line for an extended the time. The implementation is explained in C++ coding concept.