Week 5 - Monday, September 18, 2006 to Friday, September 22, 2006

Dynamic Memory and Linked Lists

Comments

     Linked Lists and Binary Search Trees are the first data structures based on pointers that we will study.  Generally, once you "get" the tricks to do pointer based data structures, everything falls into place.  This week and the next week on Binary Search Trees are the basis of Project 2.      

Course Content

    Week 5:
    Dynamic Memory 
    Linked Lists

Readings

  Deitel and Deitel Fifth Edition, Sections 8.1, 8.2, 8.3, 8.4, 8.7, 8.8, and 8.9 .

  Deitel and Deitel Fifth Edition, 21.1 to 21.4.  Pay close attention to the conceptual parts, and especially the diagrams.   Unfortunately this chapter is after the chapter on templates, which we have not covered yet.  Try to ignore the template code, but you may not find the example code in these readings helpful.

  Deitel and Deitel Fourth Edition, 17.1 to 17.4.  Same caveats.

Lab Assignment

    Lab 5
 

Week 5 Test

    12 Questions for 4 points, with fractions rounded up.

    Only available Friday, September 22nd, from 6:00 am to 3:00 am Saturday morning on Angel.  It will cover the following material:   

• Conceptual questions or questions about code, all based on material covered in the Week 5 Course Content  - Dynamic Memory and Linked Lists.  The readings from Deitel will not be included on the test.