ICS 340 Algorithm Design and Analysis

General

• Analyze asymptotical complexities (O(n), O(n2), O(log n), and O(n log n), etc.) of algorithms.
• Design and implement different hashing algorithms and be able to use them to store or retrieve data.
• Design and implement non-linear abstract data types such as trees, heaps, and apply them to appropriate problems.
• Implement and apply different graph algorithms (such as depth first, breadth first, shortest path, and minimum spanning tree, etc.) to solve problems.
• Select, implement, and apply appropriate sorting algorithms to solve problems.
• Use pseudo-code to describe algorithms at an intermediate/advanced level.
• Write programs using recursion at an intermediate/advanced level.
• Design and implement algorithmic strategies such as Dynamic Programming and Greedy Strategies to solve problems.