Please be sure also to see the resource in the discussion for each lecture. They have been selected to help with each specific topic, although you can weigh in on how effective they are.
Practice Midterm
Practice Final
Course Reference
Required Readings
- Dasgupta’s Algorithms: Online Version | Amazon
Programming
- Java Documentation: Link
- Java Data Structures (NDS4): Link
- Introduction to Python: PDF
- Python Coding Conventions: PDF
- Python Tips: PDF
Quick question: I was doing the practice final, and one of the questions requires that I use either prims or Kruskal’s. After looking back in the lecture slides, they said that prims runs in
O(|E + V| log |V|). But in a connected graph, since E is at least V-1, can’t we just say that prim’s runs in E log V?