Null & Lobur - Chapter 2

The Essentials of Computer Organization and Architecture
Null and Lobur

Chapter 2 - Data Representation in Computer Systems

Section 2.2 Number of Bit Patterns How many different bit patterns can be made with a fixed number of bits?

Binary Counter Counts in binary, and gives decimal equivalents using unsigned, signed, one's complement, and two's complement format.

Counting in Other Bases Demonstrates counting positive integers in any base from two to sixteen; also gives the decimal equivalent of each number as it counts.

Place Value Method Demonstrates the Place Value method of converting from another base to decimal.

Smallest Legal Base Demonstrates how to determine the smallest legal base for a random digit pattern.

Section 2.3 Successive Division Demonstrates the successive division method of converting a positive integer from decimal to another base. Also known as the division-remainder method.

Fraction - Place Value Demonstrates the place value method of converting a positive real number in another base to decimal.

Successive Multiplication Demonstrates conversion of a decimal fraction to another base, using the successive multiplication method.

Section 2.4 Binary Counter Counts in binary, and gives decimal equivalents using unsigned, signed, one's complement, and two's complement format.

Addition in Other Bases Demonstrates how to add two numbers in any base from 2 to 16.

Signed Integer Representation Demonstrates how a signed decimal integer would be stored in any of three binary formats: signed magnitude, one's complement, two's complement.

Binary, Octal, Hexadecimal Demonstrates conversion between any two of the following number bases: two, four, eight, sixteen.

Horner's Method Demonstrates Horner's method of converting from another base to decimal.

Two's Complement Subtraction Demonstrates subtraction of numbers stored in two's complement format.

Binary Multiplication Demonstrates multiplication of binary unsigned integers.

Section 2.5 Scientific Notation in Any Base Demonstrates scientific notation in any base from two to sixteen.

IEEE 754 Single Precision Demonstrates how the 32-bit IEEE 754 Single Precision representation of a floating point number is interpreted.

Section 2.6 Packed BCD Demonstrates Packed Binary Coded Decimal character coding.

Parity Demonstates storing of bit patterns using either even or odd parity.

Parity Error Detection Demonstates detection of parity errors, with either even or odd parity.

Section 2.7 Cyclic Redundancy Check Demonstrates storing of bit patterns using Cyclic Redundancy Check (CRC).

Cyclic Redundancy Check Error Demonstates detection of errors using Cyclic Redundancy Check (CRC).

Hamming Distance Demonstates finding the Hamming Distance of sets of bit patterns.

Hamming Code Demonstates storing of bit patterns using Hamming SEC, even parity, with up to eight data bits.

Hamming Error Detection and Correction Demonstates detection and correction of single bit errors, using Hamming SEC (even) with eight data bits.

Section 2A Transmission Encodings Demonstrates various transmission encoding schemes.

Run-Length-Limited Encoding Demonstrates the Run-Length-Limited (RLL) encoding scheme for storing data on high-capacity disk drives.

4B/5B Encoding Demonstrates the 4B/5B encoding scheme, used in 100Mbps Fast Ethernet.

Run-Length-Limited Encoding Demonstrates the Run-Length-Limited (RLL) encoding scheme for storing data on high-capacity disk drives.

4B/5B Encoding Demonstrates the 4B/5B encoding scheme, used in 100Mbps Fast Ethernet.

Self Quiz Chapter 2 Self Quiz Quizzes Smallest Legal Base, Place Value, and Successive Division.

Beta Test Quiz Chapter 2 Self Quiz (Beta) Quizzes many of the Chapter 2 concepts. Units were written by various students. Still under development; use at own risk.

Applets might not run on Windows 95 or Mac OS 8 or 9. You may obtain the latest Java plugin from Sun's Java site.

Tools used to create this website and the applets on it include NetBeans, NetLogo, and Arachnophilia.

Section 2.2	Number of Bit Patterns	How many different bit patterns can be made with a fixed number of bits?
	Binary Counter	Counts in binary, and gives decimal equivalents using unsigned, signed, one's complement, and two's complement format.
	Counting in Other Bases	Demonstrates counting positive integers in any base from two to sixteen; also gives the decimal equivalent of each number as it counts.
	Place Value Method	Demonstrates the Place Value method of converting from another base to decimal.
	Smallest Legal Base	Demonstrates how to determine the smallest legal base for a random digit pattern.
Section 2.3	Successive Division	Demonstrates the successive division method of converting a positive integer from decimal to another base. Also known as the division-remainder method.
	Fraction - Place Value	Demonstrates the place value method of converting a positive real number in another base to decimal.
	Successive Multiplication	Demonstrates conversion of a decimal fraction to another base, using the successive multiplication method.
Section 2.4	Binary Counter	Counts in binary, and gives decimal equivalents using unsigned, signed, one's complement, and two's complement format.
	Addition in Other Bases	Demonstrates how to add two numbers in any base from 2 to 16.
	Signed Integer Representation	Demonstrates how a signed decimal integer would be stored in any of three binary formats: signed magnitude, one's complement, two's complement.
	Binary, Octal, Hexadecimal	Demonstrates conversion between any two of the following number bases: two, four, eight, sixteen.
	Horner's Method	Demonstrates Horner's method of converting from another base to decimal.
	Two's Complement Subtraction	Demonstrates subtraction of numbers stored in two's complement format.
	Binary Multiplication	Demonstrates multiplication of binary unsigned integers.
Section 2.5	Scientific Notation in Any Base	Demonstrates scientific notation in any base from two to sixteen.
	IEEE 754 Single Precision	Demonstrates how the 32-bit IEEE 754 Single Precision representation of a floating point number is interpreted.
Section 2.6	Packed BCD	Demonstrates Packed Binary Coded Decimal character coding.
	Parity	Demonstates storing of bit patterns using either even or odd parity.
	Parity Error Detection	Demonstates detection of parity errors, with either even or odd parity.
Section 2.7	Cyclic Redundancy Check	Demonstrates storing of bit patterns using Cyclic Redundancy Check (CRC).
	Cyclic Redundancy Check Error	Demonstates detection of errors using Cyclic Redundancy Check (CRC).
	Hamming Distance	Demonstates finding the Hamming Distance of sets of bit patterns.
	Hamming Code	Demonstates storing of bit patterns using Hamming SEC, even parity, with up to eight data bits.
	Hamming Error Detection and Correction	Demonstates detection and correction of single bit errors, using Hamming SEC (even) with eight data bits.
Section 2A	Transmission Encodings	Demonstrates various transmission encoding schemes.
	Run-Length-Limited Encoding	Demonstrates the Run-Length-Limited (RLL) encoding scheme for storing data on high-capacity disk drives.
	4B/5B Encoding	Demonstrates the 4B/5B encoding scheme, used in 100Mbps Fast Ethernet.
	Run-Length-Limited Encoding	Demonstrates the Run-Length-Limited (RLL) encoding scheme for storing data on high-capacity disk drives.
	4B/5B Encoding	Demonstrates the 4B/5B encoding scheme, used in 100Mbps Fast Ethernet.
Self Quiz	Chapter 2 Self Quiz	Quizzes Smallest Legal Base, Place Value, and Successive Division.
Beta Test Quiz	Chapter 2 Self Quiz (Beta)	Quizzes many of the Chapter 2 concepts. Units were written by various students. Still under development; use at own risk.

The Essentials of Computer Organization and Architecture Null and Lobur

Null and Lobur

Chapter 2 - Data Representation in Computer Systems

The Essentials of Computer Organization and Architecture
Null and Lobur