Analysis of Algorithms - NCSC 6021 Walden University Fall 2006

I took this course in the Fall of 2006 through a distance learning, masters in computer science program at Walden University. — Doug Daniels (Dev Journal) 2006/11/23 19:31

The course focuses on the mathematical analysis of algorithms, and designing efficient algorithms for use in various areas such as searching, sorting, graph algorithms, and numerical algorithms.

Listed below are the various topics that were covered in the course. (I'm going to try and provide some additional details such as homework assignments and practical code samples for some of them. — Doug Daniels (Dev Journal) 2006/11/23 19:31)

1. Efficient Algorithms for the Problem of Computing Fibonacci Numbers
2. Models of Computation
3. Asymptotic's and Recurrence Equations
4. Deterministic Selection and Sorting
5. Amortized Analysis
6. Probability Theory Overview and Analysis of Randomized Algorithms
7. Randomized Algorithms for Selection and Sorting
8. Search Algorithms
9. Probabilistic Analysis of Hashing and Universal Hash Functions
10. Advanced Topic - Hashing Polynomials and Algebraic Expressions
11. Graph Algorithms Using Depth First Search
12. Breadth-First Search of Graphs
13. Flow Algorithms
14. Lexicographical Search - Applied to Scheduling Theory
15. Computing Planar Separators
16. Solution of Sparse Linear Systems
17. The Fast Fourier Transform and Applications to Multiplication
18. Advanced Algebraic Algorithms on Integers and Polynomials
19. Number Theory Algorithms and Cryptography Algorithms
20. Randomized Pattern Matching
21. Approximation Algorithms