In Ch 4:

• Skip the application (Maintaining an Inventory, pp. 184-9).
• DO: Self-Test Exercise #5
• DO: Exercise #15

In Ch 6:

• Read the infix to postfix conversion lightly (bottom p. 271 - top p. 281). We covered this using a recursive algorithm.
• Skip the search example (top p. 281 - bottom p. 293).

In Ch 7:

• Note when array-based vs linked-based versions are preferred.
• Skip the code for each implementation -- it is not important if you have studied the stack implementations. Read the material that precedes the code (in each case), and summarizes (with diagrams) how the two algorithms work (and their pros and cons)
• Skip "Implementation that uses the ADT List", bottom p. 321 - bottom p. 323 (again, you should have read very similar material as it related to stacks)
• Read from p. 324 to the bottom of p. 331 of the Bank Simulation Problem -- make sure you fully understand the problem and how the queue can be used to model the most important object in the problem -- the waiting line for a teller. Learn about arrival and departure events. This type of problem is quite common. As long as there are no priorities associated those who are waiting, a queue can be an effective data structure for modeling the waiting line.
• DO: (no exercise assigned)

IN Ch 8:

• Read entire Chapter carefully but you can skip the section on ADTs list and the sorted list revisited (pp. 372-380).
• There is nothing really new in the templates section over what we did for the hash table. But the example is important nonetheless.
• Read the section on overloaded operators carefully.
• DO: Self-Test Exercise #1 and 2
• DO: Exercise #1

Return to Previous Page