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
In the previous unit, we have discussed arrays. Arrays are data structures of fixed size. Insertion and deletion involves reshuffling of array elements. Thus, array manipulation

Q. Make the 11 item hash table resulting from hashing the given keys: 12, 44, 13, 88, 23, 94, 11, 39, 20, 16 and 5 by making use of the hash function h(i) = (2i+5) mod 11.

Explain what are circular queues? Write down routines required for inserting and deleting elements from a circular queue implemented using arrays.           Circular queue:

Tree is a widely used data structure employed for representing several problems. We studied tree like a special case of acyclic graph. Though, rooted trees are most prominent of al

implement multiple stacks in a single dimensional array. write algorithm for various stack operation for them

Triangular Matrices Tiangular Matrices is of 2 types: a)  Lower triangular b)  Upper triangular


create aset of ten numbers.then you must divide it into two sets numbers which are set of odd numbers and set of even numbers.

A graph with n vertices will absolutely have a parallel edge or self loop if the total number of edges is greater than n-1

With the help of a program and a numerical example explain the Depth First Traversal of a tree.