Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, B-trees are particularly well-suited for implementation of databases, while compiler implementations usually use hash tables to look up identifiers.
Data structures provide a means to manage large amounts of data efficiently, such as large databases and internet indexing services. Usually, efficient data structures are a key to designing efficient algorithms. Some formal design methods and programming languages emphasize data structures, rather than algorithms, as the key organizing factor in software design. Storing and retrieving can be carried out on data stored in both main memory and in secondary memory.
You need Alphonso EBook Viewer to view this EBook. You will be prompted to download it for FREE when you open EBook. You can also download it from Google Play at http://bit.ly/EBookViewer
Visit Blog: http://bit.ly/AlphonsoBlog
EBooks Catalog: http://bit.ly/EBookCatalog
Check out for more Apps and EBooks: http://bit.ly/AlphonsoApps