What is Data Structure || Data Structure Interview Question ? || Definition of Data Structure || Classification of Data Structure
Data :- Any raw fact or figure is Called Data means that any raw fact or element is called data. like all the data which has any existence in the world is your name, place, address, river, pond, fort, etc. or any other. Numbers and many other things which actually exist in this world are called data.
Now let's talk about how data is represented in technical terms.
Data is represented by text, audio, video, images, graphs, bar charts, pie charts, and many more.
Data Structure :- Data Structure is a method, Data Structure is the method of storing data in the computer's memory which after storing it helps the user to find the data in future and the user gets the data easily and the user saves time
Classification of Data Structure
Primitive Data Structure :- Primitive Data Structure This is the basic data structure. And it operates the instruction of the machine directly. It is represented in different types like Integer, Float, Pointer, etc.
Non Primitive Data Structure: - Non primitive data structure is a type of sophisticated data structure. Which is derived from the primitive data structure.
These homogenous and heterogeneous groups of all types of data structure, arrays, lists, and, deals, all of them fall under the category of non-primitives.
It is mainly of two types.
Array :- Array is the connection of the value of the variable of the data type of similar type, if in other words, it supports the homo genius DataType, it stores the data of only one type, if the type of array is integer then all of it The valuator will be an integer only.
List :- List is an alternative and opposite option of array, in which we can store data items in many ways.
There are 2 fields in the list out of which the first field stores the data and the second field stores the address of that data.
Stack :- Stack is non primitive linear data structure. Stack is based on LIFO technique which means last in first out. The work of inserting data into the stack and retrieving or exiting the data is done from the same side. There are mainly two operations in the stack.
1. Push which is done to insert the data into the stack.
2. Pop is used to remove data from the stack.
Queue :- Queue is a non primitive linear data structure that stores homogenous data.
Queue is based on FIFO (First In First Out) principle, it has two different methods to insert and retrieve/delete data.
Front : Data is deleted from front end in FIFO order
Rear : Data from rear end is stored in a queue
Tree :- Tree is a non-primitive linear data structure that keeps the data in a sorted order. Tree represents the Hierarchical relationship among all the data items.
Tree has many terminologies like root node, leaf node, subling sub tree etc.
Graph : Graph is also a non primitive non linear data structure.
Graph is a collection of vertices and edges That is, the collection of vertices and edges is called a graph, which is represented by G=(V, E).
Where V is the finite and non-empty set of Vertex V={v1, v2, v3,... vn} and E is the set of Edges
E={e1 , e2, e3... en}
Files :- Files are collection of related records and records can be information of many fields. File deals with data and storage in computer.