University of Nevada Las Vegas
Howard R. Hughes
College of Engineering
School of Computer Science
My Home Page
Computer Science 477/677
Analysis of Algorithms
Spring 2008
Assignments
Revised May 10, 2008
Practice Final is Now Available

-
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.
Thursday January 29, 2008.
Turn in Assignment 1 at the beginning of class today.
Thursday February 7, 2008.
Turn in Assignment 2 at the beginning of class today.
Tuesday February 19, 2008.
Turn in Assignment 3 at the beginning of class today.
Thursday February 21, 2008.
Examination today. Study guide.
Tuesday March 4, 2008.
Turn in Assignment 4 at the beginning of class today.
Thursday March 13, 2008.
Turn in Assignment 5 at the beginning of class today.
Thursday March 27, 2008.
Today we will discuss implementations of arrays.
Tuesday April 1, 2008.
Turn in Assignment 6 at the beginning of class today.
Thursday April 3, 2008.
Examination today. Study guide.
Tuesday April 22 2008.
We will talk about rotations in binary trees, and about treaps.
Thursday April 24 2008.
Turn in Assignment 7 at the beginning of class today.
Tuesday April 29 2008.
Today we will briefly review
Huffman's greedy algorithm for optimal prefix coding, and then
move to the Hu-Tucker algorithm for optimal alphabetic prefix coding.
If time permits, we will then move to Knuth's algorithm for optimal
binary search trees.
Thursday May 1 2008.
Today, we will discuss
loop invariants and
splay trees.
Tuesday May 6 2008.
Today, we will review the Master Theorem for solving recurrences.
In the remaining time, we will review a number of shortest path algorithms.
Thursday May 8 2008.
Today, we will review sorting algorithms that we have learned.
In the remaining time, we will review a number of search structures.
Tuesday, May 13, 2008.
Final Examination.
The final examination is scheduled for 6:00 PM.
The examination will be comprehensive.

Back to
Course Page