COMPSCI 61B Lecture Notes - Lecture 21: Software Engineering, Modular Design, Coursera
1 Jun 2017
School
Department
Course
Professor
Document Summary
Application of disjoint sets towards a cool physics problem. First design is probably going to be ugly. Your choice of underlying data structures make a critical di erence in how hard your code is to implement. Inheritance and generics are not always the answer. Working on a team has a complex human dimension and can be anywhere between infuriating and wonderful. Future hws and project 3 will not quite feel like this one. Go through study guides soon after the relevant lecture. Work on study guide problems independently, and discuss solutions with others. Includes extra practice with various data structures topics, as well as a limitless pool of asymptotic runtime analyses problems. Unfortunately, coursera broke the exercises with a recent update, so these problems are on hold for now. A set of edges that connect these nodes. Constraint: there is exactly one path between any two nodes. In a rooted tree, we call one node the root.
