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;
32 Cards in this Set
- Front
- Back
|
list |
collection of data whose entries are arranged sequentially |
|
|
stack |
A list in which entries are removed and inserted only at head |
|
|
queue |
entries removed at head and inserted at tails |
|
|
array |
a block of data whose entries are the same type. |
|
|
indices |
identify position |
|
|
aggregate |
block of data items that might be different types or sizes. |
|
|
LiFO |
Last In first out |
|
|
pop |
remove entry at top |
|
|
push |
insert entry at top |
|
|
tree |
collection of data whose entries have hierachical organization |
|
|
parent |
above |
|
|
children |
dependent nodes |
|
|
node |
entry in tree |
|
|
root node |
entry at top |
|
|
ancestor |
parent of parent |
|
|
decendent |
child of child |
|
|
siblings |
nodes that share parent |
|
|
leaf |
independent and has not produced any offspring |
|
|
Binary tree |
every node has at most tto children |
|
|
depth |
how many levels. Based on deepest node of all |
|
|
Abstraction |
shields users from details of actual data storage. |
|
|
pointer |
a storage area that encodes an address where data is stored Later used to access the data |
|
|
Memory address is at |
the end of the pointer |
|
|
name |
stores content of list member |
|
|
queues |
circular list |
|
|
linked structure |
each node is data cell and two child pointers |
|
|
Continuous array structure |
A[1]=Root node A[2] and A[3] are children of A[1] |
|
|
class |
abstract data type with extra features |
|
|
features of class |
1. properties can be inherited 2. Constructor methods to initialize new objects 3. Contents can be encapsulated |
|
|
immediate addressing |
instruction contains the data to be accessed |
|
|
direct addressing |
instruction contains the address of the data to be accessed |
|
|
indirect addressing |
instruction contains the location of the address of the data to be accessed. |
