Presentation is loading. Please wait.

Presentation is loading. Please wait.

CS 112 - Fall 2012, Lab 11 Haohan Zhu.

Published byΘαλής Γαλάνη Modified over 5 years ago

Similar presentations

Presentation on theme: "CS 112 - Fall 2012, Lab 11 Haohan Zhu."— Presentation transcript:

1 CS Fall 2012, Lab 11 Haohan Zhu

2 Hashing Space & Time Tradeoff O(n/m) for searching
CS Fall 2012, Lab 11 4/30/2019 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 Hashing in Java Hash Code hashCode() is a method in Java
CS Fall 2012, Lab 11 4/30/2019 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 R-B Tree and Hash Table in Java
CS Fall 2012, Lab 11 4/30/2019 R-B Tree and Hash Table in Java Red-Black Tree: TreeMap<K,V> Hash Table: HashMap<K,V>

5 Graph Vertices: V Edges: E Representation Adjacency list
CS Fall 2012, Lab 11 4/30/2019 Graph Vertices: V Edges: E Representation Adjacency list Adjacency matrix Adjacency sets

6 Graph Traversal Depth-first traversal Stack Breadth-first traversal
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal Depth-first traversal Stack Breadth-first traversal Queue

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

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

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

10 Graph Traversal DFS C B A Stack B E C A F D G
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal DFS B E C A F C B A D G Stack

11 Graph Traversal DFS D C B A Stack B E C A F D G
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal DFS B E D C A F C B A D G Stack

12 Graph Traversal DFS D C B A Stack B E C A F D G
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal DFS B E D C A F C B A D G Stack

13 Graph Traversal DFS E B A Stack B E C A F D G
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal DFS B E C A F E B A D G Stack

14 Graph Traversal DFS F E B A Stack B E C A F D G
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal DFS B E F C A F E B A D G Stack

15 Graph Traversal DFS G F E B A Stack B E C A F D G
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal DFS B E G F C A F E B A D G Stack

16 Graph Traversal DFS G F E B A Stack B E C A F D G
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal DFS B E G F C A F E B A D G Stack

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

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

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

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

21 Graph Traversal BFS B D G Queue B E C A F D G
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal BFS B E B D G C A F D G Queue

22 Graph Traversal BFS B D G Queue B E C A F D G
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal BFS B E B D G C A F D G Queue

23 Graph Traversal BFS D G C Queue B E C A F D G
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal BFS B E D G C C A F D G Queue

24 Graph Traversal BFS D G C E Queue B E C A F D G
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal BFS B E D G C C A F E D G Queue

25 Graph Traversal BFS D G C E Queue B E C A F D G
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal BFS B E D G C C A F E D G Queue

26 Graph Traversal BFS G C E Queue B E C A F D G
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal BFS B E G C E C A F D G Queue

27 Graph Traversal BFS C E F Queue B E C A F D G
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal BFS B E C E F C A F D G Queue

28 Graph Traversal BFS C E F Queue B E C A F D G
CS Fall 2012, Lab 11 4/30/2019 Graph Traversal BFS B E C E F C A F D G Queue

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

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

Download ppt "CS 112 - Fall 2012, Lab 11 Haohan Zhu."

Similar presentations

CS 112 - Fall 2012, Lab 08 Haohan Zhu. Boston University Slideshow Title Goes Here CS 112 - Fall 2012, Lab 08 2 4/17/2015 Tree - Data Structure  Basic.

CS Fall 2012, Lab 08 Haohan Zhu. Boston University Slideshow Title Goes Here CS Fall 2012, Lab /17/2015 Tree - Data Structure  Basic.
Graphs CS-240/341. Graphs Used for representing many-to-many relationships –can take two forms directed (digraph) - a finite set of elements called vertices.

Graphs CS-240/341. Graphs Used for representing many-to-many relationships –can take two forms directed (digraph) - a finite set of elements called vertices.
Course Overview CS221 – Advanced Programming Fall 2007 : Ray S. Babcock Computer Science Department Montana State University.

Course Overview CS221 – Advanced Programming Fall 2007 : Ray S. Babcock Computer Science Department Montana State University.
CS 206 Introduction to Computer Science II 11 / 12 / 2008 Instructor: Michael Eckmann.

CS 206 Introduction to Computer Science II 11 / 12 / 2008 Instructor: Michael Eckmann.
Alyce Brady CS 510: Computer Algorithms Depth-First Graph Traversal Algorithm.

Alyce Brady CS 510: Computer Algorithms Depth-First Graph Traversal Algorithm.
CS 206 Introduction to Computer Science II 11 / 12 / 2008 Instructor: Michael Eckmann.

CS 206 Introduction to Computer Science II 11 / 12 / 2008 Instructor: Michael Eckmann.
Introducing Hashing Chapter 21 Copyright ©2012 by Pearson Education, Inc. All rights reserved.

Introducing Hashing Chapter 21 Copyright ©2012 by Pearson Education, Inc. All rights reserved.
CS212: DATA STRUCTURES Lecture 1: Introduction. What is this course is about ?  Data structures : conceptual and concrete ways to organize data for efficient.

CS212: DATA STRUCTURES Lecture 1: Introduction. What is this course is about ?  Data structures : conceptual and concrete ways to organize data for efficient.
Chapter 5: Hashing Collision Resolution: Separate Chaining Mark Allen Weiss: Data Structures and Algorithm Analysis in Java Lydia Sinapova, Simpson College.

Chapter 5: Hashing Collision Resolution: Separate Chaining Mark Allen Weiss: Data Structures and Algorithm Analysis in Java Lydia Sinapova, Simpson College.
Graphs – Part II CS 367 – Introduction to Data Structures.

Graphs – Part II CS 367 – Introduction to Data Structures.
ITEC 2620A Introduction to Data Structures Instructor: Prof. Z. Yang Course Website: 2620a.htm Office: TEL 3049.

ITEC 2620A Introduction to Data Structures Instructor: Prof. Z. Yang Course Website: 2620a.htm Office: TEL 3049.
CS 206 Introduction to Computer Science II 11 / 16 / 2009 Instructor: Michael Eckmann.

CS 206 Introduction to Computer Science II 11 / 16 / 2009 Instructor: Michael Eckmann.
Final Exam Tuesday, December 22nd 2:00 - 3:50pm room 102 Warren Weaver Hall.

Final Exam Tuesday, December 22nd 2:00 - 3:50pm room 102 Warren Weaver Hall.
Review for Final Exam – cs411/511 Definitions (5 questions, 2 points each) Algorithm Analysis (3 questions, 3 points each) General Questions (3 questions,

Review for Final Exam – cs411/511 Definitions (5 questions, 2 points each) Algorithm Analysis (3 questions, 3 points each) General Questions (3 questions,
Review for Final Exam Non-cumulative, covers material since exam 2 Data structures covered: –Treaps –Hashing –Disjoint sets –Graphs For each of these data.

Review for Final Exam Non-cumulative, covers material since exam 2 Data structures covered: –Treaps –Hashing –Disjoint sets –Graphs For each of these data.
Week 10 - Friday.  What did we talk about last time?  Graph representations  Adjacency matrix  Adjacency lists  Depth first search.

Week 10 - Friday.  What did we talk about last time?  Graph representations  Adjacency matrix  Adjacency lists  Depth first search.
Brute Force and Exhaustive Search Brute Force and Exhaustive Search Traveling Salesman Problem Knapsack Problem Assignment Problem Selection Sort and Bubble.

Brute Force and Exhaustive Search Brute Force and Exhaustive Search Traveling Salesman Problem Knapsack Problem Assignment Problem Selection Sort and Bubble.
Representing Graphs Depth First Search Breadth First Search Graph Searching Algorithms.

Representing Graphs Depth First Search Breadth First Search Graph Searching Algorithms.
Review Graph Directed Graph Undirected Graph Sub-Graph Spanning Sub-Graph Degree of a Vertex Weighted Graph Elementary and Simple Path Link List Representation.

Review Graph Directed Graph Undirected Graph Sub-Graph Spanning Sub-Graph Degree of a Vertex Weighted Graph Elementary and Simple Path Link List Representation.
CS 202, Spring 2003 Fundamental Structures of Computer Science II Bilkent University1 Graph Algorithms CS 202 – Fundamental Structures of Computer Science.

CS 202, Spring 2003 Fundamental Structures of Computer Science II Bilkent University1 Graph Algorithms CS 202 – Fundamental Structures of Computer Science.

Similar presentations

Ads by Google