That sounds like it could be a lot of fun. We can also talk about
whether we want to keep slogging through the lectures, skip around to
ones we like, or decide we've had enough of Prof. Boringpants and TA
On Sat, Jan 30, 2010 at 7:16 PM, Kanoelani Pilobello <ktp...@gmail.com> wrote:
> I am seriously behind too, but I'm trying to catch up by tomorrow.
> Would anyone be interested in doing an algorithms show and tell at the
> beginning of class just to make things interesting? We could just showcase
> an algorithm/something related to algorithms that we know of or is related
> to our work?
> I bring this up because I saw a lecture on a cool microorganism. I keep
> meaning to send it out in a email, but I might as well present it.
> On Sat, Jan 30, 2010 at 3:49 PM, Kelly Farrell <kel...@gmail.com> wrote:
>> So, admittedly I have been slacking a bit... the last lecture I've
>> watched is 12, but we can watch whatever the next interesting looking
>> lecture is this week. What's everyone else up to?
>> Kelly Farrell
>> On Fri, Jan 29, 2010 at 3:20 PM, Kanoelani Pilobello <ktp...@gmail.com>
>> > Hi,
>> > I had some flight delays coming back from vacation last Sunday. I just
>> > wanted to check in and see if you were still meeting this coming Sunday
>> > and
>> > what lecture we are on. 17 or 18?
>> > Thanks,
>> > Lani
>> > On Sun, Jan 24, 2010 at 9:58 AM, Kellbot <kel...@gmail.com> wrote:
>> >> Hey folks,
>> >> Just checking in to see if people will be making it to algorithms
>> >> today. We can pick up wherever folks have left off.
>> >> We're still in the Bridge St space, which hasn't been quite so frigid
>> >> lately. Hooray!
>> >> -Kelly
We ended up reading the lecture notes for skip lists, and then going
over it together, and that worked pretty well-- it was a lot more fun
than watching a lecture, and we got through the material in half the
time. We read the lecture notes for the amortized analysis lecture
after that, but agreed that the textbook or lecture would probably do
a better job of explaining it.
I really, really like the presentation idea, although we might want to
stick with 2-3 lectures as week, since we're finally starting to get
to fun stuff (graph algorithms, hooray!). That would take us through
Scheduling: there are a lot of scheduling collisions in Februrary
between algorithms and NYCR. On the weekend of the 13th-14th, we're
doing our 48 hour hackathon (because we are dumb nerds, and forgot
when valentines day was until long after we scheduled it), so the
space will probably be a chaotic shambles by the end of that (and
Kelly and I will probably be walking wounded). On the weekend of the
27th-28th, NYCR will be moving to its new space, and the evening of
the 28th will be Ranjit's lantern festival. We'll probably have to
reschedule or relocate both of those sessions. (Y'all are invited to
the hackathon and lantern festival, which should both be awesome.)
The good news about the move is that NYCR will have about three times
as much space, in separate rooms, which means we'll be able to run a
recurring class like this much more easily. The other good news about
the move is that it's a fourth-floor walkup, which means we all get to
develop awesome calves!
Also: Resistor is going to be pretty chaotic
Between the freezing weather / lack of heat, moving hell, and a bit of
dwindling enthusiasm I suggested we take February off to thaw out and
reboot in March with a format more like what we did this week.
Presentations sound awesome, and I think if we switched to reading the
notes / watching the videos at home and then coming together to talk
about it, instead of the other way around, it would be a lot more fun
If folks still want to meet in February I'm all for it, although
between preparing for the hackathon and moving I'm not sure if I'll be
able to make all of them. On the flip side, if we're not watching the
videos when we get together we're not as limited to where we can meet
(not needing a projector/wall). So it's up to you guys, but as Adam
said I'm going to be walking dead for most of February.
I'm up for exercises or projects. -a
Another fun an potentially useful thing might be to do a project on implementing the Traveling Salesman Problem.
Exactly why it would be interesting. I've seen smart implementations
which run the algorithm once and store the solutions for lookup.
Geography changes slowly, thankfully.
There are also some approximations that are guaranteed to come within
a guaranteed bound of the best solution in polynomial time. Companies
that build networks spend millions of dollars researching this stuff.
It's pretty neat.