Readings to finish for the week of Oct 8-Oct 14

Sorry for the late posting on this one!

Our upcoming readings for this week are: Sections 4.5 through 4.7. Happily, the Canvas quiz has been up for several days and also lists the readings!

PageRank bonus worksheet

A tutorial and bonus mini-assignment (worth up to three bonus marks) on the PageRank algorithm has been posted. It’s based on the material in today’s PageRank session. If you weren’t able to make the session, there should be enough information in the walkthrough for you to be able to take a stab at the questions anyway.

If you’re interested, here is a zip file of the MATLAB functions I used in the session. (A warning that some of the plotting commands may not work as expected in Octave or older versions of MATLAB.)

Clustering Worksheet

We’ll spend a bit more time playing with graphs and Chapter 3 and see if it brings us to Chapter 4.

Here’s stage one of our clustering worksheet.

Graph Play Worksheet Sample Solution

Here is a sample solution to the graph play 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!

Readings to finish for the week of Oct 1-Oct 7

Our upcoming readings for this week are: Sections 4.3 and 4.4. The quiz emphasizes 4.4. Hopefully, you’ll find the readings and the quiz shorter than usual!

PageRank Worksheet

Here’s our worksheet on PageRank, which will let us explore graphs and metrics (like our metric for how “good” a candidate diameter is).

Unlike diameter or articulation point, Google’s success suggests that PageRank really is an important property in graphs 🙂

Graph “Play” Worksheet

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.

Asymptotic Analysis Worksheet Sample Solution

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!

Assignment #2

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.

Readings to finish for the week of Sep 24-Sep 30

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.