One educational activity is serving as a member and now as chair of the development committee for the Advanced Placement exam in Computer Science. I helped with the change or the exam language from C++ to Java and in the development of a new Case Study. I helped write a number of AP exams and also made two presentations at SIGCSE and one at an AP Annual Meeting on the change of the exam language from C++ to Java.
A second activity was serving as Principal Lecturer for the DIMACS Reconnect Program (Reconnecting Teaching Faculty to the Mathematical Sciences Research Program), August 11-17, 2002. I gave a week-long series of lectures on the use of Voronoi diagrams and Delaunay triangulations in surface reconstruction algorithms, particularly the Crust algorithm (and its variants) and Co-cone algorithm.
I have also written articles about using examples from Computational Geometry in undergraduate algorithms courses and the place of mathematics in the Computer Science curriculum.
Finally, I have co-authored a Discrete Mathematics textbook that is designed for Computer Science students who have already taken the introductory course and are taking or have taken Data Structures. Most discrete mathematics textbooks do not assume such a background, so are left with a choice: use no CS examples (and thus risk appearing irrelevant to CS students) or teach the computer science needed to understand the CS examples (which is time-consuming and is often attempted by mathematicians who may not know Computer Science). Our book is able to use hashing to motivate the study of probability, recursive sorting and searching algorithms to motivate the study of recurrence relations and their solution, binary search trees to motivate the study of graphs and trees and as an area in which to practice inductive proofs, etc.