Data Structures | Berkeley Video Course. Data Structures | Berkeley Video Course. Category:Data structures. In computer science, a data structure is a way of storing data in a computer so that it can be used efficiently. Often a carefully chosen data structure will allow a more efficient algorithm to be used. The choice of the data structure must begin from the choice of an abstract data structure. Subcategories This category has the following 13 subcategories, out of 13 total. Pages in category "Data structures" The following 43 pages are in this category, out of 43 total.
Data structure. 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. Overview[edit] Many others are possible, but they tend to be further variations and compounds of the above. Basic principles[edit] Language support[edit] See also[edit] References[edit] Further reading[edit] External links[edit]
Algorithms. Algorithm Tutorials. Algorithm. Algorithms. Algorithm. Algorithms.