Question

The wildly popular game Fortfite has been massively successful in the past year, and they’re looking toexpand their staff. As a Gator Software Engineer, you want to jump on this great opportunity! Seeing asyou’re a UF graduate, AwesomeGames immediately schedules an interview with you. During theinterview, the interviewer asks how you would handle adding and removing players from games considering the following conditions:

Each game has at most 100 players within it. This actual number is locked as soon as the match begins.

The players are initially loaded up in order by highest to lowest score (best player at #1 spot, worst player at #100 spot).

As players are eliminated, they get removed from the game. This happens could happen at any time during the match, and players should be removed immediately. Assume resizing adds no extra time.

Because of how massive the game is and how many people are playing it at a single time (numerous matches could be running on a single server), your interviewer needs your solution to be efficient. You have been given a list of data structures, and the interviewer asks you to describe the pros and cons of using each one, and whether or not it would be a suitable choice.

 Array

 Dynamic Array

 Vector

 Stack

 Linked List

Answer 1

=>Array:-

Pros:-

1.) We can access array element fastly as location can be computed easily.

2.) Direct indexing is possible in array with time complexity of O(1).

Cons:-

1.) Insertion and deletion in array slows the computation as we have to shift adjacent element.

2.) Large block is needed to hold the array.

=>Dynamic Array:-

Pros:-

1.) Dynamic array gives direct access to elements without making copies.

2. ) Dynamic array size automatically grows when insertion is made and size is not present.

Cons:-

1.) It is an array whose size is fixed when array is allocated.

2.) Insertion and deletion of element is slow.

=>Vector:-

Pros:-

1,) Size of vector can be changed.

2.) We can easily delete elements from vector.

Cons:-

1.) Memory consumption is more in vector as vector is an object.

=>Stack:-

Pros:-

1.) LIFO is possible in stack which is not possible with Linked List and array.

2.) stack is used as temporary variables and it get destroys when function is no longer needed.

Cons:-

1.) Memory in stack is limited.

2.) When number of object creation increases in stack then it results in stack overflow.

=>Linked list:-

Pros:-

1.) Insertion and deletion of data is easier as it does not allow shifting of data.

2.) Sequential Access is possible in linked list with a time complexity of O(N).

Cons:-

1.) Linked list requires more memory.

2.) Direct access is not possible only sequential access is possible.