Description
Overview:
The application we built is a simple Hot Dog stand which gives the user the ability to purchase hot dogs, along with chips and drinks. The main menu of our application consists of the following options:
- Take order
- Display current order
- Take payment
- Serve order
- Display all menu items
- Exit
The goal is to demonstrate the implementation of queue data structure. A queue is a linear structure that follows a particular order in which the operations are performed. The order is First In First Out (FIFO). A good example of a queue is any queue of consumers for a resource where the consumer that orders first is served first. The difference between stacks and queues is in removing items. In a stack, we remove the item that is added last; in a queue, we remove the item is added first.
We implemented a link-based queue where instead of enqueue() and dequeue(), we used add() and pop().
Implementation:
- The user initiates an order by selecting a hotdog, beverage, and chips.
- Each selection is stored in a separate list.
- A node of all 3 lists is created and pushed into a linked queue.
