Topics for the Week of Feb 25, 2008
CS343: Analysis of Algorithms

Note: Exam next week!

Assignments:

• Tues: Programming problem is due - Dijkstra's algorithm and heaps.
• Begin Recurrence Exercises
• Extra Credit - Implement Huffman Coding. The user enters text in text area. Your program, reads the text, calculates frequency of each symbol, and determines the Huffman coding. Your program should also be able to decode and also calculate the size of the compressed vs uncompressed representation. You can use your heap to store the frequencies.

Reading:

• Finish Chapter 4: Greedy Algorithms
• Begin Chapter 5: Divide and Conquer

Lectures:

• Continue Minimum Spanning Tree:
  • Kruskal's Algorithm and the Union-Find Data Structure
  • Prim's Algorithm
  • Reverse-Delete Algorithm
• Huffman Codes and Data Compression
• Solving recurrence relations (chp 5).

Examples of Algorithms

• Dijkstra, Prim, Kruskal
• Reverse-Delete
• Union-Find:
  • Maze generation using Kruskal's algorithm with union-find.
  • Union-Find
  • Another union find.
  • Complexity of Union-find: O(n &alpha(n)) where &alpha(n) is the inverse Ackermann Function
• BFS: wire routing
• Huffman Coding