Computational Thinking L1

Objectives

• Ask logical questions to solve problems.

• Understand common Boolean operators: AND, OR, NOT.

• Represent Boolean operators in written expressions and Venn diagrams.

Computational Thinking

• Definition: How computer scientists approach problem-solving.

• Techniques include:

  • Logical thinking

  • Algorithmic thinking

  • Decomposition

  • Abstraction

Asking Questions

• Effective questioning can halve the suspect pool with each question.

• Example:

  • If suspect is a man, reduces group substantially.

• Maximum group size identified with 10 questions is 1024 (2^10).

Boolean Expressions

• Logical representation of conditions using Boolean operators.

• Example for suspect:

  • NOT hasGlasses AND hasFacialHair AND hasDarkBrownHair AND hasGreenEyes

Logical Deduction

• Process of determining the truth of statements.

• Example deductions:

  • Unicorns are immortal AND awesome. I am awesome. I am NOT immortal. Conclusion: I am NOT a unicorn.

  • Identify characteristics (e.g., a penguin) by checking multiple conditions.

Venn Diagrams

• Visual representation of Boolean expressions.

• Examples:

  • Cats OR Dogs

  • Cats AND Dogs

  • NOT Dogs

Logical Puzzles

• Practice logical reasoning skills through puzzles:

  • Determine youngest, oldest, and middle among given statements about individuals.

  • Solve riddles with false statements to deduce correct choices.

Common Boolean Operators

• The three operators:

  • AND

  • OR

  • NOT

Plenary Examples

• Deduction example: Jack is a person; therefore, Jack needs oxygen to live.

• Analyze Venn diagrams (e.g., Tea OR Coffee).