Hello Magnetzz…!
So today we are going to discuss the most important and useful topic which is known as “Data Structure and Algorithm” it is very useful in various fields for example in Computer Science, Software Development, Artificial Intelligence and Machine Learning, Cryptography, etc.
A data structure is a way to organize and store any data systematically in the computer system so we can access the data later at any time, it is the simplest and easily understandable way for users to read the data from storage. The data structure is not a programming language but it is a set of algorithms that we can use to structure data in the programming language.
A data structure is a main part of many computer science algorithms by which programmers can handle data well, it plays a very important role in improving the performance of the program software.
Importance of Data Structure and Algorithm:-
- DSA is very important because we can store the information in the memory in a proper way.
- By this, we can easily manage very large databases.
- By this time and effort of the user can be saved.
- The Data Structure provides Reusability which means it can be used by many clients.
- By using appropriate data structures and algorithms, software developers can design more efficient systems that use less memory and processing power.
Data Structure is classified into various types which you can easily understand by reading the following topics.
Data Structure has two main topics which are further classifies into their various sub-topics:-
Classification of data structure:-
Primitive Data Structure:- Primitive is a type of data structure that can be operated in machine instruction. A primitive data structure is the inbuild data structure.
In Primitive Data structure:-
- Integer= which means the number and the mathematical symbols.
- Float= which means the decimal values.
- character= In the character all the English alphabets are present.
Non-Primitive Data Structure:- Nonprimitive is also a type of data structure in these data structures it cannot be operated by machine instruction, It is the opposite of primitive data structure.
In Non Primitive Data Structure There Are 2 types:-
- Linear - Linear is a type of non-primitive data structure in which the data is arranged sequentially formed.
In Linear there are four types:-
1.Array- This is a linear data structure, Array is a type of collection of the same type of data. The array is sorted in the memory of systems.
2. Linked list- Linked list is a type of linear data structure, In this, the information which is arranged sequentially is all related to each other.
3.Stack-LIFO principle and rules are used in a stack which means LAST IN FIRST OUT, the data entered first is out last from the stack.
4.Queue-FIFO principle is used in this data structure which means FIRST IN FIRST OUT which means the data is entered the first is also out first.
Non-linear - Non-linear is a type of non-primitive data structure in these data is not sorted sequentially formed.
In Linear there are two types:-
1.Graph - Graph is a non-linear data structure consisting of nodes and edges, Nodes are sometimes also known as the vertex, In simple words, the collection of edges and vertex is known as a graph.
2.Tree - Tree is a non-linear data structure that organizes data into a hierarchy form it consists of nodes and is connected by edges. In this data structure, the circle of each node is a value.
0 Comments