In this topic we will cover following:-
What is data structure?
Data structure is a field of computer science which teaches us how to store the data in memory so that it can be accessed or processed in the most optimum(minimum) way.
classification of data structure:-
Broadly data structures are of two types:-
1. Primitive data structure
2. Non-primitive data structure
Primitive data structure:- Primitive data structures are datatypes which is supported by a programming languages like- c, c++, python, java etc.
for example:- int, char, float, double, pointer etc.
Non-primitive data structure:- Non-primitive data structures are user define data structures.
These are again categorized in to be of two types:-
1. Linear data structure
2. Non-linear data structure
Linear data structure:- Linear data structures are those which arrange data in the memory in such a way that following one element their in only one element.
In other words, we can also say that 'If one element is connected to only one more element after it' then the data structure become linear data structure.
for example:- arrays, structures, stacks, queues, linked-lists etc.
Non-linear data structure:- Non-linear data structures are those where after one element, we have multiple elements.
In other words, we can also say that 'If one element is connected to multiple elements' then the data structure become non-linear data structure.
for example:- the directory structure of a computer system where within a drive, we have multiple folders and within each folders, we have multiple sub-folders or a files.
In data structure to represent non-linear data structure, we have three implementations called- trees, heaps, graphs.
also see:-
Stack data structure
Queue data structure
Searching algorithms in data structure
- What is data structure?
- classification of data structure
- primitive and non-primitive data structure
- linear and non-linear data structure
What is data structure?
Data structure is a field of computer science which teaches us how to store the data in memory so that it can be accessed or processed in the most optimum(minimum) way.
classification of data structure:-
Broadly data structures are of two types:-
1. Primitive data structure
2. Non-primitive data structure
Primitive data structure:- Primitive data structures are datatypes which is supported by a programming languages like- c, c++, python, java etc.
for example:- int, char, float, double, pointer etc.
Non-primitive data structure:- Non-primitive data structures are user define data structures.
These are again categorized in to be of two types:-
1. Linear data structure
2. Non-linear data structure
Linear data structure:- Linear data structures are those which arrange data in the memory in such a way that following one element their in only one element.
In other words, we can also say that 'If one element is connected to only one more element after it' then the data structure become linear data structure.
for example:- arrays, structures, stacks, queues, linked-lists etc.
Non-linear data structure:- Non-linear data structures are those where after one element, we have multiple elements.
In other words, we can also say that 'If one element is connected to multiple elements' then the data structure become non-linear data structure.
for example:- the directory structure of a computer system where within a drive, we have multiple folders and within each folders, we have multiple sub-folders or a files.
In data structure to represent non-linear data structure, we have three implementations called- trees, heaps, graphs.
also see:-
Stack data structure
Queue data structure
Searching algorithms in data structure
0 Comments