Notes to Supplement Class Lectures
for CS 510: Analysis of Algorithms

Here are extra notes from classes or labs to supplement your notes.

Last modified on 3/31/98.

• First Week:
  • Class Syllabus
  • Introduction to Algorithms and Big Oh Notation (Sections 1.1 - 1.4)

  • Algorithm Comparison Spreadsheet Program (Section 1.5 - 1.6)
  • Notes on Modeling the Problem, adapted from Skiena, The Algorithm Design Manual, Telos, 1997 (Section 1.7 and parts of Chapter 8).
  • Fundamental Data Types (Section 2.1)

• Second Week:
  • some notes on Heapsort
  • STL implementation of Heapsort
  • STL Heapsort output
  • Skew Heap description and example
  • Sample Code for Skew Heap Sort
    • APvector header and source
    • CodeWarrior Project File
  • Presentations:
    • Wednesday:
      • Pros and Cons of Data Structures (Section 2.2) - Tyson
        Data Structures Expert System
      • Suffix Trees as a Data Structure (Section 2.8) - Rob & Joshua
      • Applications of Sorting (Section 2.4) - Becky & Katie
    • Friday:
      • Sorting Techniques: Pros & Cons (Section 2.5) - Mike & Brian
      • Introduction to Dynamic Programming - Summary of 3.1 - 3.5
  • Other Sorting Algorithms: (PowerPoint Presentations)
    • Bubble Sort
    • Insertion Sort
    • Merge Sort

• Third Week:
  • Dynamic Programming Presentations
    • Monday:
      • Fibonacci numbers: (Section 3.1.1) - Brian & Mike
      • The Partition Problem (Section 3.1.2) - Dan
      • Approximate String Matching - Joshua & Anders
    • Wednesday:
      • Longest Increasing Sequence (Section 3.1.4) - Katie (powerpoint presentation)
      • Minimum Weight Triangulation (Section 3.1.5) - Becky
      • Divide and Conquer - Summary of Section 3.6
      • Matrix Multiplication (PowerPoint presentation)
  • Friday: Case Study of Dynamic Programming

• Fourth and Fifth Week: Graph Algorithms
  • Monday (4/20):
    • The Friendship Graph (Section 4.1) - Brian
    • Data Structures for Graphs (Section 4.2) - Rob
    • Tyson's Data Structures for PP2 - Tyson
    • Traversing a Graph (Section 4.4)
      • Breadth-First Graph Traversal
      • Depth-First Graph Traversal
  • Wednesday (4/22):
    • Connected Components (Section 4.5.1) - Anders
    • Tree and Cycle Detection (Section 4.5.2) - Dan
    • Two-Coloring Graphs (Section 4.5.3) - Becky (PowerPoint Presentation)
    • Topological Sorting (Section 4.5.4) - Mike (PowerPoint Presentation)
    • Articulation Vertices (Section 4.5.5) - Katie (Word Document)
  • Friday (4/24):
    • CLASS CANCELLED
  • Monday (4/27):
    • Modeling Graph Problems (Section 4.6) - Rob & Joshua
    • Minimum Spanning Trees (Section 4.7) - Becky & Anders
    • Shortest Paths (Section 4.8) - led by Mike & Brian
  • Wednesday (4/29):
    • Questions
    • Midterm
  • Friday (5/1):
    • Discussion on Midterm

• Sixth Week: Combinatorial Methods and Heuristics
  • Monday (5/4):
    • Intoduction to Combinatorics - Kelly
    • Backtracking (Section 5.1) - Kelly
    • Search Pruning (Section 5.2) - Katie
    • Bandwith Minimization (Section 5.3) - Dan
    • Simulated Annealing (Section 5.5.1) - Tyson
    • Wednesday (5/6):
      • Neural Nets (Section 5.5.2) - Rob
      • Genetic Algorithms (Section 5.5.3) - Joshua
      • Parallel Algorithms (Section 5.7) - Kelly
      • Minimax Algorithm
      • Exercises from Chapter 5
    • Friday (5/8):
      • Introduction to Intractable Problems and Reductions (Section 6.1) - Kelly

• Seventh Week: Intractable Problems and Approximations
  • Wednesday (5/13):
    • Hamiltonian Cycles (Section 6.2.1) - Brian
    • Independant Set and Vertex Cover (Section 6.2.2) - Anders
    • Clique and Independant Set (Section 6.2.3) - Mike
    • Satisfiability and NP-Complete (Section 6.3) - Kelly
  • Friday (5/15):
    • Continuation of NP-Completeness (Section 6.3) - Kelly
    • We will work problem 6-5 on page 160 if there is time.

• Eighth Week: Computability and How to Design Algorithms
  • Monday (5/18):
    • Aproximate Vertex Cover (Section 6.8.1) - Dan
    • Euclidean Traveling Sales Person Problem (Section 6.8.2) - Tyson
    • Continuation of NP-Completeness (Section 6.4) - Kelly
      • Open Efficient Domination (PowerPoint Presentation)
      • One-in-Three 3-Satisfiability
        • Input: A collection of clauses C where each clause contains exactly 3 literals over a set of Boolean Variables V.
        • Output: Is there a truth assignment to V such that in each clause there is exactly one literal that is satisfied?
      • Reduction from One-In-Three to EOD set (transparency).
  • Wednesday (5/20):
    • NP-Complete Cartoons
    • How to Design Algorithm Discussion and in-class project (Chapter 7)
  • Friday (5/22): NP-complete class work.

• Ninth Week: Topic Presentations
  • Monday: No school, Memorial Day
  • Wednesday: Final Presentations
    • The game of Risk - Dan
    • Nearest Neighbor Search (Section 8.6.5) - Joshua
    • Parallel Processing Algorithms - Rob
  • Friday: Final Presentations
    • Job Scheduling (Section 8.3.9) - Brian

• Tenth Week: Topic Presentations
  • Monday: Final Presentations
    • Voronoi Diagrams (Section 8.6.4) - Katie
    • Drawing Graphs Nicely (Section 8.4.10) - Mike
    • Graph Isomorphism (Section 8.5.9) - Becky
  • Wednesday: Final Presentations
    • Thick Lens Application (Sections 8.2.3, 8.2.4 and 8.2.6) - Tyson
    • Text Compression (Section 8.7.5) - Anders
  • Friday: Wrap up, Final Projects due

• notes on Breadth-First Tree and Graph Searches/Traversals: (PowerPoint Presentations)
  • Binary Tree Traversal Animation
  • Binary Tree Traversal Algorithm
  • Breadth-First Graph Traversal

• notes on Depth-First Tree and Graph Searches/Traversals: (PowerPoint Presentations)
  • Pre-Order Binary Tree Traversal Animation and Algorithm
  • In-Order Binary Tree Traversal Animation and Algorithm
  • Post-Order Binary Tree Traversal Animation and Algorithm
  • Depth-First Graph Traversal

CS 510 Home

News

Homework

Class Projects

Class Notes

Syllabus

Bibliography