Data structure in C

In computer science, a data structure is a particular way of organizing data in a computer so that it can be used efficiently. Data structures can implement one or more particular abstract data types (ADT), which are the means of specifying the contract of operations and their complexity. In comparison, a data structure is a concrete implementation of the contract provided by an ADT.

Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to specific tasks. For example, relational databases most commonly use B-tree indexes for data retrieval, while compiler implementations usually use hash tables to look up identifiers.

Data structure is not any language; it’s a collection of concepts, which you can utilize differently for different applications. We have covered almost all essential topics of Data Structures like stacks, queues, linked lists, trees and different kind of tree with different traversal methods, graphs, searching, merge sort, quick sort.

So this course is about data structure. If you are planning to work in data science and huge application development. Then you must have idea of data structures, because big data application uses data structures at very large scale. If you want to learn more about data structure at

http://www.tutorialspoint.com/data_structures_algorithms/index.htm

Leave a Reply

Your email address will not be published. Required fields are marked *