the name of array
the data type of array
the index set of the array
the first data from the set to be stored
D. the first data from the set to be stored
for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for none of above situation
Data
Operations
Both of the above
None of the above
underflow
overflow
housefull
saturated
Arrays
Linked lists
Both of above
None of above
Arrays
Records
Pointers
Stacks
AVL tree
Red-black tree
Lemma tree
None of the above
array
lists
stacks
all of above
Much more complicated to analyze than that of worst case
Much more simpler to analyze than that of worst case
Sometimes more complicated and some other times simpler than that of worst case
None or above
Arrays
Records
Pointers
None
Graph
Binary tree
Trees
Stack
tables arrays
matrix arrays
both of above
none of above
Operations
Algorithms
Storage Structures
None of above
Last in first out
First in last out
Last in last out
First in first out
internal change
inter-module change
side effect
side-module update
linear arrays
linked lists
both of above
none of above
O(n)
O(log )
O(n2)
O(n log n)
for relatively permanent collections of data
for the size of the structure and the data in the structure are constantly changing
for both of above situation
for none of above situation
push, pop
insert, delete
pop, push
delete, insert
Application level
Abstract level
Implementation level
All of the above
True, False
False, True
True, True
False, False
The list must be sorted
there should be the direct access to the middle element in any sublist
There must be mechanism to delete and/or insert elements in list
none of above
3 additions and 2 deletions
2 deletions and 3 additions
3 deletions and 4 additions
3 deletions and 3 additions
O(n)
O(log n)
O(n2)
O(n log n)
Graphs
Binary tree
Stacks
Queues
16
12
6
10
An array is suitable for homogeneous data but the data items in a record may have different data type
In a record, there may not be a natural ordering in opposed to linear array.
A record form a hierarchical structure but a linear array does not
All of above
Counting microseconds
Counting the number of key operations
Counting the number of statements
Counting the kilobytes of algorithm
sorted linked list
sorted binary trees
sorted linear array
pointer array
Dynamic programming
Greedy method
Divide and conquer
Backtracking
underflow
overflow
housefull
saturated