CSE 326 Old Announcements -- Autumn 1999

November 18. Slides for section today are in one gigantic Powerpoint presentation:

In Powerpoint.
In HTML.

November 14. Assignments 6 and 7 are now available on the web. There is an adjustment to problem 5 in Assignment 6 that was announced on the course email list.

Here's the sample Makefiles. Remember that you will need to edit these to make them work with your program. Also, you'll generally need a different Makefile for every program.

The Basic Makefile, for those unfamiliar with make.
The Fancier Makefile, for those that are curious.

Nov. 10. You are welcome to use height values rather than balance values in your AVL trees. This greatly simplifies the restoration of height/balance information after deletion, though it is perhaps less interesting from a combinatorial theory point of view.

Nov. 10. For full credit on problem 2 of Part II on the midterm, do problem 1 (both a and b) in Lewis & Denenberg page 321, and turn it in, together with your exam paper (what you wrote your Part II solutions on) Monday in class.

Nov 8. Test files: Small file I had lying around Very small file, C++ source file, Course web page, as of last week.

Nov. 4. Stuff from section on Nov. 4:

The worksheet from class. In Word, or In HTML
Cut-out pieces to help you play with AVL trees (or other binary trees). In Visio, or As GIF

October 29. Reminder: The midterm exam will be given on Friday, Nov. 5. It will be a 50-minute, closed-book test.

October 21. Stuff from section:

Heaps & Static Huffman-with Heaps

My (corrected) answer for the final Heap after the heap exercise. Note that I told some of you that all of the operations are un-ambiguous, so you should get the same answer. However, it was pointed out that if a node has children of equal value, you can swap with either one of them. But, I don't think this comes up in the example we did in class. In GIF or In Visio
Slides on Heaps with Heap Exercise and Static Huffman-with Heaps Exercise. In Powerpoint or In HTML
The Heap as Array worksheet. In GIF or In Visio
The Heap as Tree worksheet. In GIF or In Visio
Example Heap as Tree. In GIF or In Visio
Sheet of number pieces to cut out (to use in Heap). In GIF or In Visio
Sheet of letter pieces to cut out (to use in Heap). In GIF or In Visio
Grid to help you cut out blank squares for the Heap's array (to use in Heap). In GIF.

FlushBits warning picture (didn't seem to help you, though) In GIF or In Visio
Slides on Dynamic Huffman Trees (which I didn't present in section) In Powerpoint or In HTML

October 20. Reminder: There will be a quiz on Friday, Oct. 22. It is "closed-book." It will last about 25 minutes.

October 20. See the Assignment page for additional information related to the programming part of Assignment 3.

October 19. There is some online reference material about Huffman coding and Adaptive Huffman Coding linked from the Assignments page.

October 15. Some help on g++/Unix from last quarter's offering of 326 is here

October 14. Here are copies of things relating to the exercises we did in section:

Map of Ithaca, Homer and Carlisle, NY, (nodes 0,2 and 9) from mapquest.com: as GIF.
Map with some points and highways abstracted to a graph. The lines are labelled with the number of minutes it would take to drive there. Thin lines are supposed to be smallish roads, thick dotted lines are highways, thick-solid lines are major highways. as GIF or as Visio document.
Slides on Floyd-Warshall algorithm, including the table to store the results-so-far. in HTML or in PowerPoint.
All slides on Huffman encoding. in HTML or in PowerPoint.

October 8. Here are the files for Huffman tree construction:
huffman.h, huffman.cpp, and huffman.output.

October 7. Things from section on Oct 7 are on the web:

Binary search code: In Word or In text
Big-O symbols: In PowerPoint or In HTML (please e-mail zasha@cs if there are problems with the HTML)
Graphs of different functions: Just the graph or The original Excel file
G++/UNIX quick intro slides: In PowerPoint or In HTML

October 4. A draft version of Assignment 2 is now available.
It is linked from the Assignments page.

October 1. The "locatives in C" slides presented in section yesterday are now on the web here. Please send email to zasha@cs if you have problems reading these files (they were generated using Microsoft PowerPoint).

October 1. During the week of October 4, the second assignment will be announced. This will require some programming. Our class has been assigned to the CSE Department's instructional Unix machines running Linux. If you need to get an account on these machines because you are a nonmajor, then go to the following web page:
http://www.cs.washington.edu/lab/course-computing/accounts_access.html

October 1. In assignment 1, problem 6, rather than just find a function f such that T(n) is in O(f(n)) find a function f(n) such that T(n) is in big theta of f(n).

October 1. The archive of messages from the mailing list for the class is now linked from our home page.

September 29. Here's the policy on credit for late assignments.

September 28. It's time to sign up for the cse326 mailing list, now that we have cleared off the names of people from the previous quarter. To register, send the following text in the body of a message to majordomo@cs.washington.edu

subscribe cse326

September 28. Note on Assignment 1, problem 5: assume that the functions of n give the numbers of microseconds required by the algorithm.

September 28. We have a second TA! His name is Nic Bone. He's planning to come to class on Fridays, starting this Friday. He has office hours and will be helping out in a variety of ways.

A document describing a C++ equivalent of locatives is given here.

September 27. Welcome to CSE 326!