The final exam will focus (75%) on material studied since the mid-term. A small part of the exam (25%) will focus on material studied in the first half of the class (Haskell, sorting, searching, hash-tables).

Key points to review for the final exam fall in the following categories.

• Game Trees
  1. Variable branching factor
  2. Depth v.s. Breadth first search
  3. Using the appropriate data structures and algorithms
• Stacks and Queues
  1. Fifo v.s. Lifo
  2. Command v.s. Pure implementations
  3. Data structures used (lists, arrays, pointers)
  4. Costs
• Trees stored in Arrays
  1. Implicit pointers
  2. Formulas for computing left-child, right-child, parent, and root.
  3. Incremental growth
  4. balance properties
  5. full v.s. complete
• Heaps and priority Queues
  1. Heap invariants
  2. Min v.s. Max Heaps
  3. Embedding heaps in Arrays
  4. Leftist Heaps, the leftist invariant
  5. Costs
  6. Heap Sort
  7. Satellite data
• Pointers
  1. The PtrCommands library
  2. Linked structures
  3. Costs
  4. Doubly linked structures
• Graphs and graph algorithms
  1. Types of graphs
  2. Representing graphs (functions, arrays)
  3. Algorithms (search, reachabiltity, paths, cycles)
  4. Depth first v.s. breadth first strategies
  5. Infinite graphs
• Multi-way balanced trees
  1. 2-3 Trees
  2. B-trees
  3. Appication to data bases
  4. Costs, advantages and disadvantages (intra-node search)
  5. Comparison to rotation based balanced trees.

Big topics that span the whole quarter

• Contracts and types to specify interfaces
• Sorting
• Searching
• Cost analysis
• Command based v.s. Pure implementations
• Trees and Balanced Trees
• The use of invariants
• Choosing data structures to meet the needs of individual programs
• Designing datastrutures using Algebraic and Abstract data types
• Program design recipes

Back to the class web-page.