general

• textbook

lab 1

• generics / comparables
• part 6

lab 2

• page 78 in txtbk; how to implement linked list in java
• linkedlist.java ex
• linkedlist.java 2 ex
• lecture
• LIKE IT

lab 3

• doubly linked list
• doubly linked list 2
• " " 3
• there it is
• woop
• ???
• again

lab5

• uses comparables
• swartmore ppt?!
• princeton
• i dont even know
• BST.java
• BinarySearchTree.java
• washington.edu
• wellesley.edu
• focus on insertidk i dont really need it
• C# I DONT KNOW DELETE
• HOW DO IT DELTE DW=WORK
• WITH REFERENCE TO PARENTS
• I DONT FRICKIGN NOKNWOWA ANYNTIGNF FRICK MY STUPID SELF
• binary search tree oracle
• tree processing

project 1

• convert infix to prefix
• postfix.java
• calculator.java
• infixpostfix.java
• operators not being appended
• HW7
• problems
• infix.java

lab 7

• seg faults

project 1 (etc)

• implementing a stack in java w/ linked lists
• postfix calc.java parsing
• split string and put it into an array

project 1 again lmao

• helpful
• some pseudocode maybe helpful
• shunting yard algorithm
• " " java
• " " RPN
• infixtopostfix.cpp

project 1 (thurs night)

• from wiki
• calculator
• lewis/chase

midterm

• recursive method to print linked list in reverse

project 2

• pointlocator.java
• javanotes binary trees
• point2d.java

lab10

• heap.java
• inserting an element into a heap
• lecture ppt
• berkeley heap.java

lab10 / 2

• binary heap.java
• heapsort example
• heap.java
• maxheap.java
• canada heap delete
• algolist insert
• binary heaps
• book pdf
• umb Heap.java
• heapify ***HELPFUL

project 2 cont.

• slides
• someones thesis or something lmao
• Trees.pdf
• **HELPFUL: princeton locate.html
• intersection point of two lines
• k-d tree
• idk binary space partitioning
• Location.pdf
• Line2D
• Line2D intersection

project 2 again

• princeton X X
• Kd-Tree
• good data structure for storing 2d spatial coordinates in java
• 2d bsp tree
• java kd tree
• trees slides??
• bst to implement set of points
• binary trees is this even helpful

project 2 (03/13/14)

• wikipedia point location
• segment tree
• geometric primitives
• line segment intersection algorithm
• comparator for line2d
• avg height of a binary tree
• sum height nodes
• line geometry
• point between two other points of line seg

lab 11

• 5 arithmetic operations

project 3

• word search puzzle
• hashing exercises
• WordSearch.java
• speed up searches with hash tables
• more hashign stuff lmao
• pg 324 textbook
• QUADRATIC PROBING
• etc
• count collisions: rehash + expand array

lab 12

• hibbard's increments

lab 14

• graph.java

lab 16

• dijkstra's algorithm
• source vertex issues, implementation of d
• implementation of dijkstra's algorithm: code review
• geeksforgeeks: greedy algorithms
• adjacency lists
• intro to algorithms, pg 595

project 4

• kruskal's
• princeton kruskal's
• kruskal
• dijkstra's
• geeks for geeks
  • dijkstra
  • prim's
  • kruskal's
• sanfoundry kruskal's
• keith shwarz kruskal
• dreamincode: data structures, kruskal's algorithm