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)
#2
ya sahe solution ha good luck


Attached Files
.docx   cs301 GDB solution.docx (Size: 14.04 KB / Downloads: 68)
#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
#4
(08-06-2018, 08:32 PM)fahadmukhtar Wrote: ya sahe solution ha good luck

Thank you for sharing the solution brother.
  


Possibly Related Threads…
Thread Author Replies Views Last Post
  CS301 Assignment 3 Solution Fall 2020 Ayra Suleman 0 1,480 01-25-2020, 11:33 PM
Last Post: Ayra Suleman
  CS301 3rd Assignment solution RashidRoger 0 1,392 01-20-2020, 10:21 AM
Last Post: RashidRoger
  CS301 GDB Solution Spring 2019 Ayra Suleman 0 2,200 08-01-2019, 10:24 PM
Last Post: Ayra Suleman
  CS301 Assignment 3 Solution Spring 2019 Ayra Suleman 0 2,686 07-26-2019, 06:59 PM
Last Post: Ayra Suleman
  CS301 Assignment 2 Solution Spring 2019 Mishi Khan 0 821 05-28-2019, 01:57 AM
Last Post: Mishi Khan
  cs301 Assignment 2 solution Muhammad Yaseen 0 538 05-24-2019, 04:03 PM
Last Post: Muhammad Yaseen
  CS301 Assignment Solution Spring 2019 Mishi Khan 0 655 05-11-2019, 09:36 PM
Last Post: Mishi Khan
  cs301 Assignment Muhammad Yaseen 0 503 05-11-2019, 04:45 PM
Last Post: Muhammad Yaseen
  CS301 GDB Solution Mishi Khan 0 1,029 02-08-2019, 01:42 AM
Last Post: Mishi Khan
  CS301 Assignment 2019 Mishi Khan 0 1,024 01-30-2019, 01:06 AM
Last Post: Mishi Khan



Users browsing this thread:
1 Guest(s)