CS 201 - Data Structures and Discrete Math

Assignments Page

• Programming Project 1 proj1f14.pdf Due: Wednesday 9/24/14
• Programming Project 2 proj2af14.pdf Due: Wednesday 10/22/14
  • Students submitting the project on the original due date of Tuesday 10/21/14 will earn an extra 10 points on the project
  • Sample Data for Project 2: mazeData.txt

• Homework 1 - Due Tuesday: 10/7/14 during Lecture
  • Problem 2.3.1 from Aho & Ullman on Page 41 (Parts a, b, c, d)
  • Show that 1/(1*2) + 1/(2*3) + ... + 1/(n*(n+1)) = n/(n+1) for all integers n>= 1
  • Prove the following using Strong Mathematical Induction:
    • Suppose that a sequence is defined as:
      • g[0] = 12
      • g[1] = 29
      • g[k] = 5*g[k-1] - 6*g[k-2] for all integers k>=2
    • Prove that g[n] = 5*(3^n) + 7*(2^n) for all integers n>= 0