subject: data structure and algorithm

USING JAVA ONLY

Question-1(a) Marks [3+7] Suppose that a shopkeeper decided that customers who come first will be served first. A list of customers must be maintained so that anyone can be accessed randomly. Your program must remember operations it performed in opposite order. The entries should be managed based on order of arrival and also be deleted when no longer needed. The size of a file is unknown. A list must be maintained so that elements can be added to the beginning or end in 0 (1). Based on above scenario you have list of different data structures, choose appropriate among them and implement using java. It is important that structure has flexible memory management. Question-1(b) Suppose a business person launches new cinema at Islamabad and ask his team to develop a ticket system for box office. He assigns some requirements about system that how should it work. The requirements are such a way that there are only '5' number of box office windows in the theatre. Each window can have at max '20' number of people waiting in line. To start with, only one window is opened. If the number of people waiting in line in that window exceeds 20, then the next window is opened and people can join the line in that window. Likewise, if both the first and second windows have n number of people waiting in each queue, then a third window is opened. This can go on until the maximum number of windows w is reached. Let us assume that once a window is opened it never closes. A new window is only opened if all open windows are full. Each person can buy only one ticket. So, the system should not allot more than one ticket per person. Let us assume that the system issues one ticket each across all open windows. When a ticket is issued, the count of the number of people in each open queue is reduced by 1. When a new person has to join the queue, the system has to prompt him to join a queue such that they are issued a ticket as fast as possible. The system prompts the person based on these factors: o First it looks for an open window with the least number of people and prompts that window number. If more than one window has the least number of people, then the system can prompt the person to join the first window (smaller window ld) it encounters with the least number of people. If the queues of all open windows are full and a new window can be opened, then the new person is prompted to join the new queue for the new box office window. O If all queues for all windows are full a corresponding message is displayed. That person need not be considered in the next iteration After a queue is prompted to a person, the person or system cannot change the queue. Implement the system based on above scenario in java using suitable data structure. Rubrics: Standards - 2 Marks Program execution = 4 Marks Correct output = 2 Marks Personal Code = 2 Marks