home
TCSS 342B, Autumn 2004
Mathematical Principles of Computing I

Assignments & Reading

Look here for a directory listing of all assignments.

  • Assignment #1, due Oct. 6. Optional java code for testing.
  • Reading: Lewis & Chase, Chap 1 and 2 for 10/4. Chapter 3 for 10/6.
  • Assignment #2, due Oct. 13.
  • Reading: Lewis & Chase, Chap 6, 7, and 8. We will cover the indexed list ADT from chapter 8 first, but it may make more sense to read the book in order (chapter 6 first).
  • Reading: Lewis & Chase, Chap 4, for 10/13.
  • Programming Project #1, (hw #3) due Oct. 20.
  • Reading: Lewis & Chase, Chap 5.
  • Homework #4, due Oct. 25. This is a short programming project with an analysis of your program. The previous link contains the .zip file of the code and the homework description document. For just a look at the description of the homework, check here.
  • Homework #5 , (written assignment #3), due Nov. 8.
  • Reading: Lewis & Chase Chap. 9 & 10 (on trees).
  • We will cover AVL trees followed by red-black trees.
  • Word Count project, (Project #3, Homework #6). Due in three stages, on Nov 17, Nov. 24, and Nov. 29. This is a programming project with experimental analysis. For the project details without the code, see this word document. which is now also in pdf form.
  • We will be covering hashing after AVL and Red-Black trees. Thus, you should read chapter 13 next.
  • A new hash table java file for project #3, as well as additional documentation in word format and pdf format. The .zip file given initially (link above) now includes these new files.
  • Due date for the hashtable part of the project has been extended to Dec. 1st.
  • You should read chapter 11 next on heaps.
  • The final assignment is a project on Huffman coding; you will be allowed to work with a partner if you sign up for a partner before Tuesday Nov. 30 at 5 PM. I will give out partner assignments in class Wednesday. The assignment will be due on our last day of class, Dec. 9th. I will talk about Huffman coding on Wednesday.
  • In the last week of class, we will finish talking about heaps and priority queues, and have a short intro to graphs (chapter 14).
  • Huffman coding project, (Project #4, Homework #7), due on Dec. 9. Starter code, for the project.