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;
25 Cards in this Set
- Front
- Back
Aggregation |
Relationship between object types in which one object contains an object of another type |
|
Association |
If the relationship is not inheritance and it is not an aggregation then it is an association |
|
Association Aggregation |
A type of aggregation where if the containing object is deleted, the object it contains still exists |
|
Attribute |
A property or characteristic of an object |
|
Behaviours |
The functions of an object or what the object does |
|
Class Definition |
A template that can be used to create objects of that class |
|
Composition Aggregation |
A type of aggregation where if the containing object is deleted the object contains is also deleted |
|
Encapsulation |
Combining a record with the procedures and functions that manipulate it to form a new datatype (a class in OOP) |
|
Inheritance |
The relationship between two object types in which one is a kind of the other and shares some of its properties or behaviours |
|
Instantiation |
An object is defined based on a class |
|
Object |
An instance of a class |
|
Overriding |
When a method in the derived class provides a specific implementation of a method that is already provided by the base class |
|
Polymorphism |
Giving an action one name that is shared up and down a class hierarchy. Each class in the hierarchy implements the action in a way appropriate to itself |
|
Abstract Data Type |
A data type whose properties are specified independently of any particular programming language |
|
Dynamic Data Structure |
A data structure whose consumed memory varies at runtime |
|
List |
A collection of elements with an inherent order |
|
Pointer (Data Type) |
A variable that contains a memory address |
|
Static Data Structure |
A data structure whose consumed memory is declared before runtime |
|
Circular Queue |
When the array element with the largest possible index value is occupied, the next element to be added reuses the now unused element at the first index value |
|
(Linear) Queue |
A First-In, First-Out abstract data type in which elements join the queue at one end and leave at the other |
|
Stack |
A Last-In, First-Out structure in which items and pushed and popped from the same end |
|
Hash Table |
A data structure that creates a mapping between keys and values |
|
Collision |
When two key values compute the same hash |
|
Dictionary |
A collection of key-value pairs in which a value is accessed with its associated key |
|
Baud rate |
The rate at which signals on a wire may change |