Skip to Main Content
Computational Thinking for the Modern Problem Solver
book

Computational Thinking for the Modern Problem Solver

by David Riley, Kenny A. Hunt
March 2014
Beginner to intermediate content levelBeginner to intermediate
405 pages
12h 16m
English
Chapman and Hall/CRC
Content preview from Computational Thinking for the Modern Problem Solver
72   ◾     Computational Thinking for the Modern Problem Solver
if something is not False then it must be True. e truth table for logical
negation is shown in Figure3.7.
3.2.2.6 Compound Propositions
When we evaluate a proposition, the goal is to determine the truth value
of the proposition. If the proposition involves only a single operator, we
can simply look up one row of a truth table to obtain the answer. Consider
evaluating the proposition
P or Q
for the situation when P = False and Q = True. We can evaluate the value
of “P or Q” by scanning through the disjunctions truth table, nding the
line that corresponds to P = False and Q = Tr
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

From Computing to Computational Thinking

From Computing to Computational Thinking

Paul S. Wang

Publisher Resources

ISBN: 9781466587793