| Summary: |
Very often in order to solve a given programming problem we need to work with a collection of objects of the same type. A common form of collection is one that represents a sequence of elements. In mathematics a sequence is an enumerated collection of objects in which repetitions are allowed. The number of elements (possibly infinite) is called the length of the sequence. Enumerated simply means that the elements in the list can be listed one-by-one, and that the order of the elements matters. In programming a sequence is defined in much the same way (although not usually infinitely long!). There are many situations where it is useful to represent data as a sequence, for example a list of financial transactions, a list of students, and so on.
Depending on the programming task, we may have to apply different operations to a sequence of data, for example adding and removing elements or finding a specific element, or enumerating the elements in the list.
This week we will:
Recap the concept of abstract data types (ADTs) and data structures
Introduce the List ADT which is useful for representing sequences of data
Learn that the List ADT can have multiple different implementations and look at some of these |
| Creators: |
|
| Divisions: |
Academic > School of Computing, Engineering and Built Environment > Department of Computing > Computing |
| Copyright holder: |
Copyright © Glasgow Caledonian University |
| Tags: |
Data Structures, Algorithms, Lists, Array, ArrayList, Java, Linked Lists |
| Viewing permissions: |
World |
| Depositing User: |
|
| Date Deposited: |
23 Apr 2018 15:05 |
| Last Modified: |
13 Feb 2020 10:02 |
| URI: |
https://edshare.gcu.ac.uk/id/eprint/3660 |
Loading previews...
