http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/index.html Computer Algorithms II en-us http://backend.userland.com/rss Fri Jan 23 18:36:13 EST 2009 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/080902.ogg This lecture has a fine example of a Spoonerism. 40.2 mbytes. 2008-09-03 11:24 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/080904.ogg Poor audio quality, for reasons unknown. 10.1 mbytes. 2008-09-09 05:12 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/080909.ogg 24.9 mbytes. 2008-09-10 23:11 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/080916.ogg 18.1 mbytes. 2008-09-18 12:29 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/080918.ogg 22.7 mbytes. 2008-09-20 23:05 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/080923.ogg Errata and clarifications: § John Coltrane died on 17 July 1967. 23.5 mbytes. 2008-09-24 08:05 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/080925.ogg 22.8 mbytes. 2008-09-25 22:36 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/080930.ogg Errata and clarifications: § I confused Steve McQueen with Paul Newman. Steve McQueen died in 1980; Paul Newman died recently (26 September 2008). § Chess is infinite if you omit the rules that end the game in a tie. Because the board is finite and static and the pieces are finite and decreasing, there are a finite number of board positions. § Hamilton devised quaternions while trying to develop a three-coordinate analog to complex numbers. He realized that three-coordinate numbers couldn't be divided directly, but could be divided when embedded in four-coordinate numbers, the quaternions. 24.5 mbytes. 2008-10-01 10:09 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/081002.ogg 30.1 mbytes. 2008-10-05 23:32 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/081007.ogg 22.5 mbytes. 2008-10-09 13:34 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/081009.ogg Errata and clarifications: § In the worst case, it would take n probes to find an element in an n-element chain; in the best case it would take a single probe. 31.4 mbytes. 2008-10-14 15:02 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/081014.ogg 17 mbytes. 2008-10-16 21:30 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/081016.ogg 29.4 mbytes. 2008-10-16 23:29 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/081021.ogg 24.4 mbytes. 2008-10-27 18:04 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/081023.ogg A noisy but listenable recording. 22.9 mbytes. 2008-10-27 18:03 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/081030.ogg 16.3 mbytes. 2008-11-01 20:37 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/081104.ogg 25.5 mbytes. 2008-11-06 12:31 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/081113.ogg Errata and clarifications: § The Huffman-tree algorithm uses a min priority queue to hold the nodes in the tree being built. The top two nodes in the queue are the next two nodes joined to form a new internal node, which is put back on the queue. 28.7 mbytes. 2008-11-16 01:03 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/081120.ogg 18.1 mbytes. 2008-11-24 00:31 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/081125.ogg 11.8 mbytes. 2008-11-26 21:40 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/081202.ogg 27.4 mbytes. 2008-12-08 12:59 http://bluehawk.monmouth.edu/~rclayton/web-pages/f08-306/081204.ogg Errata and clarifications: § The article is Improving Web Service Discovery with Usage Data by Aliaksandr Birukou, Enrico Blanzieri, Vincenzo D'Andrea, Paolo Giorgini, and Natalia Kokash in IEEE Software, November-December 2007. The paragraph starts at the bottom of the first column on page 52. 27.9 mbytes. 2008-12-08 12:59