Answer: preserves cell formatting and formulas
saves time
avoids copy-paste
organizes data so it is easier to draw comparisons
Explanation: just did it
Linear probing
It does a linear search for an empty slot when a collision is identified
Advantages
Easy to implement
It always finds a location if there is one
Disadvantages
When clusters and keys fill most of the array after forming in adjacent slots of the table, the performance deteriorates
Double probing/hashing
The idea here is to make the offset to the next position probed depending on the key value. This is so it can be different for different keys.
Advantages
Good for double number generation
Smaller hash tables can be used.
Disadvantages
As the table fills up, the performance degrades.
Quadratic probing
It is used to resolve collisions in hash tables. It is an open addressing scheme in computer programming.
Advantage
It is more efficient for a closed hash table.
Disadvantage
Has secondary clustering. Two keys have same probe sequence when they hash to the same location.
Answer: Have you gotten an answer yet?
UDP = connectionless vs. TCP is connection oriented.
Answer:
(9F7, 9F8, 9F9, 9FA, 9FB, 9FC, 9FD, 9FE, 9FF, A00, A01, A02, A03)
Explanation:
This means that we must find all hexadecimal values from 2551 to 2563, or 9F7 to A03. You can convert from decimal to hexadecimal for each one, or just count.
