So last week I completed my second and final week back at Stuy teaching CS. We spent Monday finishing up the mode lesson and then spent most of the week on this topic - writing a computer program to automatically decode something "encrypted" with a Caesar Cipher. The post I just linked to was from when I first taught the lesson. I've refined and reworked it considerable since then but the gist is the same.

Once again, there were three sets of Birds of a Feather sessions. Two at the end of the day on Thursday but before the big reception and one partly over lunch on Friday. Last year I enjoyed two but walked out o the third mid session. This year, I enjoyed two but just missed the third because I got caught up talking to an old friend. Both of the sessions I enjoyed suffered from the usual BOF problems - since the sessions were well attended and time was short, it was tough to get deep discussions going and also keep the entire BOF together.

As you might have heard, I'm back at Stuyvesant teaching. Not permanent or full time - just covering for a CS teacher who's on grand jury duty. She's out for three week but since I was at SIGCSETS for the first one, I'm only covering for two. Last week and the one upcoming. I wouldn't be covering all 5 of the teacher's classes, just 3 - periods 6, 7, and 8, the second half of Stuy's intro CS class.