## Description

**Precedence**

- NOT has precedence over AND
- AND has precedence over OR
- When computing an expression
- Parentheses
- Compute NOTs
- Compute ANDs
- Compute ORs

**Example**

** **

- Given Boolean function
**F = x + y’z**- Transform from an algebraic expression into a logic diagram

x

y F

z

- Create the truth table for each computational step based on precedence

x |
Y |
z |
y’ |
y’z |
x + y’z (F) |

0 | 0 | 0 | 1 | 0 | 0 |

0 | 0 | 1 | 1 | 1 | 1 |

0 | 1 | 0 | 0 | 0 | 0 |

0 | 1 | 1 | 0 | 0 | 0 |

1 | 0 | 0 | 1 | 0 | 1 |

1 | 0 | 1 | 1 | 1 | 1 |

1 | 1 | 0 | 0 | 0 | 1 |

1 | 1 | 1 | 0 | 0 | 1 |

**Assignment**

- Given Boolean function
**F1 = xyz’**- Transform from an algebraic expression into a logic diagram
- Create the truth table for each computational step based on precedence

- Given Boolean function
**F2 = xy’ + z**- Transform from an algebraic expression into a logic diagram
- Create the truth table for each computational step based on precedence

- Given Boolean function
**F3 = xy’ + x’z**- Transform from an algebraic expression into a logic diagram
- Create the truth table for each computational step based on precedence

- Given Boolean function
**F4 = x’y’z + x’yz + xy’**- Transform from an algebraic expression into a logic diagram
- Create the truth table for each computational step based on precedence