Because of organizational mess, there is a high chance that I'll be preparing a ~3h class for gifted students during a spring-camp (a week-long gathering full of all kinds of nice things to do) which will be split into two 90-minutes chunks on two different days (hopefully consecutive).
I have very little experience concerning such setting (previously it was either one-shot or at least semester-long courses) and I'm afraid that with all the activities available, they won't remember anything for the next day.
What I would like to achieve:
- Although they need to declare which of the classes they want to attend (that is, either all the 3h or nothing), I don't want to tie them up with some sort of assignments, homeworks, problems to think about, whatever.
- This cannot be two different one-shot classes. The topic is set and based on previous experience, for this audience I need at least 2.5h to deliver it in an understandable manner.
- I would like avoid repeating myself, as this audience gets bored fast.
How to plan the class so that it will be relatively easy to bring students up to speed again when starting the second chunk?
My baseline plan was:
- prepare a few memorable (if I can manage) problems for the three most important concepts of the first day,
- give some handouts that the could refer to the next day,
- at the end of the first chunk go over the handout and summarize the most important concepts,
- at the beginning of the second chunk go over the notions in the handout and give a small task for each important concept,
- solve each together, in the process referring to the memorable problems from the first bullet.
The problem with this plan is that it feels clumsy and will probably take more than 0.5h I can spare. Perhaps I could try interweaving the summary and the material of the second day, but that is hard and I'm afraid they might get lost.
What would you suggest?
This will be a part of lectures on computer science (think algorithmic contests), and the topic is associative operators. It is about why and how to represent partial problem/solution information in a way that can be combined by associative operators. A simple example is exponentiation by squaring. That can be combined with matrices to calculate Fibonacci numbers with logarithmic number of operations.
In fact this topic is not preset, but the intersection of what fits and what I can prepare on short notice is small, which means any other will be much worse.