A data structure is defined as a way of organizing all the data items that consider not only elements stored but also stores the relationship between those elements.
this is of two types
1.Primitive
2.Non Primitive
In computer science, a data structure is a way of storing data in a computer so that it can be used efficiently. Often a carefully chosen data structure will allow a more efficient algorithm to be used. The choice of the data structure often begins from the choice of an abstract data structure. A well-designed data structure allows a variety of critical operations to be performed on using as little resources, both execution time and memory space, as possible. Different kinds of data structures are suited to different kinds of applications, and some are highly specialized to certain tasks. Source: http://www.free-definition.com/Data-structure.html
Data structure determines the organisation of data such that data can be stored, accessed and modified in as efficient a manner as possible. The most efficient storage is achieved using an array, which is a linear structure where one element immediately follows another and every element is the same length (in bytes). Being the same length makes it possible to determine the start address of every element as an index from the start of the array, such that the first element can be found at index 0 and the nth element at index n-1. Multiplying the index by the size of an element determines the offset memory address from the start of the array for each indexed element, thus enabling constant-time random access. Arrays can be used for both disk-based and memory-based storage, however if the array has to change size dynamically to accommodate new elements there is a runtime cost in reallocating the array in memory. If there isn't enough memory to expand into, the entire array must be copied to new memory with a larger allocation. The need to copy arrays can be reduced by allocating more memory than you actually need.
Lists are also linear structures but they do not allow constant time random access. In order to locate the nth item in a list you must traverse all the elements that come before it, starting from the first element. This is because the structure is determined by the elements, known as nodes, such that each node holds an element of data and also points to the next in the sequence. To keep track of the list you need only maintain a pointer to the first node, the head of the list. The last node, or tail, points to null. Bi-directional lists use two pointers per node, one pointing forwards to the next node and the other pointing backwards to the previous node. Lists are better than arrays when the number of elements is variable because there is no need to copy existing elements to new memory, you simply allocate memory to each new node as and when you need it and adjust the pointers to suit; the nodes need not be allocated contiguously. The tail node can also point forwards to the head node thus creating a circular list; a bi-directional circular list has a head node that points back at the tail.
Nodes are also used in non-linear structures such as trees. A binary tree, for instance, has nodes with two pointers (same as a list), one pointing to a left node and the other pointing to a right node. A standard tree has nodes that hold a list of node pointers, typically used to model hierarchies such as folder structures. Complex graphs and networks can also be modelled using nodes. The only problem with nodes is that they have a memory overhead to maintain the internal pointers.
Describes the structure of a data
Ex: An object data has its properties
Its difference from physical data structure is that the latter's concern is on how a data is saved in a storage
Hope it helps. Please, change this if wrong.
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.
In computer science, a data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently
Data structures are the methods of arranging and putting away data in a computer so we can play out a few activities proficiently on it. It is generally utilized in each part of software engineering.
Data backups
The three types of master data discussed are reference data and enterprise data. Lastly, there is also market master data.
Retrieving Data,Inserting Data,and Deleting Data.
Data warehouse is the database on which we apply data mining.
All built-in data types are not abstract data types.
DPC(damproof course) is an horizontal barrier in a wall designed to prevent moisture rising from the structute of the capilary action.
Chlorophyll in plants performs this amazing feat through photosynthesis.
the structute of the nuclear envelope is one of the stages in the cell cycle called called the telophasethe structute of the nuclear envelope is one of the stages in the cell cycle called called the telophaseyupp this is the answerrr hope i helped!!
A data dictionary is a repository that contains definitions of data processes, data flows, data stores, and data elements used in an organization. It helps to provide a common understanding of data terminologies and structures within a dataset or system. Data dictionaries are often used to maintain consistency and clarity in data management and analysis processes.
Metadata is data that is about data.?æ Although it describes the data, it's not considered business data. Master data is business data. Run-time data is data that is in the process of being run.
Data Store Data Reserve Data Stow Data Warehouse Data Repository Data Depot Data Storehouse
Data formats: It is formating all data file from pcs.whatever it is not use.suppose when data is full,and some data we want to delete it.. Data collection: It is the collection of new data file.when new data is collecting..
Metadata is data that provides information about other data, such as the structure, format, and relationships of data elements. A data dictionary, on the other hand, is a centralized repository that defines and describes the data elements within a database, including their definitions, attributes, and relationships. In summary, metadata is broader and encompasses various types of information about data, while a data dictionary specifically focuses on defining and documenting the data elements within a database.
Metada data is data that describes other data.
Data cleaning is where the data may have missing data such as gender and the data manager has to go back to the source to find the data or data is incorrect and has to be corrected back at the source.
No, Moving data is not same as duplicating data. When we copy data that causes duplication of data . And while moving we are just changing the storage location of data.To copy data is duplication, but to move data does not cause duplication.
The initial data that you collect is raw data.