CompSci - Data Organisation Flashcards
mffffffhhgfgg
1
Q
Operations on data structures
A
CSS TRIM
Copy
Search
Sort
Traverse
Remove
Insert
Merge
2
Q
Multi-Level Index
A
Method of storing data in several levels, each representing a more detailed reference to the data it contains.
3
Q
Collision Operations
A
Best
Rehashing - reapply algorithm or change
Daisy chaining - creates linked list at collision address
Linear probing - stores data at next free address
Overflow area - creates unsorted serial file to store collisions.
Worst