Options Home | Pre-KK | 15 | 68 | 912 | Possible Lesson Plans | ||||||
Below are a few (in some cases shorted or paraphrased) examples of elementary-level algorithmics problems proposed in the Michael Fellows paper, which explored the possibility of teaching algorithms to elementary and middle school students. The importance of the algorithmic component of the early computer science education curriculum is not to find the right answers to every question or to rediscover algorithms taught in the corresponding undergraduate course, but rather to be actively engaged in trying to solve non-trivial computer science problems. The goal is to have students figure out the main components of optimal/correct algorithms and defend them intelligently. It is possible to have the students collaborate especially challenging problems, thus bringing an additional component of team development to the lesson plan. Additionally, these "algorithmic lab" activities do not require computer resources, and thus could be used as an alternate activity for students who do not have access to computers.
Professor Fellows also suggests other engaging topics in computer science that can be examined away from the keyboard. These include sorting algorithms, logical and mathematic puzzles, planning the route of the traveling salesman, and devising one-way street assignments. |
||||||
Early
Acquisition of Computer Science ·
©2008 Justin Solomon and Peter Rusev
|
||||||