Here’s a worksheet to play around with definitions on graphs. Neither articulation points nor diameter are absolutely critical definitions, but they make good, novel definitions to explore and experiment with to understand graphs and graph terminology.
Posted in Handouts
Here is a sample solution to the asymptotic analysis worksheet. Take a look at it and be sure you understand where the solutions came from and how they relate to the work you did!
Posted in Handouts
Here is the initial version of Assignment #2, composed of the collected tutorial quizzes, solutions to those quizzes, and some extra questions building on the quizzes for the assignment. (Here is LaTeX source, with a .txt extension so the blog lets us post it!)
NOTE that we may add to the assignment shortly after the exam (by the end of the day Monday after the exam at the latest).
The assignment is spookily due on Fri 13 Oct at 10PM.
Please submit it on GradeScope.
Posted in Assignments
Our upcoming readings for this week are: Sections 3.5, 3.6, 4.1, and 4.2. This will start you in on greedy algorithms. We’ll start working on greedy algorithms via a graph example, bridging the graphs and greedy algorithms sections.
Posted in Readings
Enter your password to view comments.
Posted in Assignments
Here’s a pre reading document for quiz 2. Reading this before your quiz may help you avoid spending time reading/understanding it during the quiz. We’d urge you to do so!
(We may do this with future quizzes and exams.)
Posted in Assignments, Tutorials
Here is a sample solution to the RHP worksheet. Take a look at it and be sure you understand where the solutions came from and how they relate to the work you did!
Posted in Handouts
Here are the notes for this week’s tutorial on combinatorics, reductions, and logarithm rules (which we didn’t end up having time for in any of the tutorials, but are included in here!).
Posted in Tutorials
Here’s a worksheet to briefly discuss asymptotic analysis, considering both comparison of growth rates of functions and analysis of algorithms. We’ll start in on this worksheet soon, and we may move through it very quickly.
Also, here’s a one-pager to review big-O notation, add little-o notation, and offer a way that limits can help you with these comparisons.
Posted in Handouts
Our upcoming readings for the week of Sep 17-23 are: Sections 3.1, 3.2, 3.3, and 3.4. Sections 3.1-3.3 should be largely review, with section 3.4 providing a (hopefully!) new application area to explore.
Posted in Readings