What is data structute?

Answer 1

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

Answer 2

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

Answer 3

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.

Answer 4

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.

Answer 5

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.

Answer 6

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

Answer 7

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.