Dale - Computer Science Illuminated 260

# Dale - Computer Science Illuminated 260 - 8.3 Functionality...

This preview shows page 1. Sign up to view the full content.

Boolean expression A sequence of identifiers, separated by compatible operators, that evaluates to true or false Variable A location in memory, referenced by an identifier, that contains a data value 8.3 Functionality of Imperative Languages 233 What is a Boolean expression ? In Chapter 4, we introduced the concept of Boolean operations when we discussed gates and circuits. Here we are using them at the logical level rather than the hardware level. A Boolean expression is a sequence of identifiers, separated by compatible operators, that evaluates to true or false . A Boolean expression can be ± a Boolean variable. ± an arithmetic expression followed by a relational operator followed by an arithmetic expression. ± a Boolean expression followed by a Boolean operator followed by a Boolean expression. Yes, but what is a Boolean variable? In fact, what is a variable? In the algo- rithms we have written, we have used identifiers to name places that repre- sent values in the algorithm. For example,
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 01/13/2011 for the course CSE 1550 taught by Professor Marianakant during the Fall '10 term at York University.

Ask a homework question - tutors are online