Skip to main content
ICT
A14 - Boolean Algebra and Loop Boundaries
 
Main   Previous Next
 

A14 Introduction page 1 of 7

Conditional loops often prove to be one of the most difficult control structures to work with. This lesson will give you more strategies that can be used for defining the beginning and ending conditions for loops in your programs.

The key topics for this lesson are:

  1. Negations of Boolean Assertions
  2. Boolean Algebra and DeMorgan’s Laws
  3. Application of DeMorgan’s Laws
Main   Previous Next
Contact
 © ICT 2006, All Rights Reserved.