(CS 301) Algorithms and Complexity
Algorithmic analysis, strategies, and fundamental algorithms.
1. Read a pseudocode implementation of an algorithm and translate it into a real programming language.
2. Name, describe, and implement the six primary classical sorting algorithms, and articulate the advantages and disadvantages of each.
3. Implement the classical data structures (linked lists, graphs, trees, hash tables) and articulate the advantages and disadvantages of each.
4. Demonstrate mastery in designing and programming algorithms.