Here the participant which comes first gets first coupon. For second participant second coupon is issued and so on. So here first participant is processed first(By assigning first ticket). In computer science world this type of data structure is called Queue(First In First Out FIFO). Below figure depicts the coupon processing of mentioned example.
Selection of data structure differs according to data processing requirement based on problem statement. Any one can define its own data structure according to requirement.
Below are some pre defined data structures which can be utilized alone or with combination to solve real life problems.