I' ' l ;i nges I Placement Calculations David Ginat Computer Science Group Science Education Department TeI-Aviv University TeI-Aviv 69978 Israel Editor's; Note "ColorfulChallenges"is a new eohmmfor inroads. The authorwelcomessuggestions fromyou. olorful challenges are valuable resources that can be utilized to motivate, illustrate, and internalize concepts and techniques. Their attractive forms often raise enthusiasm, enhance demonstration, and facilitate the memorization of tutored material. One relevant domain of colorful challenges is algorithmics. Colorful algorithmic challenges can serve as attractive means for various perspectives of algorithm design and analysis. They include: ¢ Demonstration of algorithm design techniques; ¢ Illustration of problem-solving heuristics; ¢ Examination of varying approaches; ¢ Evaluation of alternative solutions; ¢ Discussion of common errors. The objective of this new column is to introduce colorful challenges, many of them algorithmic, that illuminate different perspectives of problem solving in computer science. The challenges, their solutions, and the perspectives they encapsulate can be useful resources for CS1, CS2, data structures, and an introduction to algorithms courses. Every column issue will include the introduction of one or two novel challenges, recommended for tackling by the interested reader. Readers are welcome to send the author their proposed solutions. Selected solutions will be
/lp/association-for-computing-machinery/placement-calculations-kSAvzobUe5