CSE370 Assignment 1
Distributed: 29 March 1999
Due: 2 April 1999
Reading:

Katz, Chapter 1 (pp. 135, for an alternative to the introduction to the
material of the course).

Katz, Appendix A (pp. 650661, this should be review).

Katz, Chapter 5.1 (pp. 241248, this should also be review).
Exercises:

Familiarize yourself with the CSE 370 web pages. The written assignments
(such as this one) account for what percentage of the final grade? What
question would you like to see on the course evaluation that is currently
not on the list?

Make sure you have an NT account and can login to the machines in the instructional
labs. Add yourself to the class mailing list using majordomo. Become familiar
with the NT computing environment if you are not already.

Convert the following numbers to decimal:
(a) 110011_{2}
(b) 63_{8}
(c) 33_{16}
(d) 1100010.101_{2}

Convert the following numbers to base 2:
(a) 212_{10}
(b) 37_{8}
(c) 17.4375_{10}
(d) D2C3_{16}

Perform the following operations (without converting to base 10):
(a) 32_{8} + 16_{8}
(b) 0011_{2} + 1001_{2} + 0110_{2}
(c) 10101_{2}  01010_{2}
(d) 111001_{2}  001110_{2}

Represent the following numbers in the indicated notation:
(a) 15 in 6bit signed magnitude (1 sign bit and 5 bits for the magnitude)
(b) 15 in 6bit 2s complement
(c) what are the smallest and largest numbers you can represent in
8bit 2s complement notation
(d) represent the 4bit 2s complement number 1001 as an 8bit 2s complement
number

If a 4bit 2s complement number is written as X_{4}X_{3}X_{2}X_{1}
then determine the Boolean expression for 6_{10}.

Draw a logic circuit corresponding to the expression: Z = (A · B')
+ (C · D').
Rationale:

To review number systems.

To gain familiarity with some of the basic concepts in digital logic.
Comments to: cse370webmaster@cs.washington.edu
(Last Update: 03/29/99)