Classification of Data Structure
In simple language, Data Structures are structures programmed to store ordered data, so that various operations can be performed on it easily. It represents the knowledge of data to be organized in memory.
Linear and Nonlinear
Linear structures arrange data in a direct sequence, similar as set up in an array, list, or line. In nonlinear structures, the data doesn’t form a sequence but rather connects to two or further information particulars, like in a tree or graph.
Static and Dynamic
As the term implies, stationary structures correspond of fixed, endless structures and sizes at collect time. The array reserves a set quantum of reserve memory set up by the programmer ahead of time. Dynamic structures feature non-fixed memory capacities, shrinking or expanding as needed by the program and its prosecution conditions. also, the position of the associated memory can change.
Homogenous and Non-Homogenous
Homogenous data structures correspond of the same data element type, like element collections set up in an array. In non-homogenous structures, the data do n’t have to be the same type, similar as structures.
For More Information:
Call us @ +91 9825618292
Visit us @ http://tccicomputercoaching.com