Computer Science 385
Design and Analysis of Algorithms

Spring 2017, Siena College

Home     Syllabus     Schedule

Agenda

• Announcements
  • If your group did not complete Lab 3: Algorithm Analysis Practice, you may submit until the start of your lab meeting tomorrow
  • Exam 1 information coming soon
  • Homework Set 1: [HTML] [PDF] continues through Friday
• Brute force algorithms
  • convex hulls
  • Exhaustive search
    • traveling salesman
    • knapsack problem
    • assignment problem
  • Graph traversals
    • depth-first search/traversal
    • breadth-first search/traversal

Terminology

• exhaustive search
• traveling salesman problem
• Hamiltonian circuit
• knapsack problem
• assignment problem
• graph traversal
• depth-first and breadth-first search in graphs

Examples

• BruteForceConvexHull