levo

Boolean Logic and Simplification

Logical operators in programs, masking and encryption

  • 3 things to know
  • Component 1

Overview

Bit mask and how XOR provides a simple form of encryption.

What you need to know

Answer each one before you reveal it.

Your recallNot started
Key term

How is AND used in a program condition?

Key term

How is OR used in a program condition?

Key term

How is NOT used in a program condition?

Questions from this subtopic

Each one with the model answer underneath.

  1. 1

    How is AND used in a program condition?

    Model answer

    An AND condition is true only when every part of it is true. A test such as age ≥ 18 AND ukResident succeeds only when both hold.

  2. 2

    How is OR used in a program condition?

    Model answer

    An OR condition is true when at least one part of it is true. A test such as day = Saturday OR day = Sunday succeeds on either day.

  3. 3

    How is NOT used in a program condition?

    Model answer

    A NOT reverses the truth of the condition that follows it. A loop written WHILE NOT finished keeps running until finished becomes true.

  4. 4

    Give a use of XOR inside a program.

    Model answer

    XOR tests whether exactly one of two conditions holds. XOR also flips selected bits and provides simple encryption.

  5. 5

    What is a bit mask?

    Model answer

    A bit mask is a binary pattern combined with data in order to act on chosen bits. The operator used decides whether those bits are cleared, set or inverted.

  6. 6

    Which logical operation clears selected bits of a byte?

    Model answer

    An AND with 0 in the mask clears those bit positions to 0. Positions holding 1 in the mask keep their original values.

Other ways to work this

The same content, four other ways.

What is inside Levo

Six ways to work the same material.

1Closed book
2Open book
3Closed book

The 3-step method, run for you

Answer cold, learn it, then prove it stuck. Levo tracks the jump between your first attempt and your last.

Data Structures: Arrays, Records and Hash Tables
Stacks, Queues, Linked Lists and Trees
Boolean Logic and Simplification
Algorithms, Pseudo-Code and Programming Constructs

Cram a whole paper in one sitting

Sort every topic into what you know and what you do not, then drill only the weak ones.

KDW to HAT.
decryptsencryptscompresses

Blank Blitz makes facts automatic

Rapid timed gap-fills on the terms and numbers you need to recall without thinking.

AThe two are not the same.
BOpen source refers to the availability of the code.
CMuch open source software is free of charge.

Build It gets the exam shape right

Assemble a full-mark answer from its marking points, in the order an examiner wants them.

Backup means the copy of the data.
TrueFalse

Test It catches misconceptions

Spot the fault in a statement. The traps are the mistakes students actually make.

721941163128510

Brain Breaks between sessions

Short focus games to reset attention, so the next set lands better than the last.

Every question in Boolean Logic and Simplification, on a schedule.

Attempt a question from memory, write the correct version, then attempt it again. Levo records the jump between your first attempt and your last, and brings each question back on the day you are due to forget it.

Or £46 a year, about £3.83 a month. Cancel anytime.