University of Nevada Las Vegas
Howard R. Hughes
College of Engineering
School of Computer Science
My Home Page
Computer Science 715
Advanced Analysis of Algorithms
Spring 2012
Assignments
Revised March 9, 2012

-
Background.
It is important to have a good background in algorithms and data
structures at the level of CSC 477/677.
There is background material in your textbook.
See the syllabus for CSC 477/677.
Tuesday January 17, 2012.
Today I will discuss a dynamic programming problem which seems to take
Θ(n2) time,
but which can be greatly sped up by
using a special property of the problem. We will use amortized
analysis to prove the speedup.
Tuesday January 24, 2012.
Turn in Assignment 1 at the beginning of class today.
Tuesday January 31, 2012.
Slides for the Inverse Ackermann Function and Range Queries
Thursday February 9, 2012.
We will finish up range queries.
Today's handout in
postscript form
pdf form .
We might not even start on that handout today.
If there any time left, we will start on the
Fast Fourier Transform.
The first step will be to review the complex numbers.
Thursday February 16, 2012.
Dr. Bein refused to let me teach today; he and Lucas Bang forced me to go home.
Dr. Bein presented the first 28 slides of
his lecture on batching .
You are responsible for that material.
If there any time left, we will start on the
Fast Fourier Transform.
The first step will be to review the complex numbers.
Today's handout in
postscript form
pdf form .
We might not even start on that handout today.
Tuesday February 28, 2012.
Turn in Assignment 2 at the beginning of class today.
Thursday March 8, 2012.
Find Runge-Kutta files here.
Saturday, May 12, 2012.
Final Examination.
The final examination will be held noon in room TBE B172
(our regular classroom). The examination will be comprehensive.
Postscript format.

Back to
Course Page