# Assignment 1 for CSCI 255 / ECE 109

## Due date

This assignment must be submitted as a single file for Assignment 1 of the CSCI 255/ECE 109 section on UNCA moodle by 5:00 PM on Friday, 13 February.

This handout gives a general description of the problems you are to solve. The actual problems are given on the Assignment 1 Problem Form. Download the form (which is a simple text file) and fill in the correct answers. Submit the completed form as either an ASCII text file, a PDF file, or a DOC file (MS Word 2003 format).

## Problem 1 -- Hexadecimal operations

It is possible to add, AND, and OR in hex. Perform the add, AND, and OR operations given in the fill-in form in hex. You could translate the operatands into binary, do the operations in binary, and then translate the results back into hexadecimal, but try them out in hex. It's a skill that could come in handy.

## Problem 2 -- de Morgan's rule

de Morgan's rule makes it possible to simplify Boolean logic expression by moving NOT's (~'s) from the outside to the inside of an expression as shown in the following series of simplifications.

• ~(X + ~Y Z) + ~(X ~Z)
• (~X ~(~Y Z)) + ~X + ~~Z
• (~X (~~Y + ~Z)) + ~X + Z
• ~X (Y + ~Z) + ~X + Z

Notice that in the result, the ~ operator is only applied to simple variables. Perform this simplification to three Boolean expressions on the fill-in form.

## Problem 3

Write Boolean equations for the two three-input truth tables given on the fill-in form.