Classroom Resources Index – Computer Science (upper division)

Classroom-Ready Resources and Teaching Suggestions

Return to master index.

Primary Historical Sources in the Classroom: Discrete Mathematics and Computer Science
A collection of projects designed to help students learn concepts in discrete mathematics, combinatorics, linear algebra, and computer science by studying primary historical sources, with an overview of the benefits of this approach to teaching and learning. Includes the following specific projects suitable for use in courses on computer science:

• Applications of Boolean Algebra: Claude Shannon and Circuit Design, by Janet Heine Barnett
• Discovery of Huffman Codes, by Inna Pivkina
• Euclid's Algorithm for the Greatest Common Divisor, by Jerry Lodder, David Pengelley, and Desh Ranjan
• Program Correctness, by Hing Leung
• Regular Languages and Finite Automata, by Hing Leung
• Striving for Efficiency in Algorithms: Sorting, by Inna Pivkina