I'll be available in my office (Adams 216) every Monday 2:45-4:00pm and Tuesday 9:30-11:00am.
I picked these times to (hopefully) minimize conflicts with other classes and to give you a chance to meet before homeworks and quizzes.
Fun Aside: I've got a locked mini-fridge in my office, and I challenge you all to try to break into the fridge and "steal" a snack. It turns out that the brute force algorithm for opening a lock has runtime $O(n^2)$, lock picking has runtime $O(n)$, and shimming has runtime $O(1)$. We'll talk in detail about this mathematical notation later in the course, but in the meantime you can find a tutorial on how to pick a lock here and a tutorial on shimming here.
I'll be available in my office (Adams 216) every Monday 2:45-4:00pm and Tuesday 9:30-11:00am.
I picked these times to (hopefully) minimize conflicts with other classes and to give you a chance to meet before homeworks and quizzes.
Fun Aside: I've got a locked mini-fridge in my office, and I challenge you all to try to break into the fridge and "steal" a snack. It turns out that the brute force algorithm for opening a lock has runtime $O(n^2)$, lock picking has runtime $O(n)$, and shimming has runtime $O(1)$. We'll talk in detail about this mathematical notation later in the course, but in the meantime you can find a tutorial on how to pick a lock here and a tutorial on shimming here.