Computer Science 385
Design and Analysis of Algorithms

Spring 2019, Siena College

Home     Syllabus     Schedule

Agenda

• Announcements
  • Problem Set 1: [PDF] due now
    • submit your hard copy to the written problems now
    • make sure code is committed and pushed to GitHub
    • late clock starts now
    • if you submit the written portion late when I am not here to accept it, please email a photo of your work to get a timestamp
    • late penalties for code portion will be based on the time of the last commit
  • Lab 3: Algorithm Analysis Practice, due before your lab meeting next week
  • Expect Problem Set 2 to come out on Monday
• Quiz Monday: pencil and paper, you will be asked to write a couple short methods for the graph data structures we've been working with, and to answer a few short questions about those graph structures (look at a similar one from last year)
• Quick Lab 2: Introduction to METAL Graph Data recap
• Analyzing non-recursive algorithms
• Brute-force algorithms
  • sorting: bubble sort and selection sort
  • in-class exercise: sequential search (handout)
  • string matching
  • start in-class exercise: Levitin Exercise 3.1.4, p. 102

Terminology

• brute-force algorithms
• sorting
• bubble sort
• selection sort
• string matching, pattern/substring, test

Links

• Bubble Sort at Sorting Algorithm Animations
• Selection Sort at Sorting Algorithm Animations