CS301 Data Structures GDB Solution & Discussion Spring 2020
GDB Dated: Aug 11, 20
GDB of CS301 will be opened on Wednesday, 19 August 2020. It will remain open for two days.
GDB Topic:
XYZ Soft is facing a big loss in the industry. Therefore, the company has started to offload its software developers. It started to conduct a test of a hundred developers on daily basis and store their test scores in a data structure. After ten days, its CEO wants to terminate fifty developers (three developers each month with an interval of ten days) based on the lowest test scores.
Suppose you are working as a most senior developer in the company then which of the following data structure you will recommend to the CEO in the above-given scenario.
- AVL Tree
- Heap
Justify your answer with solid reason.
Important Instructions:
- Your comments must be precise and limited up to a maximum of 150 words, long comments will lead to deduction of your marks.
- You need to use the font style as “Times New Roman” and font size 12.
- You need to write your comments on your own, copying from the internet or other sources will be awarded zero marks.
- You should post your answer on the Graded Discussion Board (GDB), not on the Moderated Discussion Board (MDB). Both will run parallel to each other during the time specified above. Therefore, due care will be needed.
- GDB after the due date and via email will not be accepted.
CS301 GDB Solution idea 1:
As a computer programmer keeping in mind the whole situation where we are going to insert sorted data in ascending order, I think we should use a balanced binary tree such as an AVL (Adelson-Velskii and Landis) tree, because our main concern is to increase the retrieval efficiency for BST. AVL Trees are the best choice in scenarios where there are frequent data searching queries rather than a situation requiring frequent insertions and deletions. In the worst-case scenario, we have to search for 1.44 log2n levels while searching for an AVL tree. For searches, binary and AVL trees are the most efficient trees, so its the best choice.
CS301 GDB Solution idea 2:
Keeping in view of the above-given scenario. Our main concern is to store the test scores in one place and retrieve the test scores efficiently. Being the most senior developer. I will recommend the AVL Tree Data Structure to the CEO of XYZ soft on the grounds that AVL tree data Structure is a powerful tool for organizing data objects. The main advantage of using the AVL tree is its time complexity. You can perform insertion or searching operation in o(log(n)) time so the data retrieval rate is also fast as compared to binary search tree. It is equally useful for organizing multiple data objects like that of hierarchical relationships.
