Algorithms Tentative outline

Week1: Aug 25-27


  • Chapter 1 and 2  Algorithms and their Analysis (complexity)
  • PPTs 1 and 2
  • Hw 1 Due Sept 8:   <<— Note date change.
  1.   page 61 3-2, 3-3a
  2. Show the relationship between the following (both ways.   2n and n!

Week2:Sept 3

  • Chapter 3:Growth of Functions.
  • Project#1: Algorithm Growth
  • Hw 2: Due Sept 8
  • MIT Video: Models of Computation
  • Project#1: Write in python a function that when given a Roman Numeral will convert it to base 10.  Here is a discussion of Roman Numerals.  Add to this function main code that will   convert and print 10 different well thought out test cases that exercise your function.  Look for errors.  Warm Up exercise.

Week3:Sept 8-10

  • More Algorithm Complexity
  • Exam Wed

Week4:Sept 15-17

  • Recurrence Relations and Merge Sort (see ppt) (See video)
  • Recurrence Homework due Sept 24.
  • Roman Numeral due Sept 22.
  • Project#2: Implement the 1D peak algorithm and determine the average complexity of finding a peak given the array is filled using a uniform random generator.   Do some empirical calculation to determine this average complexity.  Due Monday.
  • Study the list and tuple objects in Python.  How do you think python list’s are implemented? What is the complexity of the append operation using your implementation ? Turn in a one page discussion assuming table doubling with associated complexity on Sept 24.

Week5: Sept 22-24

Week6: Sept 29-Oct 1

  • Exam Wed

Week7:Oct 6,8

Week8: Oct 13-15

Week9: Oct 20-22

  • Exam Wed

Weel10:Oct 27-29: (Oct 27 is last day to drop)

Week11:Nov 3-5

  • Billiard Ball problem:In this project you are to apply the backtrack algorithm efficiently to solve the 15 ball problem.   When this is solved apply it to the 21 ball problem as well.  Document the code and give output for both of the above cases.   Due next Tuesday.

Week12:Nov 10-12

  • Exam Wed

Week13:Nov 17-19

Week14:Nov 24-Thanksgiving

Week15:Dec 1-3

Final Exam Monday Dec 8th @5:45-7:45

Week 17:

Comments are closed.