CSE 373: Winter 2013 (by Marty Stepp @ University Of Washington

Course Link: https://courses.cs.washington.edu/courses/cse373/13wi/index.shtml

• HW1: Stable Marriage (Gale-Shapley Algorithm for Stable Marriages)
• HW2: Star Chart (using Guava library)
• HW3: The Amazing Deque
  • Part 1: Implement A* algorithm as described using Deque provided in java.util library
  • Part 2: Implement Deque using circular buffer array
• HW4: HashMaps vs. Zombies
  • Part 1: Code hashCode() and equals() method for HvZPlayer class
  • Part 2: Implement HashMap with separate chaining
• HW5: The Even-More-Amazing Heap
  • Part 1: Implement A* algorithm as described using PriorityQueue and write an inner Comparator class
  • Part 2 Implement a PriorityQueue using heap structure.
• HW6: The Rotating Dead Implement the same game from HW4 in using tree-based collection and also implement AVL tree extending BST class
• HW7: Sort Detective Implement quicksort algorithm for Strings with a median-of-3 pivot and insertion sort on small subsections to improve performance
• HW8: Six Degrees of Kevin Bacon Implement depth-first search, breadth-first search and Dijkstra's algorithm on a given graph