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?

Explain optimal binary search trees, Explain Optimal Binary Search Trees ...

Explain Optimal Binary Search Trees One of the principal application of Binary Search Tree is to execute the operation of searching. If probabilities of searching for elements

Find a minimum cost spanning arborescence rooted, Find a minimum cost spann...

Find a minimum cost spanning arborescence rooted at r for the digraph shown below, using the final algorithm shown in class. Please show your work, and also give a final diagram wh

Dynamic memory management, How memory is freed using Boundary tag method in...

How memory is freed using Boundary tag method in the context of Dynamic memory management? Boundary Tag Method to free Memory To delete an arbitrary block from the free li

Sparse matrix, what are the disadvantages of sparse matrix?

what are the disadvantages of sparse matrix?

Addressing modes, Compare zero-address, one-address, two-address, and three...

Compare zero-address, one-address, two-address, and three-address machines by writing programs to compute: Y = (A – B X C) / (D + E X F) for each of the four machines. The inst

BINARY SEARCH, GIVE TRACE OF BINARY SEARCH ALGORITHM BY USING A SUITABLE EX...

GIVE TRACE OF BINARY SEARCH ALGORITHM BY USING A SUITABLE EXAMPLE.

Determine the precondition of a binary search, Determine the precondition o...

Determine the precondition of a binary search For instance, precondition of a binary search is that array searched is sorted however checking this precondition is so expensive

Determine about the logic gates, Determine about the logic gates Many e...

Determine about the logic gates Many electronic circuits operate using binary logic gates. Logic gates essentially process signals that represent true or false or equivalent i.

Describe commonly used asymptotic notations, Q.1 Compare two functions n 2 ...

Q.1 Compare two functions n 2 and 2 n for various values of n. Determine when second becomes larger than first. Q.2 Why do we use asymptotic notation in the study of algorit

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