· A data structure is a specialized format for organizing, retrieving, processing, and storing data. There are different basic and advanced types of data structures, all designed to arrange data to suit a specific specialized purpose. Data structures make it easy for users to approach and work with the data they need in opportune ways. Most importantly, data structures frame the composition of information so that machines and humans can better understand it.
In computer science and computer programming, a data structure may be selected or designed to store data for the purpose of using it with various changeable algorithms. In some cases, the algorithm's basic operations are deeply coupled to the data structure's design. Each data structure involves information about the data values, relationships between the data, and -- in some cases -- functions that can be applied to the data. For instance, in an object-oriented programming language, the data structure and its associated methods are bound together as part of a class definition. In non-object-oriented languages, there may be functions concerned to work with the data structure, but they are not technically part of the data structure.
Why are data structures important?
Typical base data types, such as integers or floating-point values, that are available in most computer programming languages are commonly insufficient to capture the logical intent for data processing and use. Yet applications that ingest, manipulate and consequence information must understand how data should be organized to analyze processing. Data structures conduct together the data elements in a logical way and facilitate the effective use, unity, and sharing of data. They provide a formal model that describes the way the data elements are organized.
How are data structures used?
In general, data structures are used to appliance the physical forms of abstract data types. Data structures are a necessary part of designing efficient software. They also play a critical role in algorithm design and how those algorithms are used in clear computer programs.
Some examples of how data structures are used include the following:
· Storing data. Data structures are used for efficient data persistence, such as specifying the collection of aspects and corresponding structures used to store records in a database management system.
· Managing resources and services. Core operating system (OS) resources and services are approved through the use of data structures such as linked lists for memory allocation, file directory management, and file structure trees, as well as process appointment queues.
· Data exchange. Data structures define the conformation of information shared between applications, such as TCP/IP packets.
· Ordering and sorting. Data structures such as binary search trees -- also known as ordered or sorted binary trees -- provide active methods of sorting objects, such as character strings used as tags. With data structures such as arrangement queues, programmers can manage items organized according to a specific priority.
Indexing.
· alike more sophisticated data structures will be B-trees are used to basis objects, which will be those stored in a database.
· Searching. Indexes created using binary search trees, B-trees, or hash tables speed the capability to asset a unique sought-after item.
· Scalability. Big data applications use data structures for allowance and executive data storage beyond distributed storage locations, ensuring scalability and performance. assertive big data programming environments -- such as apache spark -- provide data structures that mirror the underlying structure of database records to analyze querying.
Characteristics of data structures
The following three characteristics are examples of data structure.
1. Linear or non-linear. This characteristic defines whether the data items are disposed in sequential order, such as with an array, or in an unordered sequence, will be with a graph.
2. Homogeneous or heterogeneous. This characteristic defines whether all data items in a given repository are of the same type. One example is the acquisition of elements in an array, or of changeable types, will be an abstract data type defined as a structure in C or java and in the class specification.
No comments:
Post a Comment