This paper outlines a series of exercises that relate propositional logic to various straightforward query languages as used by some popular programs. It also provides exercises which naturally motivate the use of boolean algebra to translate between equivalent formulas (including a practical application of converting a formula to conjunctive normal form). These exercises also illustrate connections between topics student see in logic/discrete math, programming topics, and topics in design.
Click here to download this paper.
No comments:
Post a Comment