Algorithms Final Review

Final May 20 10:30-12:30

Pattern Matching Lecture #7

• Brute Force (Best/Worse Case)
• O(m-the length of the string) - the pattern is the beginning
• O(m*n) the pattern is all the way at the end

Knuth Morris Pratt

• Best Case - O(m)
• Worst Case - O(m+n) - O(m)
• Be able to create the finite state machine + O(n)to find it at the end

BYG Algorithm

• If you have m chars you're going to need a bit string of m chars long. 1 in every postion.
• Best Case - O(m)
• Worst Case - O(n)

Boyer Moore

• Best Case O(m)
• Worst O(m+n)
• The Skip Table

Random Numbers - Lecture #8

State 1 case where rand nums are necessary

Know the difference between:
• Pseudo Random
and
• Quasi Random
Know:
• Lehmer's Method

Recursive Algorithms - Lecture #9

• Figure out any particular value
• Find the efficiency of the algorithm

Recurrence Relations - Lecture 10

• Be prepared to prove that a non-recursive relation is equivalent by mathematical induciton
• Be prepared to show how you might make a guess

Numerical Computation - Lecture #11

• Be prepared to write code for an efficient way to compute a power series and why!
• Be able to compare and constrast the:
  • Rectangle method
  • Trapezoid method
  and
  • Simpson's rule

Graphs - Lecture #12

• Dijstra's rule

[Back to the Notes Page]