Compute the load factors for the following situations

1 Explain how hashing can provide constant-time access to a data structure.

2 What is a home index?

3 What causes collisions?

4 How does the linear method of resolving collisions work?

5 What causes clustering?

6 How does the quadratic method of resolving collisions work, and how

does it mitigate clustering?

7 Compute the load factors for the following situations:

a An array of length 30 with 10 items.

b An array of length 30 with 30 items.

c An array of length 30 with 100 items.

8 Explain how chaining works.

find the cost of your paper

Suggest a modification of the binary search algorithm that emulates this strategy for a list of names.

1. Suppose that a list contains the values 20 44 48 55 62 66 74 88 93 99 at index positions 0 through 9. Trace the values of the variables….

Explain why insertion sort works well on partially sorted lists.

1. Which configuration of data in a list causes the smallest number of exchanges in a selection sort? Which configuration of data causes the largest number of exchanges? 2. Explain….

Draw a class diagram that shows the relationships among the classes in this new version of the system

Jack decides to rework the banking system, which already includes the classes BankView, Bank, SavingsAccount, and RestrictedSavingsAccount. He wants to add another class for checking accounts. He sees that savings….