Today we’ll continue (and maybe finish!) our work on an algorithm for clustering photos.
- UPDATE on the last pre-class quiz: A minority of people correctly identified the greedy condition used in Dijkstra’s Algorithm. PLEASE GO BACK AND RE-READ THAT SECTION! If you have trouble with it, ask questions (in class, on Piazza, in office hours, etc.). You do need to learn not only from lecture and tutorial but from the textbook, and Dijkstra’s Algorithm is an example of a very important algorithm we expect you to learn about from the text! (Yes, we can ask about it on the exam.)
Additionally, participation in online quizzes has been dropping. Remember these are graded, and if you do well on them, they can be 5% of your course grade. If you really want to ignore them, they’ll only be 1%, but (a) you need to do the readings anyway to prepare for the exams, (b) if you don’t do the readings before class, you’ll learn much less in class, and (c) you’ll have to fill in that other 4% with some other course element, which you’ll be doing much worse on if you don’t do the readings. So, do the readings and the pre-class quizzes. See the syllabus for more info on our grades.
- For next time, read Sections 4.7. No pre-class quiz, however.
- In case we get there, here’s a set of notes to wrap up photo clustering.
- There is a third quiz in tutorial next week, but there will be no follow-up assignment. Instead, use the quiz and problems as an opportunity to practice for the exam. (We’ll clarify where the grade for the “assignment” portion of this quiz/assignment comes from soon.)
- The midterm exam is coming up on Wed 15 Feb. We’ll post details about the exam (e.g., length of the individual and group stages and room assignments) on Piazza soon.