• Home
  • KS 3
    • Modelling projects
    • Learn Python 3
    • Learn Scratch
    • Algorithms
    • Boolean logic
    • Binary representation
    • Hardware components
    • Software components
    • Communications
    • Data representation
    • KS3 Flipwall
    • Creative projects
    • Digital projects
    • Online safety
  • KS 4
    • OCR J277 (from Sep 2020)
    • AQA 8525 (from Sep 2020)
    • NEA resources
    • Legacy GCSE resources
    • GCSE Revision Cards
    • Flipwall
    • Slider puzzle and freebies
  • KS 5
    • OCR AS Comp Science
    • OCR A Level Comp Science
    • Eduqas AS Comp Science
    • Eduqas A Level Comp Science
    • WJEC AS & A Level Comp Science
    • CIE Comp Science
    • Normalisation
    • Binary floating point numbers
    • A Level Flipwall
    • All pre-September 2015 KS5 resources
    • Samples
  • A Level text book
    • Contents, index etc
    • Chapters 1 - 5
    • Chapters 6 - 10
    • Chapters 11 - 15
    • Chapters 16 - 20
    • Chapters 21 - 25
    • Chapters 26 - 30
    • Chapters 31 - 35
    • Chapters 36 - 40
    • Chapters 41 - 45
    • Chapters 46 - 50
    • Chapters 51 - 55
    • Chapters 56 - 60
    • Chapters 61 - 68
  • Python 3
    • Python videos - 1
    • Python videos - 2
    • Python fundamentals
    • Strings
    • Selection - IF
    • Repetition - WHILE
    • Repetition - FOR
    • Formatting data
    • Date and time
    • Lists
    • Tuples
    • Dictionaries
    • Functions
    • Random values
    • File operations
    • Errors and bugs
    • OO programming
    • Practical tasks
    • Data structures
    • Quick reference notes
    • Python Flipwall
  • Computational thinking
  • Freebies
    • Bloom's Taxonomy
    • Freebies Flipwall
    • Find the pairs
    • Slider puzzles
  • Teachers
    • Access to answers

zzz3.jpg

List of articles in category 1.4.3 Boolean Algebra
Title
An introduction to Boolean logic
The twelve basic equivalences in Boolean logic
The commutative, associative and distributive Boolean laws
De Morgan's laws and a printout of all Boolean algebra laws
Simplifying statements in Boolean algebra using De Morgan's laws
Deriving Boolean expressions from truth tables
Deriving Boolean expressions from logic gate diagrams
Manipulating and simplifying statements in Boolean algebra
Bitwise manipulation and masks (AND OR XOR)
Logical operations and encryption
Manipulating Boolean using Karnaugh maps
Logic gate diagrams and truth tables
Half adders
Full adders
An application of full adders
D type flip flops

OCR A Level Computer Science 2015

  • Computing principles (01)
    • 1.1 Processors and components
    • 1.2 Software & development
    • 1.3 Exchanging data
    • 1.4 Data types, structures and algorithms
      • 1.4.1 Data types
      • 1.4.2 Data structures
      • 1.4.3 Boolean Algebra
    • 1.5 Legal, moral, ethical and cultural issues
  • Algorithms and problem solving (02)
  • Computing project (03)

Search


Copyright @ 2022 theteacher.info Ltd. All rights reserved.