Share:
Notifications
Clear all

[Solved] CS301 GDB Spring 2020  

  RSS

admin
(@admin)
Admin
Joined: 2 years ago
Posts: 4336
11/08/2020 11:59 pm  

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 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 the 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.

  1. AVL Tree
  2. Heap

Justify your answer with solid reason.

 

Important Instructions:

  1. Your comments must be precise and limited up to maximum 150 words, long comments will lead to deduction of your marks.
  2. You need to use font style as “Times New Roman” and font size 12.
  3. You need to write your comments by your own, copying form internet or other sources will be awarded zero marks.
  4. 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.
  5. GDB after due date and via email will not be accepted.

QueryVU WhatsApp Groups subject wise : Join Now


Quote
admin
(@admin)
Admin
Joined: 2 years ago
Posts: 4336
14/08/2020 12:55 pm  

CS301 Data Structures GDB Solution & Discussion Spring 2020


CS301 GDB Solution idea:

 

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 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 1.44 log2n levels while searching an AVL tree. For searches, binary and AVL trees are the most efficient trees, so its best choice.

QueryVU WhatsApp Groups subject wise : Join Now


ReplyQuote
Fahad Azeem
(@fahadazeemazeem02)
New Member
Joined: 4 months ago
Posts: 1
19/08/2020 9:52 am  

Good Effort.


admin liked
ReplyQuote
admin
(@admin)
Admin
Joined: 2 years ago
Posts: 4336
19/08/2020 3:06 pm  

CS301 Data Structures GDB Solution & Discussion Spring 2020


CS301 GDB Solution idea 2:

Keeping in view of the above given scenario. Our main concern is to store the test scores at a one place and retrieve the test scores efficiently. Being a 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 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 equality useful for organizing multiple data objects like that of hierarchical relationships.

QueryVU WhatsApp Groups subject wise : Join Now


ReplyQuote
Share: