# 1) How does Boolean algebra capture the essential properties of logic operations and set operations?

1) How does Boolean algebra capture the essential properties of logic operations and set operations?

2) How does the reduction of Boolean expressions to simpler forms resemble the traversal of a tree, from the Week Four material? What sort of Boolean expression would you end up with at the root of the tree?

3) Conjunctive and disjunctive normal forms provide a form

of balanced expression. How might this be important in terms of the efficiency of computational evaluation?

### Sponsored

### Recently Posted

#### Statistics – Binomial Probabilities

Assuming that X is a binomial random variable w...#### Die, Card and Cash in Hand Game Probabilities

One fair die is rolled. What is the probability...#### Probability questions

(A roulette wheel has 38 numbers: 18 red, 18 bl...

### Categories

- Anatomy
- Art
- Biology
- Business
- Chemistry
- Communications
- Criminal Justice
- Economics
- Education
- English
- Finance
- Gender Studies
- General
- General Questions
- Geography
- Geology
- Health Care
- History
- Languages
- Law
- Maths
- Philosophy
- Political Science
- Politics
- Psychology
- Religion
- Religious Studies
- Sociology
- Uncategorized