A data structure is a specialized format for organizing and storing data General data structure types include the array, the file, the record, the table,
Primitive Data Structure :- The data structure that are atomic or indivisible are called primitive Example are integer, real, float, Boolean and characters
The simplest type of data structure is a linear (or one dimensional) array The structure definition associated with keyword typedef is called
Non-contiguous structures are implemented as a collection of data-items, called nodes, where each node can point to one or more other nodes in the collection
Implement Abstract Data Type used data structures Contents accuracy of the floating point number is insufficient, we can use the double to define the
structure types, any data structure is designed Data structure types are determined by what DataItem Define a data item having some data, and
The functional definition of a data structure is known as ADT (Abstract Data Type) which is independent of implementation The way in which the data is
Most programming languages also allow the programmer to define additional data types, usually by combining multiple elements of other types and defining the
data structure that stores elements of same data types From the above definition, it is clear that the operations in data structure
Data structures include arrays, linked lists, stacks, binary trees, and hash We can define an array, as numbered collection of variables all of the same type
in this paper we outline a framework for data structures in the spirit of the Vienna Definition Language but extended to the most general c~ass of objects, problem by introducing basically two kinds of generalisations of Vienna objects