We are here with you hands in hands to facilitate your learning & don't appreciate the idea of copying or replicating solutions. Read More>>
Suppose a company wants to develop an application to collect and store the temperature statistics of different countries. The city wise temperature details from all the countries are collected from different online spreadsheets. Some of these spreadsheets contain sorted data and others contain semi-sorted data (chunks of data are sorted).
The main requirement of the application is that it should be able to store and search for data quickly. It means if you want to store a country’s temperature stats in this application, it should be able to store it quickly and if you want to search for a specific city’s temperature, it should provide you with fastest possible search.
If you are hired by this company to develop this application and you are provided with two options of data structures to choose from:
- AVL Tree
Which data structure you will prefer to use when
(i) Data is sorted
(ii) Data is semi-sorted
Your answer should not exceed 2 – 3 lines of text for each option.
A concise, coherent and to the point answer is preferred over lengthy comment having irrelevant details. Answers, posted on regular Lesson's MDB or sent through email will NOT be considered in any case.
Please note GDB does not have any grace day. We are giving about a full week to prepare your comments and 48 hours to just post them. GDB comments will not be accepted through email in any case.
Best of Luck!
Share This With Friends......+ Click Here To Join also Our facebook study Group. This Content Originally Published by a member of VU Students.
avl for semi sorted and heap for sorted
mjy data structure ni aati h kia kron?
its easy. just need concentration...
read handouts deeply... no need of video lectures.
Please Discuss here about this GDB.Thanks
Our main purpose here discussion not just Solution
We are here with you hands in hands to facilitate your learning and do not appreciate the idea of copying or replicating solutions. Read More>>
Discussed & be touched with this discussion. After discussion a perfect solution will come in a result at the end.
For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.
For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.
Or visit this link
Please Click on the below link to see…
P.S: Please always try to add the discussion in proper format title like “CS101 Assignment / GDB No 01 Solution & Discussion Due Date: ___________”
past paper cs301 k kise k pas hy to send kr dy plzzzzzzz
If you want sorted elements, go with BST (AVL Tree). Heap is better at findMin/findMax ( O(1) ), while BST is good at all finds ( O(logN) )
Download file from description
i dont think its right
imran khalid bro ap ki MGT201 hy?
GDB Solution is here https://bit.ly/2vxyY9P