CSCI 385 Spring 2006
Advanced Data Structures and Algorithms
Archived Class
Charles Cusack
Computer Science
Hope College
Main
Schedule
Grading
Gradebook
Homework
Worksheets

Policies
College
    Policies
Advice

Notes
Programs
Tutorials

CSCI 125
CSCI 255
MATH 131 (01 and 02)
Others

Admin

Homework 5

Details

Homework 5

Due February 7, 2006

All problems are taken from Introduction to the Design and Analysis of Algorithms.

Your work should be clear, concise, and in the order given.No scratched-out work, etc. should be present on your assignment.Illegible or messy work may result in a reduction in points. It is recommended that you learn and use some computer typesetting software (e.g. Word or LaTeX).

SectionPageProblemPoints
2.47784
2.47894
Recurrences112
Total20

Notes:

  1. Recurrences: Solve the following recurrenc relations. Make sure you show all of your work.
    1. T(n) = 2 T(n/2) + n3, T(1)=1
    2. T(n) = T(n - 1) + n, T(1)=1
    3. T(n) = T(n/2) + T(n/4) + T(n/8) + n2, T(1)=1