TWiki> CS201 Web>CS201F14>AssignmentsF14 (2014-11-25, Main.troy)

# CS 201 - Data Structures and Discrete Math

Fall 2014

### Assignments Page

Programming Projects
• 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
• Programming Project 3 - proj3f14.pdf Due: Monday 11/17/14 at 11:59pm
• Sample Data File: proj3a.txt
• A Group of Data Files that work together:
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
pdf Homework2_f14_201.pdf manage 266.6 K 2014-11-25 - 06:05 UnknownUser
pdf proj1f14.pdf manage 158.4 K 2014-09-08 - 05:18 UnknownUser
pdf proj2af14.pdf manage 171.6 K 2014-10-06 - 03:56 UnknownUser
pdf proj3f14.pdf manage 177.4 K 2014-11-03 - 19:19 UnknownUser
txt mazeData.txt manage 0.7 K 2014-10-06 - 03:56 UnknownUser
txt proj3a.txt manage 0.2 K 2014-11-03 - 14:26 UnknownUser
txt proj3b.txt manage 0.1 K 2014-11-03 - 14:26 UnknownUser
txt proj3c.txt manage 0.1 K 2014-11-03 - 14:26 UnknownUser
txt proj3d.txt manage 0.1 K 2014-11-03 - 14:27 UnknownUser
txt proj3e.txt manage 0.1 K 2014-11-03 - 14:27 UnknownUser
txt proj3f.txt manage 0.1 K 2014-11-03 - 14:27 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 WISESTHelping Women Faculty AdvanceFunded by NSF