Describe data structure?, Data Structure & Algorithms

 

Typical programming languages such as Pascal, C or Java give primitive data kinds such as integers, boolean, reals values and strings. They give these to be organised into arrays, where the arrays usually have statically determined size. It is also common to give for record data types, where an instance of the kinds contains a number of elements, or possibly pointers to other data. C, in particular, gives the user to work with a fairly low-level idea of a pointer to a piece of data. A "Data Structure" will be operated in terms of these language-level constructs, but will usually be thought of in association with a collection of operations that can be performed with it and a number of consistency functions which must always hold. One answer of this will be the structure "Sorted Vector" which may be thought of as just a normal array of values but subject to the extra constraint that the numbers must be in ascending order. Having such a data structure may create some operations simpler, but setting up and preserving the constraint may add work.

 

Frequently the construction of an algorithm adds the design of data struc-tures that give e?cient support and natural for the most important steps used in the algorithm, and this data structure then invokes for further code design for the implementation of other necessary but minimum frequently performed functions.

 

Posted Date: 7/27/2012 6:16:46 AM | Location : United States







Related Discussions:- Describe data structure?, Assignment Help, Ask Question on Describe data structure?, Get Answer, Expert's Help, Describe data structure? Discussions

Write discussion on Describe data structure?
Your posts are moderated
Related Questions
Linear search is not the most efficient way to search an item within a collection of items. Though, it is extremely simple to implement. Furthermore, if the array elements are arra

Explain in detail the algorithmic implementation of multiple stacks.

A queue is a, FIFO (First In First Out) list.

How many nodes in a tree have no ancestors 1 node in atree have no ancestors.

For the Oscillating sort to be applied, it is necessary for the tapes to be readable in both directions and able to be quickly reversed. The oscillating sort is superior to the po

Two broad classes of collision resolution techniques are A) open addressing and B) chaining

Question a) Describe how the endogenous model is an improvement to the neo-classical model in explaining the long-run effect of investment on economic growth of a country.

The minimum cost spanning tree has broad applications in distinct fields. It represents several complicated real world problems such as: 1. Minimum distance for travelling all o

In this unit, we learned the data structure arrays from the application point of view and representation point of view. Two applications that are representation of a sparse matrix

Adjacency list representation An Adjacency list representation of Graph G = {V, E} contains an array of adjacency lists mentioned by adj of V list. For each of the vertex u?V,