Logical rules

From Computer Science Wiki
Revision as of 15:01, 18 July 2017 by Mr. MacKenty (talk | contribs)
Deduce logical rule[1]

We decompose a real-world situation and look for logical rules which may govern a situation. The main idea here is to break the situation into smaller parts and then look for logical rules which we can model with a computer. This topic is very closely related to abstraction and you very much need to understand boolean operators

In the context of a high school introduction to computer science course, a logical rule is a rule which has at least one of the following:

  • IF
  • AND
  • OR
  • NOT
  • NAND
  • NOR
  • XOR

When deducing logical rules, you should simplify

Logical reasoning determines if algorithms will work by predicting what happens when the algorithm’s steps - and the rules they consist of - are followed[2].

Do you understand this?[edit]

Standards[edit]

These standards are used from the IB Computer Science Subject Guide[3]

  • Deduce logical rules for real-world situations.

References[edit]

  1. http://www.flaticon.com/
  2. http://www.bbc.co.uk/education/guides/z8jfyrd/revision
  3. IB Diploma Programme Computer science guide (first examinations 2014). Cardiff, Wales, United Kingdom: International Baccalaureate Organization. January 2012.