Types of data structure

 

A data structure is a storage that is used to store and organize data. It is a way of arranging data on a computer so that it can be accessed and updated efficiently.

Classification:

Ø  Linear and Nonlinear.

Linear structures arrange data in a linear sequence, such as found in an array, list, or queue. In nonlinear structures, the data doesn’t form a sequence but instead connects to two or more information items, like in a tree or graph.

Ø  Static and Dynamic.

As the term implies, static structures consist of fixed, permanent structures and sizes at compile time. The array reserves a set amount of reserve memory set up by the programmer ahead of time. Dynamic structures feature non-fixed memory capacities, shrinking or expanding as required by the program and its execution requirements. Additionally, the location of the associated memory can change.

Ø  Homogenous and Non-Homogenous.

Homogenous data structures consist of the same data element type, like element           collections found in an array. In non-homogenous structures, the data don’t have to be the same type, such as structures.

TCCI provides best teaching in various engineering courses through different learning method/media. These make student to create new technologies, including the development of networking solutions and software programs.

 

For More Information:                                          

Call us @ 9825618292

Visit us @ http://tccicomputercoaching.com