Tangible Computing
26. Revision Log
Version 3.20, 2013-03-25
}
Fixed typo in O(n) containment examples in sorting section.
Version 3.19, 2013-03-13
}
Added section on OO design principles
Version 3.18, 2013-02-11
}
Added digraph class from Quiz 3
Improved derivation of Floyd-Washal all pairs min cost path algorithm.
Links to Dijkstra's Algorithm for min cost path between two vertices.
Version 3.17, 2013-01-28
links to doctest article
Added new section on assignment and discussing all variables being references
Added section on list assignment, shallow copy, and deep copy
Added the binary conversion examples to Phython section
Graph theory examples fixed, path finder hints from class added
Version 3.16, 2013-02-01
removed digraph class because it didn't match class developed in studio
Version 3.15, 2013-01-25
links to PEP 8
links to Circles intro
Added OO examples to Phython section
Version 3.14, 2013-01-23
Added section on Object-Oriented terminolgy
Version 3.13, 2013-01-16
Clarified intro to hash tables.
Change field names in hash table structures to make code clearer.
Version 3.12, 2013-01-15
Fixed bugs in hash tabel insert example.
Version 3.11, 2013-01-14
Added modularized oo-ish rewrite of queue ADT.
Re-did section on hash tables to match the queue style.
Version 3.10, 2013-01-10
Added C examples of standard main program and argument fetching.
Fixed broken queue code.
Version 3.09, 2012-12-08
Added stack allocation and procedure call information to memory section
Expanded array allocation and malloc explanation to struct section
Version 3.08, 2012-11-23
Added section on input switch debouncing.
Version 3.07, 2012-11-21
Minor tweaks to Git section.
Reordering and edits to Searching.
Version 3.06, 2012-11-18
Updated Git section to include U of A gpu environment notes.
Version 3.05, 2012-11-07
Updated toolchain section to reflect new Makefiles
Began changes to installation section to reflect new toolchain and vm
Edits to Sorting and Big O section
Version 3.04, 2012-10-10
Fixed typo in loop invariant example.
Version 3.03, 2012-10-10
Added section on reasoning about programs, invariants.
Version 3.02, 2012-10-09
Revised to break out intro labs into distinct set of notes.
Adafruit 1.8" LCD screen insructions added
Version 2.00, 2012-09-12
Start new version for 2011-2012 session
Moved old 2011 intro to Other section
Version 1.43, 2012-09-07
Numerous small edits in preparation for Fall 2012-2013 term.
Version 1.41, 2012-07-03
Updated notes to reflect feedback from pilot version.
Version 1.38, 2012-04-18
finished section on dynamic programming
Version 1.37, 2012-04-10
added section on dynamic programming
Version 1.36, 2012-04-06
added Makefiles notes to the avr toolchain section
Version 1.35, 2012-03-26
added git notes
added avr toolchain notes
Version 1.34, 2012-02-03
graphs: fixed label bug in digraph.py
graphs: added fancier demo.py that uses labels for rendering
Version 1.33, 2012-02-03
added notes on binary trees and expression trees
Version 1.32, 2012-02-02
updated digraph.py library
Version 1.31, 2012-02-01
rough notes on python
expression trees
graphs and spanning trees
Version 1.30, 2012-01-13
improved the drawing of the hash table lists to contain the student record instead of having a pointer to it.
Version 1.29, 2012-01-12
preliminary notes on hash tables.
preliminary CS XP-lab specific install notes.
Version 1.28, 2011-12-13
fixed stupid typo in binary search algorithm.
Version 1.27, 2011-12-10
added some extra remarks on malloc in section on data structures. This all needs to be moved back into the memory allocation section of the notes.
Version 1.26, 2011-12-08
added examples of linked list manipulation to the section on queues
Version 1.25, 2011-12-07
added section on binary search
Version 1.24, 2011-12-01
fixed bugs in the queue examples
expanded section on interrupts
Version 1.23, 2011-11-16
added section on interrupts
Version 1.22, 2011-11-16
added section on queues and linked lists, needs to have animation examples added
needs to have binary search notes added
Version 1.21, 2011-11-02
removed the quicksort animation example (it is in the demos anyway) and replaced with a standard quicksort.
fixed some typos.
Version 1.20, 2011-10-31
fixed names in merge sort routines to avoid l/1 confusion
corrected comparison in merge from < to <= to ensure stable merge. That is, equal elements will appear from list 1 before being from list 2.
Version 1.19, 2011-10-30
notes on big O notation
added examples of merge sort and quick sort for lists of ascending integers
Version 1.18, 2011-10-24
added struct and SD card examples
Version 1.17, 2011-10-20
corrections to mem_syms.h documentation
typo fix in rsa.p notes
Version 1.16, 2011-10-19
Updated section on memory
Version 1.15, 2011-10-17
Added section on memory
Version 1.12, 2011-09-22
Added section on bit testing and setting
Added rsa exponentiation section
Version 1.11, 2011-09-20
Added section on logical and bit operations
Version 1.10, 2011-09-19
Added missing binary LEDs photo.
Version 1.9, 2011-09-19
Added lab exercise for 2011-09-19
Version 1.8, 2011-09-19
Added RSA notes
Version 1.7, 2011-09-18
Added summary of first week of classes!
Added section on modular arithmetic, gcd, and binary representation.
Added section on connecting up the LCD 144 display with some simple examples.
Added "How to read a program".
Version 1.6, 2011-09-04
Major typos fix.
Added @DefLink markup so that links to Wikipedia are generated automatically for newly defined terms.
Still need to incorporate observations from previous labs into the notes.
Version 1.5, 2011-04-06
Added Lab 4, Making sound.
Version 1.4, 2011-03-23
Added Lab 3, Color recognition.
Fixed confusing wiring error in Lab 2.
Version 1.3, 2011-03-13
Added Lab 2, Tug of War game.
Fixed syntax error in
code/Lab01Part04/Lab01Part04fixed.pde
Version 1.2, 2011-03-03
Added a few more notes on programming concepts.
Version 1.1, 2011-02-26
Fixed some errors in the sample programs after testing out the lab.
Version 1.0, 2011-02-25
Initial release.
}
26. Revision Log
Tangible Computing / Version 3.20 2013-03-25