Members: Alano, Betito, Chen
Imagine going to the movie theater to watch a new movie and you find that the line is so long and the movie will start in five minutes, don’t you wish there was an application that will help you get out of that predicament? Most of the time, people experience inconvenience when buying tickets due to the long lines and they waste a lot of time waiting for their turn. Many of them wishing that there was some easier way to be able to buy tickets. This is the purpose of our project, the ABCinema.
- Data Structure: List
↳ When reserving seats in a cinema, choosing the seats is a must. In our program, when the customer chose to reserve a ticket in the cinema, their chosen seat will be entered in the list. If more than one ticket was bought, the list gets longer. The list will be visible to the user via the ticket that they bought.
- Data Structure: Linked List
↳ In the snake game, Linked List was the data structures used. The body of the snake and the direction where the snake was going were made with Linked List.
↳ The direction of the snake was also identified using linked list. When the user pressed the keys, the program peeks first where the snake is going. The poll method removes the head of the snake and creates a new one that is in relation to the direction that the user chose the snake to go.
↳ Whenever the snake will eat the food in the board, its body extends which is why linked list was used because it made it easier for us to create a new node and connect it to the tail of the snake. The tail of the snake is the last node in the linked list therefore, it points to null. Whenever there is another addition to the body. We remove the null pointer, add the new tail, connect the body and the new tail and then point the new tail to null making linked list the suitable data structure for this problem.
- Data Srtucture: Queue
↳ The name entered will be enqueued to the names of players in the program. The three most recent entered names will enter in the side panel with the first name at the top of the list and the last at the bottom of the list. If there are more than three entered names, the first name entered will be dequeued from the list to make way for the new name entered.
