Posted by admin on June 27, 2011
I will be teaching CS265, Algorithms, at Colorado Tech starting next week. There are still openings available. Here is the course information:
- Students are introduced to the basic concepts of algorithm design analysis, including searching and sorting, hashing and information retrieval.
- Average and asymptotic behaviors are discussed.
- Complexity issues are explored.
- Describe and in basic problems apply the methods of analysis to the algorithms that solve those problems. This includes the derivation of sequences, series and recurrence equations that define the growth function for a pseudo code fragment.
- Find the bounding asymptotic functions for various growth functions. Much dependency will be placed on applying relevant theorems and formulas without requiring their proof.
- Classify algorithms according to their bounding big oh or theta functions.
- Recognized what algorithm design type might be applied to solve a given problem type.
- Trace the execution of an algorithm based on a given design type as applied to a specific problem solution. The student will use representations of data structures to display clearly how the algorithm works.
Leave a comment, and if you'd like your own picture to show up next to your comments, go get a gravatar!