# Computer Science 324 Computer Architecture

### Mount Holyoke College Fall 2007

Lecture 01: Introduction and Overview; Review of Bits and Numbers
Date: Friday, September 7, 2007

#### Agenda

• Welcome!
• Why take this class?
• Bits and Numbers
• Lecture assignment
• The readings for next time are P&H Chapter 1 and my notes on Bits and Numbers

#### Examples

Class examples will be listed in this section of each lecture's notes, and can be found in /home/jteresco/shared/cs324/examples on the CSLab Linux systems.

• late - late penalty calculator Graph of the output:

• show_bytes - examine endianness

#### Lecture Assignment

Due at the start of class, Monday, September 10.

Turn in short answers to these questions. Please turn in a hard copy (typeset or handwritten are OK). We will discuss these problems during class, so no late submissions are accepted.

1. Today's class mentioned 5 major levels of abstraction. Briefly describe your level of knowledge of each level. For example, if you have done some assembly language programming, indicate the assembly language you used and how much programming you did in that language.
2. Represent each of the following quantities using each of the following 8 bit representations, where possible: unsigned, signed magnitude, 1's complement, 2's complement. Values are given in base 10, and characters are ASCII. Express each as both an 8-bit binary number and a 2-digit hexadecimal number.
For example, to represent the value -17, the unsigned representation is not possible, the signed magnitude representation is 100100012 or 9116, the 1's complement representation is 111011102 or EE16 and the 2's complement representation is 111011112 or EF16.
• 0
• 11
• -42
• 42
• -127
• 127
• -128
• 128
• 255
• the character '6' (see man ascii)