Publication Date

Summer 2011

Degree Type

Master's Project

Degree Name

Master of Science (MS)

Department

Computer Science

First Advisor

David Taylor

Second Advisor

Jon Pearce

Third Advisor

Jeff Smith

Keywords

Recurrence Relations Run Times

Abstract

Algorithms which are recursive have running times which can be described by

recurrence equations or recurrences. These equations determine the overall running time complexity of the algorithm. This project intends to create a mechanism for

  • auto generating recurrence equations of the form T(n) = a(T(n)/b) + f(n)

  • creating a computational method for solving them and generating running times

    i.e. O (f(n)) or Ω (f(n)).

  • presenting students with a way to verify their manually computed answers with

    the solution generation by the project

  • generating grading and feedback for their solution

    The exercises will utilize the ‘Substitution Method’ and the ‘Master Method’ logic to compute running time of the algorithms. Also, practice exercises for comparison of various ‘Order of Growth Rates’ will be provided. The project will contribute towards the teaching of analysis of algorithms.

Download

Share

COinS