To solve the above-mentioned problems, data structures come to rescue. Multiple requests − As thousands of users can search data simultaneously on a web server, even the fast server fails while searching the data. Processor speed − Processor speed although being very high, falls limited if the data grows to billion records. As data grows, search will become slower. If the application is to search an item, it has to search an item in 1 million(10 6) items every time slowing down the search. Space Complexity − Memory usage of a data structure operation should be as little as possible.Īs applications are getting complex and data rich, there are three common problems that applications face now-a-days.ĭata Search − Consider an inventory of 1 million(10 6) items of a store. Time Complexity − Running time or the execution time of operations of data structure must be as small as possible. Implementation also provides the definition of the algorithms used in the operations of the data structure.Ĭorrectness − Data structure implementation should implement its interface correctly. Implementation − Implementation provides the internal representation of a data structure. An interface only provides the list of supported operations, type of parameters they can accept and return type of these operations. Interface represents the set of operations that a data structure supports. Interface − Each data structure has an interface. Following terms are the foundation terms of a data structure.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |