Opening Date: Monday, February 10, 2014
Closing Date: Tuesday, February 11, 2014
GDB Scenario:
Let us consider that you are a developer in a company. Your company asks you to develop an application for a data GRID station. Data GRID station is situated in NIPS (National Institute of Physical Sciences). Purpose of application is to receive the data from data GRID station once in a week between 10 A.M to 10:30 A.M and then store it into a data structure. The data that comes from data GRID station is in the form of sorted digits. The sorted data can be in ascending or descending order.
GDB Question:
"If your concern is fast and efficient searching then which data structure you will choose to store the data? Give reasons to justify your selected data structure."
Instructions:
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.
Best of Luck!
Heap is the fattest data structure because it combines two things:
1. It is conceptually a tree, thus heap has a taste of logarithmic high speed of a tree structure.
2. Physically, heap is implemented with a array data structure which is not only the most primitive built- in high speed data structure but is contiguous in nature, so adding more to speed to heap.
But Im not sure, whether it be good enough for sorted data or not.
The simplest, most general, and least efficient search structure is merely an unordered sequential list of all the items. Locating the desired item in such a list, by the linear search method, inevitably requires a number of operations proportional to the number n of items, in the worst case as well as in the average case. Useful search data structures allow faster retrieval; however, they are limited to queries of some specific kind. Moreover, since the cost of building such structures is at least proportional to n, they only pay off if several queries are to be performed on the same database (or on a database that changes little between queries).
Static search structures are designed for answering many queries on a fixed database; dynamic structures also allow insertion, deletion, or modification of items between successive queries. In the dynamic case, one must also consider the cost of fixing the search structure to account for the changes in the database.
Closing Date: Tuesday, February 11, 2014
GDB Scenario:
Let us consider that you are a developer in a company. Your company asks you to develop an application for a data GRID station. Data GRID station is situated in NIPS (National Institute of Physical Sciences). Purpose of application is to receive the data from data GRID station once in a week between 10 A.M to 10:30 A.M and then store it into a data structure. The data that comes from data GRID station is in the form of sorted digits. The sorted data can be in ascending or descending order.
GDB Question:
"If your concern is fast and efficient searching then which data structure you will choose to store the data? Give reasons to justify your selected data structure."
Instructions:
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.
Best of Luck!
(An Idea Solution)
Heap is the fattest data structure because it combines two things:
1. It is conceptually a tree, thus heap has a taste of logarithmic high speed of a tree structure.
2. Physically, heap is implemented with a array data structure which is not only the most primitive built- in high speed data structure but is contiguous in nature, so adding more to speed to heap.
But Im not sure, whether it be good enough for sorted data or not.
The simplest, most general, and least efficient search structure is merely an unordered sequential list of all the items. Locating the desired item in such a list, by the linear search method, inevitably requires a number of operations proportional to the number n of items, in the worst case as well as in the average case. Useful search data structures allow faster retrieval; however, they are limited to queries of some specific kind. Moreover, since the cost of building such structures is at least proportional to n, they only pay off if several queries are to be performed on the same database (or on a database that changes little between queries).
Static search structures are designed for answering many queries on a fixed database; dynamic structures also allow insertion, deletion, or modification of items between successive queries. In the dynamic case, one must also consider the cost of fixing the search structure to account for the changes in the database.
Comments
Post a Comment
Please give us your feedback & help us to improve this site.