Open course ware

[SQUEAKING] [RUSTLING] [CLICKING] JASON KU: Hey, everybody. Welcome back. This is our last quiz review for the term, quiz 3, we'll be talking about, which will be the last quiz until the final. It's on dynamic programming, which you guys have been studying in lectures, and recitations, and on your problem sets 7 and 8, and lectures 15 through 18, so four lectures. Quiz 1 and quiz 2 material on, essentially, data structures and graph algorithms aren't going to be explicitly test-- or we're not trying to explicitly test it, that material, on quiz 3. But it is fair game. The material's cumulative. And so if you have to store some stuff in the data structure, that's fair game. But we're not specifically trying to test you on that material. OK, and really, we haven't learned all that much new material in these last four lectures in this unit. So this is scope. We've got, we're mostly handling dynamic programming on these four lectures an...

[SQUEAKING] [RUSTLING] [CLICKING] JASON KU: All right. Welcome, everybody. Everyone ready for the quiz? AUDIENCE: No. JASON KU: Quiz next week. Yes. I hope you all are here because you know that there's a quiz next week. OK. So what is this quiz about? It's about what we've talked about so far in this class of course. What is this class about? Someone remember from my first lecture? What is this class about? What are we trying to test you in this class? AUDIENCE: Algorithims. JASON KU: Algorithms. Great. Also data structures. Right? That's what the first part of this is. But really it's to get you to solve computational problems. That's the first thing. Be able to argue to someone else that you actually did solve it. Right? It's correct. Right? That you chose something that's better than other things, that it's efficient. Right? And that you can communicate those things to other people. Right? Those are my big four that I try to get you...