CS 201 - Data Structures and Discrete Math

Fall 2014

Assignments Page

Programming Projects Homework Problems
  • 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
  • Homework 2 Homework2_f14_201.pdf- Due Thursday: 12/4/14 during Lecture
-- Main.troy - 2014-09-08
Topic attachments
I Attachment Action Size Date Who Comment
PDFpdf Homework2_f14_201.pdf manage 266.6 K 2014-11-25 - 06:05 UnknownUser  
Texttxt mazeData.txt manage 0.7 K 2014-10-06 - 03:56 UnknownUser  
PDFpdf proj1f14.pdf manage 158.4 K 2014-09-08 - 05:18 UnknownUser  
PDFpdf proj2af14.pdf manage 171.6 K 2014-10-06 - 03:56 UnknownUser  
Texttxt proj3a.txt manage 0.2 K 2014-11-03 - 14:26 UnknownUser  
Texttxt proj3b.txt manage 0.1 K 2014-11-03 - 14:26 UnknownUser  
Texttxt proj3c.txt manage 0.1 K 2014-11-03 - 14:26 UnknownUser  
Texttxt proj3d.txt manage 0.1 K 2014-11-03 - 14:27 UnknownUser  
Texttxt proj3e.txt manage 0.1 K 2014-11-03 - 14:27 UnknownUser  
Texttxt proj3f.txt manage 0.1 K 2014-11-03 - 14:27 UnknownUser  
PDFpdf proj3f14.pdf manage 177.4 K 2014-11-03 - 19:19 UnknownUser  
Topic revision: r9 - 2014-11-25 - 06:05:25 - Main.troy
 
Copyright 2016 The Board of Trustees
of the University of Illinois.webmaster@cs.uic.edu
WISEST
Helping Women Faculty Advance
Funded by NSF