Your Status: Logged out Log in

Explain the different data structures that are avaliable to computer programmers, giving examples of their use, and reasons why they would be chosen instead of others.  

Member rating: 8 out of 10 stars (2 votes) | Words: | Submitted: Thu Jul 11 2002

Page Preview
Preview
Previous 1 of 4 Next

On the left is an image preview of every page of this document, and below are the first 150 words with formatting removed:

Explain the different data structures that are avaliable to computer programmers, giving examples of their use, and reasons why they would be chosen instead of others. Introduction Dats structures are one of the most common principles computer operation, the ability to locate, add or delete data is common and used as soon as you turn on your computer system. The fundamental reason for using data structures is that it uses efficient ways of carrying out the above operations when large amounts of data are involved in the calculations. Lists, string, stacks, queues, arrays & trees are some of the most common data structures. They have been adapted from many pre-computing methods, as a queue in its principal is exactly the same as a queue in a shop for items, for example. Linear List A linear list could be considered a one-dimensional array. The list of numbers form what is called a linear list,...

Get instant access



  • Instant, unlimited access to our documents in full
  • Swap your work for free access, or pay £4.99
  • To see the full version of this document and 151,713 others
Register Now