Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
21 Cards in this Set
- Front
- Back
|
Abstract Data Type |
A conceptual model of how data can be stored and the operations that can be carried out on the data. |
|
|
Data Structure |
A common format for storing related data, which is an implementation of an abstract data type. |
|
|
Array |
A set of related data items stored under a single identifier. |
|
|
Text File |
A file containing human-readable characters. Each line is referred to as a record. Different items of data are referred to as fields. |
|
|
Binary File |
A file containing a sequence of 0s and 1s. Contains some header information that describes what the binary code represents. |
|
|
Queue |
A data structure where the first item added is the first item removed. |
|
|
Stack |
A data structure where the last item added is the first item removed. |
|
|
Static Data Structure |
A method of storing data where the amount of data stored is fixed. |
|
|
Dynamic Data Structure. |
A method of storing data where the amount of data stored may change as the program is run. More efficient as memory is taken up when not needed. |
|
|
Heap |
A pool of unused memory that can be allocated to a dynamic data structure. Dynamic data structures take blocks of memory off the heap if needed and put unused blocks back back when not. |
|
|
Uses of Text Files: |
Database |
|
|
Uses of Binary Files: |
PNG Images Executable Files. |
|
|
Pointer |
A data item that identifies a particular element in a data structure. |
|
|
Stack Frame |
A collection of data about a subroutine call. Contains the function call and its argument data and local variables, followed by the return address and a frame pointer. |
|
|
Call Stack |
A stack used to store information about active subroutines and functions within a program. Composed of stack frames. |
|
|
Frame Pointer |
used to reference all the function parameters and local variables in the current stack frame. |
|
|
Linear Queue |
A FIFO data-structure organised as a line of data. One pointer points to the first element of the list and the other points to the last element. When an element is added, the end pointer is incremented by 1, and when the first element is removed, the first pointer is incremented by 1. |
|
|
Circular Queue |
A FIFO data-structure implemented as a ring where the front and read pointer can wrap around from the end to the start of the array. |
|
|
Advantages of a Circular Queue |
They reuse memory space, meaning they won't overwrite data or run out of memory (within limits |
|
|
Disavantages of a Circular Queue |
Involve storing pointers as well as data, taking up more space than linear queues Limited by the amount of data available in the buffer |
|
|
Priority Queue |
A queue where some data may leave the sequence where it has a higher priority than the other data items. Items leave by priority and then by order in queue (closest to the front). |
