COT4110 Homework #3 - UCF Computer Science
COT4110 Homework #3
Assigned: 9/16/99
Due: 9/28/99
1) Solve this recurrence:
(n-1)2T(n) = n2T(n-1) + n(n-1), with T(1)=1
2) Given an ample supply of 1x1 tiles and 2X1 tiles, how many ways can you tile an nX1 rectangular patch? (For example, there are three ways to tile a 3X1 patch. You can have 3 1X1 tiles, or a 1X1 tile followed by a 2X1 tile, OR a 2X1 tile followed by a 1X1 tile. So, even though the last two arrangements are mirror images of each other, they each count as a distinct tiling.)
3) Bound this summation as tightly as you can. (But don’t do more than 1 page of work to do so, and don’t use a calculator or computer.)
[pic]
4) Find a closed form solution for this summation.
[pic]
5) Find a closed form solution for this double summation.
[pic]
6) Find a closed form solution for this double summation.
[pic]
................
................
In order to avoid copyright disputes, this page is only a partial summary.
To fulfill the demand for quickly locating and searching documents.
It is intelligent file search solution for home and business.
Related searches
- igcse computer science workbooks pdf
- igcse computer science workbook
- igcse computer science workbook answer
- igcse computer science coursebook pdf
- computer science people
- what is computer science like
- computer science revision
- igcse computer science revision notes
- college computer science project ideas
- ideas for computer science project
- computer science projects for students
- computer science final project