Data Structure

The Data structure is a presentation of the logical relationship between individual elements of data because the  structure  of  information  will  invariable  affect  the  final  procedural  design and  data  structure  is  as important as program structure the representation of software architecture.

The Data  structure  dictates  the  company technique  of  access,  degree  of  associatively, and  processing alternatives for information. The Entire texts have been dedicated to these topics and a complete discussion is behind the scope of this book. Moreover it is important to understand the classic techniques available for organizing information and the concepts which underlie information hierarchies.

The company and complexity of a data structure are limited only through the ingenuity of the designer. There are Moreover, a limited number of classic data structures which form the structure blocks for more sophisticated structures.

A scalar item is the easiest of all data structures. Its name implies a scalar item represents a single part of information which may be addressed through an identifier which is, access may be achieved through specifying a single address in storage.

A sequential vector is formed when scalar items are organized as a list or contiguous group. The Vectors are the most general of all data structures and open the door to variable indexing of information.

When the sequential vector is extended to 2, 3, and ultimately an arbitrary number of dimensions, an n-dimensional space is established. The most general n-dimensional space is the 2-dimensional matrix. In most programming languages an n-dimensional space is called an array.

Items, vectors and spaces may be organized in a variety of formats. The linked list is a data structure which organizes noncontiguous scalar items vectors, or spaces in a manner which enables them to be processed as a list. The Each node contains the appropriate data organization and one or more pointers which indicate the address in storage of the next node in the list. The Nodes may be added at any point in the list through redefining pointers to accommodate the new list entry.

The Other data structures incorporate or are build using the fundamental data structures define above. Example for, a hierarchical data structure is implemented using multilinked lists which contain scalar items, vectors and possible n-dimensional spaces. A hierarchical structure is generally encountered in applications which needs information categorization and associatively. The Categorization implies a grouping of information through some generic parts example for all subcompact automobiles or call 64-bit microprocessors. Associatively implies the ability to related information from various categories Example for find all entries in the microprocessor category in which cost less than $100.00 cost subcategory, run at 100 MHz cycle time subcategory, and are made through U.S. vendors vendor subcategory.

It is most important to note that data structures like program structures can be represented at various levels of abstraction. Example for a stack is a conceptual model of data structures which can be implemented as a vector or a linked list. It's Depending on the level of design detail the internal workings of stack may or may not be specified.