Level 25 Level 27
Level 26

AS 1.4.2 - Data Structures


31 words 0 ignored

Ready to learn       Ready to review

Ignore words

Check the boxes below to ignore/unignore words, then click save at the bottom. Ignored words will never appear in any learning session.

All None

Ignore?
data structure
a specialised format for organising and storing data
array
a zero-based, finite / static, ordered set of elements of the same data type
index
each element of an array can be referenced using an ...
2D array
an array, organised as a matrix with columns and rows (ie. like a table / spreadsheet)
3D array
an array of arrays of arrays, such as an excel workbook (ie. multiple pages of spreadsheets)
x[0]
referencing the first item of a 1D array called x
x[0,1]
referencing the first row and second column of a 2D array called x
x[0,0,0]
referencing the first page, row and column of a 3D array called x
tuple
an immutable, static, ordered set of values (data structure) of any data type
immutable
unable to be changed
record
a data structure containing a number of fields, each holding one item of data (can be of any data type)
type
a file will generally be made up of a number of records, where the corresponding field position in each record has the same data ... (ie. like headers in a database)
dynamic data structure
a collection of data in memory (a data structure) that has the ability to grow or shrink in size
heap
a portion of memory used for dynamic data structures, from which space is automatically allocated or de-allocated as required by the data structure
memory limit
DISADVANTAGE OF DYNAMIC DATA STRUCTURES: may cause overflow if the data structure exceeds the maximum ...
static data structure
a data structure which cannot increase in size or free up memory while the program is running
list
a static or dynamic collection of data items stored in a sequence, where items can be of any data type, can be repeated, and can be inserted or deleted anywhere in the list
queue
a First In, First Out data structure which is abstract and has two pointers: front and next
abstract data type
a data type created by a programmer as it is not defined in the programming language
encapsulation
when the methods that are applied to a data structure, are kept with the data, in such a way that the attributes and methods of one object cannot affect another and it hides the details of implementation from the user
jobs
USE OF QUEUES: printing ...
keyboard
USE OF QUEUES: characters typed on a ...
situations
USE OF QUEUES: simulating real-life ...
known
Implementing a queue with a dynamic data structure can be good when the maximum size is not ...
methods and functions
Implementing a queue with a dynamic data structure can be good as some built-in dynamic structures like lists will already have many of the needed ...
program
Implementing a queue with a static data structure can be useful as the amount of storage there will be, is known, so could become easier to ...
stack
a Last In, First Out data structure which only has one pointer
called
USE OF STACKS: to hold return addresses when subroutines are...
web browsers
USE OF STACKS: for back and forward buttons in ...
redo buttons
USE OF STACKS: in applications for the undo and ...
Top of Stack pointer
a stack can be implemented as static or dynamic, if done as static, a variable will be needed to hold the maximum size of the stack and another will need to be the position of the...