I think either a bst or avl tree will work fine for this scenario.
List of offenders should be loaded faster with the possibility to identify one as quickly as possible.
The trees can load the data faster because they preserve some order as compare to link list, queue or stack in which for each value we may need to find its right place and then rearrange whole thing. The other benefits of using tree is that the one offender can be found easily as we know that it takes nlog(n) to search in tree as compare to O(n) in link list, queue or stack.
Add/Remove Offenders:
The trees are faster to add data in them because we know that it will goes to its right place without the need of traversing the whole tree and usually requires nlog(n) to insert data. This is oppose to linked list, queue or stack in which we first have to search its right place and it can be worst to transverse whole data structure, so for them it can be O(1) but also O(n).
Deleting the offender from stack, queue and link list usually requires much time it can be O(1) if last but it can also be O(n) if it is first as compare to tree which is usually takes nlog(n).
Merging two offenders list:
The merging of two offenders list in linked list, stack and queue takes O(n + m) times where n & m are offender in two list. But in case of tree with appropriate use of algorithm it can O(n log n).
--Question:
Suppose you are a game developer in a company and you have been given the task to develop a game which should fulfill all requirements mentioned below:
The game plots a bank robbery. Lots of people witness that robbery. Our game will load the lists of suspected offenders while the players (witnesses) will have to identify the offenders of this robbery. Game should load list of offenders to identify the one as quickly as possible. Admin can add/remove offenders in the lists and two or more lists of offenders can also be merged into one (to show it to the player).
As a game developer, which data structure you will use to develop the game? Justify your selection with solid arguments. Remember the most critical requirement is that the list should load super fast.
Note: A concise, coherent and to the point answer is preferred over lengthy comments having irrelevant details. Comments, posted on regular Lesson's MDB or sent through email will NOT be considered in any case. Any request about such an acceptance will not be catered.
Best of Luck!
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en
We say, "Be one as Pakistani Nation and grow up for Pakistan's Future". Wish you all the best. Join www.vuaskari.com,
To post to this group, send email to vuaskari_com@googlegroups.com
Visit these groups:
This (Main) Group:http://groups.google.com/group/vuaskari_com?hl=en?hl=en
MIT/MCS Group: http://groups.google.com/group/vu_askarimit?hl=en?hl=en
HRM Group: http://groups.google.com/group/askari_hrm?hl=en?hl=en
Banking Group: http://groups.google.com/group/askari_banking?hl=en?hl=en
Management: https://groups.google.com/group/vuaskari_mgt?hl=en
Marketing: https://groups.google.com/group/vuaskari_mkt?hl=en
MIS Group: http://groups.google.com/group/askari_mis?hl=en
No comments:
Post a Comment
Please Comment About my Work