need GDB CS301 solution
#1

Please give solution of cs301 subject GDB

GDB Scenario: 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.
Questions:
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
- Heap
Which data structure you will prefer to use when
(i) Data is sorted
(ii) Data is semi-sorted

Instructions:
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


Attached Files
.doc GDB CS301.doc Size: 23.5 KB  Downloads: 66
Reply
#2

ya sahe solution ha good luck


Attached Files
.docx cs301 GDB solution.docx Size: 14.04 KB  Downloads: 68
Reply
#3
Heart 

(08-06-2018, 06:40 PM)raja kamran Wrote:  Please give solution of cs301 subject GDB

GDB Scenario: 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.
Questions:
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
-          Heap
Which data structure you will prefer to use when
(i)                 Data is sorted
(ii)               Data is semi-sorted

Instructions:
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
Reply
#4

(08-06-2018, 08:32 PM)fahadmukhtar Wrote:  ya sahe solution ha good luck

Thank you for sharing the solution brother.
Reply
#5

Best Viagra Online Reviews
Reply
#6

<a href=http://buypropeciaon.com/>generic finasteride international</a>
Reply
#7

Comment Obtenir Du Viagra Gratuitement
Reply
#8

<a href=http://buystromectolon.com/>Stromectol</a>
Reply


Possibly Related Threads…
Thread / Author Replies Views Last Post
Last Post by reewmella
09-16-2021, 07:29 AM



Users browsing this thread: 1 Guest(s)