Chapter -3: Data Structure (DSA -Technology369kk )

Data Structure (DS) :

Data may be organized in many different ways logical or mathematical model of a program particularly organization of data. This organized data is called “Data Structure”. Or The organized collection of data is called a ‘Data Structure’.
So, It can be used efficiently way.
Some most example of DS are ARRAYS, STACK, QUEUE, LINKED LIST, TREE, .. etc.
It is also used for aspect of Computer Science i.e, Operating System, Compiler Design, Artificial Intelligence, Graphics Design etc.

The first goal is to identify and develop useful, mathematical entities and operations and to determine what class of problems can be solved by using these entities and operations.
The second goal is to determine representation for those abstract entities to implement abstract operations on this concrete representation.

Data may be organized in many different ways logical or mathematical model of a program particularly organization of data. This organized data is called “Data Structure”. Or The organized collection of data is called a ‘Data Structure.

Primitive Data structures are directly supported by the language ie; any operation is directly performed in these data items.
Ex: integer, Character, Real numbers etc.

Non-primitive data types are not defined by the programming language, but are instead created by the programmer.

Linear data structures organize their data elements in a linear fashion, where data elements are attached one after the other.
Linear data structures are very easy to implement, since the memory of the computer is also organized in a linear fashion. Some commonly used linear data structures are arrays, linked lists, stacks and queues.

In nonlinear data structures, data elements are not organized in a sequential fashion. Data structures like multidimensional arrays, trees, graphs, tables and sets are some examples of widely used nonlinear data structures.
Example: Tree, Graphs, Tables, Sets.

There are following can be performed on the data structures:

1. Traversing 2. Searching 3. Inserting 4. Deleting 5. Sorting 6. Merging

Traversing : - It is used to access each data item exactly once so that it can be processed.
Searching : - It is used to find out the location of the data item if it exists in the given collection of data items.
Inserting: - It is used to add a new data item in the given collection of data items.
Deleting : It is used to delete an existing data item from the given collection of data items.
Sorting: - It is used to arrange the data items in some order i.e. in ascending or descending
Merging : It is used to combine the data items of two sorted files into single file in the sorted form.