What is data structure and it's type?

Data Structure is a way of collecting and organizing data in such a way that we can perform operations on these data in an effective way. Data Structures is about rendering data elements in terms of some relationship, for better organization and storage. For example, we have data player's name "Virat" and age 26. Here "Virat" is of String data type and 26 is of integer data type.

We can organize this data as a record like Player record. Now we can collect and store player's records in a file or database as a data structure. For example: "Dhoni" 30, "Gambhir" 31, "Sehwag" 33

In simple language, Data Structures are structures programmed to store ordered data, so that various operations can be performed on it easily.

---

You can join our offline classes soon at Tara Market, Beside Vishal Mega-Mart-Siwan. Where you can learn WebDesigning, Programming, Blogging, WordPress, H/W and N/W, and many more...

-Protec Computer Academy

---

Data structures are generally categorized into two classes:

1. Primitive Data Structure: As we discussed above, anything that can store data can be called as a data structure, hence int, char, float, double, Boolean etc. all are data structures. They are known as Primitive Data Structures(Built-in Data structures).

Note: The terms ‘data type’, ‘basic data type’, fundamental data type, and ‘primitive data type’ are often used interchangeably.

2. Non-primitive Data Structure: Non-primitive data structures are those data structures which are created using primitive data structures. Examples of such data structures include linked lists, stacks, trees, and graphs. Non-primitive data structures can further be classified into two categories: linear and non-linear data structures.

---

What is Data Structure | welcome2protec.com

---

Non-primitive data structures can further be classified into two categories:

1. Linear Data Structure: If the elements of a data structure are stored in a linear or sequential order, then it is a linear data structure.  For Examples: arrays, linked lists, stacks, and queues. Linear data structures can be represented in memory in two different ways. One way is to have to a linear relationship between elements by means of sequential memory locations. The other way is to have a linear relationship between elements by means of links.


• Array: Array is a data structure used to store homogeneous elements at contiguous locations. Size of an array must be provided before storing data.


• Linked List: A linked list is a linear data structure (like arrays) where each element is a separate object. Each element (that is node) of a list is comprising of two items – the data and a reference to the next node. There are two types of linked list: 1) Singly Linked List and 2) Doubly Linked List


• Stack: A stack or LIFO (last in, first out) is an abstract data type that serves as a collection of elements, with two principal operations: push, which adds an element to the collection, and pop, which removes the last element that was added. In stack both the operations of push and pop takes place at the same end that is top of the stack. It can be implemented by using both array and linked list.


• Queue: A queue or FIFO (first in, first out) is an abstract data type that serves as a collection of elements, with two principal operations: enqueue, the process of adding an element to the collection.(The element is added from the rear side) and dequeue, the process of removing the first element that was added. (The element is removed from the front side). It can be implemented by using both array and linked list.



---

2. None-linear Data Structure: However, if the elements of a data structure are not stored in a sequential order, then it is a non-linear data structure. The relationship of adjacency is not maintained between elements of a non-linear data structure. For Examples: trees and graphs.


• Tree: A tree data structure can be defined recursively (locally) as a collection of nodes(starting at a root node), where each node is a data structure consisting of a value, together with a list of references to nodes (the "children"), with the constraints that no reference is duplicated, and none points to the root.


• Graph: A Graph is a non-linear data structure consisting of nodes and edges. The nodes are sometimes also referred to as vertices and the edges are lines or arcs that connect any two nodes in the graph.

---

If you want to learn Data Structure so let's join our classes at Protec Computer Academy in Siwan.