1 / 30

CS 112 - Fall 2012 , Lab 11

CS 112 - Fall 2012 , Lab 11. Haohan Zhu. Hashing. Space & Time Tradeoff O(n/m) for searching Design Hashing Function Key Hash Code => Table Index Deal with Collisions: Separate Chaining Linear Probing. Hashing in Java. Hash Code hashCode() is a method in Java

romaj
Download Presentation

CS 112 - Fall 2012 , Lab 11

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. CS 112 - Fall 2012, Lab 11 Haohan Zhu

  2. CS 112 - Fall 2012, Lab 11 Hashing • Space & Time Tradeoff • O(n/m) for searching • Design Hashing Function • Key • Hash Code => Table Index • Deal with Collisions: • Separate Chaining • Linear Probing

  3. CS 112 - Fall 2012, Lab 11 Hashing in Java • Hash Code • hashCode() is a method in Java • String: s[0]*31^(n-1) + s[1]*31^(n-2) + ... + s[n-1] • Integer: equal to the primitive int value • Double: (int)(v^(v>>>32)) • Always an int value

  4. CS 112 - Fall 2012, Lab 11 R-B Tree and Hash Table in Java • Red-Black Tree: • TreeMap<K,V> • http://docs.oracle.com/javase/7/docs/api/java/util/TreeMap.html • Hash Table: • HashMap<K,V> • http://docs.oracle.com/javase/7/docs/api/java/util/HashMap.html

  5. CS 112 - Fall 2012, Lab 11 Graph • Vertices: V • Edges: E • Representation • Adjacency list • Adjacency matrix • Adjacency sets

  6. CS 112 - Fall 2012, Lab 11 Graph Traversal • Depth-first traversal • Stack • Breadth-first traversal • Queue

  7. CS 112 - Fall 2012, Lab 11 Graph Traversal DFS B E C A F D G Stack

  8. CS 112 - Fall 2012, Lab 11 Graph Traversal DFS B E C A F A D G Stack

  9. CS 112 - Fall 2012, Lab 11 Graph Traversal DFS B E C A F B A D G Stack

  10. CS 112 - Fall 2012, Lab 11 Graph Traversal DFS B E C A F C B A D G Stack

  11. CS 112 - Fall 2012, Lab 11 Graph Traversal DFS B E D C A F C B A D G Stack

  12. CS 112 - Fall 2012, Lab 11 Graph Traversal DFS B E D C A F C B A D G Stack

  13. CS 112 - Fall 2012, Lab 11 Graph Traversal DFS B E C A F E B A D G Stack

  14. CS 112 - Fall 2012, Lab 11 Graph Traversal DFS B E F C A F E B A D G Stack

  15. CS 112 - Fall 2012, Lab 11 Graph Traversal DFS B E G F C A F E B A D G Stack

  16. CS 112 - Fall 2012, Lab 11 Graph Traversal DFS B E G F C A F E B A D G Stack

  17. CS 112 - Fall 2012, Lab 11 Graph Traversal BFS B E C A F D G Queue

  18. CS 112 - Fall 2012, Lab 11 Graph Traversal BFS B E C A F D G Queue

  19. CS 112 - Fall 2012, Lab 11 Graph Traversal BFS B E B C A F D G Queue

  20. CS 112 - Fall 2012, Lab 11 Graph Traversal BFS B E B D C A F D G Queue

  21. CS 112 - Fall 2012, Lab 11 Graph Traversal BFS B E B D G C A F D G Queue

  22. CS 112 - Fall 2012, Lab 11 Graph Traversal BFS B E B D G C A F D G Queue

  23. CS 112 - Fall 2012, Lab 11 Graph Traversal BFS B E D G C C A F D G Queue

  24. CS 112 - Fall 2012, Lab 11 Graph Traversal BFS B E D G C C A F E D G Queue

  25. CS 112 - Fall 2012, Lab 11 Graph Traversal BFS B E D G C C A F E D G Queue

  26. CS 112 - Fall 2012, Lab 11 Graph Traversal BFS B E G C E C A F D G Queue

  27. CS 112 - Fall 2012, Lab 11 Graph Traversal BFS B E C E F C A F D G Queue

  28. CS 112 - Fall 2012, Lab 11 Graph Traversal BFS B E C E F C A F D G Queue

  29. CS 112 - Fall 2012, Lab 11 Graph Traversal BFS B E E F C A F D G Queue

  30. CS 112 - Fall 2012, Lab 11 Graph Traversal BFS B E F C A F D G Queue

More Related