Where do skip lists get their name?
ArrayList class and then analyze their performance.
remove: Delete the item at the given index from the list.
pop: Implement the pop method with and without a positional parameter.
index: Search for a given value in the
ArrayList. Return its position in the list if it is found and -1 if the item is not present.
encrypt method of the Caesar cipher (Listing 8.3.1) to accept a parameter that specifies the encryption key.
delete method for a skip list. You can assume that the key is present.
contains() will return a boolean result as to whether a key is present in the map.
keys() will return a list of keys in the map.
values() will return a list of values in the map.
getItem() and the
setItem() methods for a skip list.
Octree class to improve the performance of the
reduce method by using a more efficient data structure for keeping track of the leaf nodes.
Octree class, one to write a quantized image to a disk file and one to read a file of the same format you wrote.
Octree quantization look at the total count for all the children of a node and use that information to decide which nodes to reduce. Modify the
Octree implementation to use this method of node selection for reducing the tree.
mismatchedLinks method, write a method that will take a pattern and create the complete KMP graph. With the graph complete, write a program that will run an arbitrary text against the KMP graph and return whether a match exists.