Describe data structure?, Data Structure & Algorithms

Assignment Help:

 

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.

 


Related Discussions:- Describe data structure?

What is complexity, Complexity is the rate at which the needed storage or c...

Complexity is the rate at which the needed storage or consumed time rise as a function of the problem size. The absolute growth based on the machine utilized to execute the program

Define spanning tree, Define Spanning Tree A Spanning Tree of a connect...

Define Spanning Tree A Spanning Tree of a connected graph is its linked acyclic sub graph (i.e., a tree) that having all the vertices of the graph.

Omega notation, The ?-Notation (Lower Bound) This notation provides a l...

The ?-Notation (Lower Bound) This notation provides a lower bound for a function to within a constant factor. We write f(n) = ?(g(n)), if there are positive constants n 0 and

Variable length codes, Variable length codes (Niveau I) Code the following ...

Variable length codes (Niveau I) Code the following sequence of integers (2, 4, 2, 8, 3, 1, 4, 5, 13, 2) with • unary codes • ? codes • d codes • Rice codes (for a suitable l) and

Comparisions and assignments in worst case, Q. Calculate that how many key ...

Q. Calculate that how many key comparisons and assignments an insertion sort makes in its worst case?        Ans: The worst case performance occurs in insertion

Multiqueue, data structure for multiqueue

data structure for multiqueue

DAA, what do we use asymptotic notation in study of algorithm?Describe vari...

what do we use asymptotic notation in study of algorithm?Describe various asymptotic notation and give their significance.

#title.structured programming, what do you understand by structured program...

what do you understand by structured programming?explain with eg. top down and bottem up programming technique

Illustrate the intervals in mathematics, Illustrate the intervals in mathem...

Illustrate the intervals in mathematics Carrier set of a Range of T is the set of all sets of values v ∈ T such that for some start value s ∈ T and end value e ∈ T, either s ≤

Perform inorder, QUESTION (a) Construct a binary tree for the following...

QUESTION (a) Construct a binary tree for the following numbers assuming that a number greater than the node (starting from the root) goes to the left else it goes to the right.

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd