Data Structure

 

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 specify the operations that can be performed on a data structure and the computational complexity of those operations.
 In comparison, a data structure is a concrete implementation of the specification 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 commonly use B-tree indexes for data retrieval, while compiler implementations usually use hash tables to look up identifiers.


Here, you will find the best materials for the above topic:

1. Download the best reference book on Data Structure

DATA STRUCTURE USING C

                                                    -by Reema Thareja
                                                     Oxford University Press 

 >>>Click here to Download<<<


2. Download chapter-wise intro in Data Structure

a) Introduction to Data Structure

   >>>Click here to Download<<<

b) Arrays

  >>>Click here to Download<<<

c) Stacks and Queue

  >>>Click here to Download<<<

d) Linked List

  >>>Click here to Download<<<

e) Sorting and Searching

   >>>Click here to Download<<<

f) Tree

  >>>Click here to Download<<<






Reference: www.gtustudymaterial.blogspot.com, internet