CompSci - Data Organisation

Question 1

Operations on data structures

Answer 1

CSS TRIM

Copy
Search
Sort
Traverse
Remove
Insert
Merge

Question 2

Multi-Level Index

Answer 2

Method of storing data in several levels, each representing a more detailed reference to the data it contains.

Question 3

Collision Operations

Answer 3

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

Question 4

Errors That Can Occur Due To Left-Shift

Answer 4

Overflow, magnitude beyond the maximum bit capacity of the register
Underflow, magnitude too small to be represented accurately (1s dissappear)
SIgn change due to overflow into the signed bit