20162314 2017-2018-1 《Program Design & Data Structures》Learning Summary Of The Eleventh Week

Summary of Key Concepts

In hashing, elements are stored in a hash table, with their location in thetable determined by a hashing function.
The situation where two elements or keys map to the same location in the table is called a collision.
A hashing function that maps each element to a unique position in the table is said to be a perfect hashing function.
Extraction involves using only a part of the element’s value or key to compute the location at which to store the element.
The division method is very effective when dealing with an unknown set of key values.
In the shift folding method, the parts of the key are added together to create the index.
The length-dependent method and the mid-square method may also be effectively used with strings by manipulating the binary representations of the characters in the string.
Although Java provides a hashcode method for all objects, it is often preferable to define a specific hashing function for any particular class.
The chaining method for handling collisions simply treats the hash table conceptually as a table of collections rather than as a table of individual cells.
The open addressing method for handling collisions looks for another open position in the table other than the one to which the element is originally hashed.
The load factor is the maximum percentage occupancy allowed in the hash table before it is resized.

What is the difference between a hash table and the other collections we have discussed?

Elements are placed into a hash table at an index produced by a function of the value of the element or a key of the element.
This is unique from other collections where the position/locationof an element in the collection is determined either by comparison
with the other values in the collection or by the order in which the elements were added or removed from the collection.

What is our goal for a hashing function?

We need a hashing function that will do a good job of distributing elements into positions in the table.

What is the consequence of not having a good hashing function?

If we do not have a good hashing function, the result will be too many elements mapped to the same location in the table. This will result in poor performance.

Why is deletion from an open addressing implementation a problem?

Because of the way that a path is formed in open addressing,deleting an element from the middle of that path can cause elements beyond that on the path to be unreachable.

What is the load factor and how does it affect table size?

The load factor is the maximum percentage occupancy allowed in the hash table before it is resized. Once the load factor has
been reached, a new table is created that is twice the size of the current table, and then all of the elements in the current table
are inserted into the new table.

20162314 《Program Design & Data Structures》Learning Summary Of The Eleventh Week

What is the maximum number of edges for an undirected graph? A directed graph?

The maximum element is removed from a heap (maxheap) by replacing the root with the last leaf of the tree, then moving that
element down the tree as appropriate to reassert the proper relationships among the elements.

Linear search is always more effective than binary search.The answer should be false, for the situation of "n = 2".

Advantage and problem in the blog：
- Concise and comprehensie
- Uncleary to the content
- Mould is amazing
Advantage and problem in the code：
- Serious writing.
- Wonderful idea
- Too less

It's not easy to persere on utizing English to write a blog.But I'm getting used to doing this because of the benefit.

	Code line number（increasing/accumulative）	Blog number（inc/acc）	studying time（inc/acc）
target	5000lines	30articles	400hours
First week	180/180	1/1	20/20
Second week	1049/1229	1/2	18/38
Third week	1037/2266	3/7	22/60
Fourth week	1120/3386	2/9	30/90