Booleans 2

CS1 / Java

Abstract

In this activity students will gain experience simplifying boolean expressions. This activity consists of two models and is meant to be used after the Booleans POGIL. POGIL resources for De Morgan’s law are rare or non-existent, so many students may encounter this material via lecture. This activity is intended to provide students and teachers more options - another route to learning this material. By the end of the activity students should be prepared to simplify compound boolean expressions involving negation.

This activity was developed with NSF support through IUSE-1626765. You may request access to this activity via the following link: IntroCS-POGIL Activity Writing Program. 

• Level: Undergraduate
• Setting: Classroom
• Activity Type: Learning Cycle
• Discipline: Computer Science
• Course: Introductory CS
• Keywords: boolean, logical equivalence, not operator, truth tables, DeMorgan's law