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 O (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 (Note : The code should be implemented in java programming)
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 O (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
(Note : The code should be implemented in java
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images