Work Note 1, DM206, fall 2010

Lecture November 8

• Introduction.
• Prerequisites.
• Leftist Heaps [T83].
• Skew Heaps [W95].

Announcements

• The general requirements for this course are introductory courses in algorithms and data structures and discrete mathematics. The specific requirements for this course include at least the following:
  • Search Trees (red-black trees)
  • Priority Queues (binary heap)
  • Disjoint Sets (Galler-Fischer representation)
  • Asymptotic Notation
  • General Methods in Time and Space Analysis
  • Amortized Analysis
  Review this material as soon as possibly.
• Material covered in lectures will in general be distributed in class. The major exception to this are references to [CLRS01] (see the discussion of literature below). You may come by my office at any time before the first lecture to pick up material (photocopies) for the first lectures. They will also be available in class.
• I will maintain a list of used (distributed) material. There you can continuously see where you find information bout the various topics and verify that you have all the material.