[ CIS313 | CIS | UO | News ]

• Homework Assignments #1: Chapter 5, Problems 1, 2, 11, 15
  Due: Monday, January 13.

• Homework Assignments #2:
  
  • Give meaningful upper and lower bounds on the asymptotic growth rate of the Fibonacci numbers, F(n).
  • Use recursion to implement a function that evaluates the factorial function, n! What is its time complexity (consider both uniform and logarithmic cost criteria)? space complexity?
  • Give a tight bound on the asymptotic growth rate of the binomial coefficients, n choose k, as a function of n (consider both cases of constant and varying value of k).
  Due: Friday, January 24.

• Programming Assignment #1
  Due: Monday, January 27.

• Homework Assignment #3
  Due: Friday, February 7.

• Programming Assignment #2
  Due:
  • First phase: Friday, February 7
  • Second phase: Wednesday, February 12.
    (moved back to Friday, Feb.14)

• Homework Assignment #4
  Due: Wednesday, Feb. 19.

• Homework Assignment #5
  Due: Wednesday, Feb. 26.