Professor Teresa Carrigan's Virtual Office
Welcome to my virtual office. Help yourself to any of the following tutorials, and please let me know of any bugs you find.
Course Link Description Cs 251 Test #3 Online sections of the take-home test Hw #9 Second Chance Online sections of the Null Chapter 5 assignment Hw #10 Second Chance Online sections of the Null Chapter 6 assignment Summary List All current Java tutorials NetLogo animations, ready for release Simple Stack Machine Simple Stack Machine Simulator Generic Stack Assembly Language Generic 0-address machine simulator; demonstrates fetch-execute cycle and operation of stack. Binary Counter Counts in binary, and gives decimal equivalents using unsigned, signed, one's complement, and two's complement format. 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. Addition in Other Bases Demonstrates how to add two numbers in any base from 2 to 16. Counting in Other Number Bases Counts in any base from 2 to 16, and gives the decimal equivalent using unsigned format. Binary, Octal, Hexadecimal Demonstrates conversion between any two of the following number bases: two, four, eight, sixteen. Fraction - Place Value Demonstrates the place value method of converting a positive real number in another base to decimal. Horner's Method Demonstrates Horner's method of converting from another base to decimal. Successive Division Demonstrates the successive division method of converting a positive integer from decimal to another base. Also known as the division-remainder method. Successive Multiplication Demonstrates conversion of a decimal fraction to another base, using the successive multiplication method. 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. Two's Complement Subtraction Demonstrates subtraction of numbers stored in two's complement format. IEEE 754 Single Precision Demonstrates how the 32-bit IEEE 754 Single Precision representation of a floating point number is interpreted. Scientific Notation in Any Base Demonstrates scientific notation in any base from two to sixteen. Transmission Encodings Demonstrates various transmission encoding schemes. Binary Multiplication Demonstrates multiplication of binary unsigned integers. 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. Packed BCD Demonstrates Packed Binary Coded Decimal character coding. Number of Bit Patterns How many different bit patterns can be made with a fixed number of bits? 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. 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. Hamming Distance Demonstates finding the Hamming Distance of sets of bit patterns. 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).
Applets on this website were written by Teresa Carrigan in 2004, for use in computer science courses at Blackburn College, with the exception of the Fireworks applet. The applets made with NetLogo require Java 1.4.1 or higher to run. The applets made with NetBeans require Java 1.4.2 or higher to run. 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.