Learning objective
Problem-solving: Be able to develop solutions to simple logic problems. Be able to check solutions to simple logic problems.
Read the explanation, check the common trap, then practise with flashcards and questions.
At a glance
0
Flashcards
0
Questions
Topic
Abstraction and automation
Subtopic
Problem-solving
Study support
Understand this objective
Quick explanation
Problem-solving: Be able to develop solutions to simple logic problems. Be able to check solutions to simple logic problems
- This point belongs to Abstraction and automation, especially Problem-solving.
- You need to be able to problem-solving: Be able to develop solutions to simple logic problems. Be able to check solutions to simple logic problems.
- Use the linked flashcards and practice questions to check recall, then practise applying the idea in an exam-style answer.
Why it matters
This objective helps connect Problem-solving to exam-style questions, flashcards, and revision notes for Abstraction and automation.
Quick student answer
A = true, B = false and C = true. What is the value of (A AND NOT B) OR C?
Direct answer
true
Key terms
- Boolean expression: An expression made from Boolean values, Boolean operators and possibly variables that evaluates to true or false.
- Truth table: A table showing every possible combination of Boolean inputs and the resulting output for a logic expression.
Common trap
Testing too few cases: For a small problem, list every possible input combination and compare the actual result with the expected result for each one.
Related questions
Try this as a practice card
Question 1 of 4
Choose an answer, get feedback, then move sideways through the set.
Flashcard prompts
Flip through the key recall cards
Flashcard 1 of 4
Revision tools
Choose how to practise
Flashcards0 linked cards
Practice Questions0 linked questions
Related learning objectives
- Following and writing algorithms: Understand the term algorithm. A sequence of steps that can be followed to complete a task and that always terminates. Be able to express the solution to a simple problem as an algorithm using pseudo-code, with the standard constructs: • sequence • assignment • selection • iteration. Be able to hand-trace algorithms. Be able to convert an algorithm from pseudo- code into high level language program code. 54 Be able to articulate how a program works, arguing for its correctness and its efficiency using logical reasoning, test data and user feedback.
Following and writing algorithms
- Abstraction: Be familiar with the concept of abstraction as used in computations and know that: • representational abstraction is a representation arrived at by removing unnecessary details • abstraction by generalisation or categorisation is a grouping by common characteristics to arrive at a hierarchical relationship of the 'is a kind of' type.
Abstraction
- Information hiding: Be familiar with the process of hiding all details of an object that do not contribute to its essential characteristics.
Information hiding
- Procedural abstraction: Know that procedural abstraction represents a computational method. The result of abstracting away the actual values used in any particular computation is a computational pattern or computational method - a procedure.
Procedural abstraction
- Functional abstraction: Know that for functional abstraction the particular computation method is hidden. The result of a procedural abstraction is a procedure, not a function. To get a function requires yet another abstraction, which disregards the particular computation method. This is functional abstraction.
Functional abstraction