# Spring 2002 CSCI 255 Practice Homework 3

This homework is not graded. It is practice for the 25 February quiz.

## Problem 1

Draw a circuit that implements the truth table shown below.
The "inputs" to the truth table are A, B, and C.
The output is Z.
Again, review section 3.3.4 before attempting this problem.

input | output |

A | B | C | Z |

0 | 0 | 0 | 1 |

0 | 0 | 1 | 0 |

0 | 1 | 0 | 1 |

0 | 1 | 1 | 0 |

1 | 0 | 0 | 0 |

1 | 0 | 1 | 1 |

1 | 1 | 0 | 0 |

1 | 1 | 1 | 1 |

## Problem 2

Assume `x` is a C integer variable.
Describe how you would set bits 1, 4, and 7 of `x` to 1
and clear bits 2, 5, and 13 to 0.
You can do this in one statement.

## Problem 3

Implement the following Boolean function using only NAND gates
and inverters:

- f(
`x`, `y`, `z`) =
`x` `z` + `x` `y`' `z`'