answersLogoWhite

0

DATA STRUCTURES AS ITS NAME IMPLIES DATA MEANS "VALUE' AND STRUCTURE MEANS THE WAY IT IS ORGANISED AND THE WAY IT IS ARRANGED INTO MATHEMATICAL AND LOGICAL WAY.

Just like array...array helps you to store elements without declaring multiples variable

eg: num[100] can store 100 variables which are integers. Here if you are not using array and want to store data in 100 variables then you must declare 100 unique variables names. This can be done effectively using data structures.

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

What data structure is used to represent graphs in c language?

A tree.


Which data structures used in T9 dictionary?

Tries, it is a kind of tree data structure that can be used.


What is trie indexing?

Trie tree is tree data structure which is used to store the string over an alphabet


What is the data structure used by google for gmail contacts storage?

It a radix tree.


Is a heap a type of tree structure?

No, a heap is not a type of tree structure. A heap is a specialized tree-based data structure commonly used in computer science for efficient priority queue operations.


In programming data read by programming is called?

Pascal language is used to read the programming data.


What is the first no for sialkot?

Data structure is related to the algorithm, ie solution of the requirements.whereas Data Type is component of a programming language, which can be used to implement the required data structure (organization of data and format).For example if the requirement say that a LIST is required, and in C programming language , there is not LIST data type BUT LIST CAN BE REALISED(IMPLEMENTED ) in C.


What is Parse tree?

A syntax tree is a tree representation of the syntactic structure of the source code where the node denotes a construct. For more information, visit the link below:


What is the data structure used to predict the next move in chess?

A decision tree or a weighted graph.


Difference between B-tree and Binomial search tree?

A B-tree is a kind of tree data structure which is a generalization of a binary search tree where each node can have more than two children and contain more than 1 value. A Binominal search tree I am not sure of. If you mean Binary search tree, then it is an abstract data structure. Binominal is a term usually used with distributions while Binary is usually used with data. Hope this helps.


Difference between B-tree and B tree?

B-tree is a self-balancing tree data structure commonly used in databases and file systems, designed to reduce the number of disk accesses. B tree is a broad term that does not have a specific definition but may refer to any tree data structure with characteristics similar to a B-tree.


Can a data type be called a data structure?

Yes, they can be used interchangeably, but they usually mean separate things. A type of data is something like an integer, or string. While a data structure usually refers to a linked list or tree of integers or strings.