Answer:
B innovative
Explanation:
new and better are synonymous with innovation
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:
The output is: Your cost is 100
Explanation:
Given
The above code snippet
and
Required
Determine the output of the code
if cost < 70 or cost > 150
The above condition checks if cost is less than 70 or cost is greater than 150
This condition is false because 100 is neither less than 70 nor is it greater than 150
So, the else statement will be executed.
discount = cost
Which means
discount = 100
So, the print instruction will print: Your cost is 100
