|
Computer Science 2500 Computer Organization Rensselaer Polytechnic Institute Spring 2009
|
|
Lecture 01: Introduction and Overview; Bits and Numbers
Date: January 13, 2009
- Welcome!
- Why take this class?
- Syllabus and administrative details
- CS Lab accounts
- Bits and Numbers
- Lecture assignment
Class examples will be listed in this section of each lecture's notes,
and can be found in /cs/terescoj/shared/cs2500/examples on the
CSLab systems.
- late - late penalty calculator
Graph of the output:
- show_bytes - examine endianness
Please read P&H Chapter 1. It contains a lot of background
information, much of which we will not cover during class but which is
interesting, useful, and relevant.
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.
Due at the start of class, Friday, January 16.
- 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.
- 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)