• Jan 29, Lab 1 (as html), Lab 1 (as PDF) Lab 1 will be weighted 2 points.

 

  • Feb 5, lab 2 – Project # 1 will be started. Project # 1 is based on linked lists and recursion. Final version of project # 1 description. Project 1 will be weighted 8 points.

 

  • Feb 12, lab 3  Project # 1 will be continued. Some exercises in analysis of algorithms (Chapter 2) will be done. Lab 3 will be weighted 3 points.

 

  • Feb 19, lab 4 Project # 1 continued

 

  • Feb 26, lab 5 Project # 1 completed. Project # 2 started. The final version of project # 2 description can be found. A short tutorial on EasyBMP. Font images needed to do Problem 1 of Project 2 can be found here. Project 2 is due: March 16, 2008.  It will be weighted 8 points.

 

  • March 4, lab 6: Project # 2 discussion continued. Review of mid-term # 1

 

  • March 11, lab 7: Project # 2 implementation will start. Project # 3 outline will be discussed. A final version of project # 3 description can be found. Project # 3 will be weighted 10 points.

 

    • Due: April 1, 2008

 

  • Lab # 8, March 18, Hash table implementation will be discussed. Project # 4 is based on hash tables. A preliminary version of project # 4.

 

  • Lab # 9, April 1, Project # 3 completed. Project # 4 final version handed out. Project # 4 will be weighted 10 points.

 

  • Lab # 10, April 8, Project # 4 will be discussed. Note that each word in the dictionary appears in a separate line. The first line contains the number of words.

 

  • Lab # 11, April 15, Project # 4 discussion continued.

 

  • Lab # 12, April 22, Project # 4 is completed. Mid-semester Test # 2 review. Preliminary version of project5 handed out.  

 

  • Lab # 13, April 29, Project # 5 involves image compression/decompression using a data structure called quad-tree (which is similar to a binary search tree). Project # 5 discussion starts. Project # 5 will be weighted 12 points.