Algorithms

Program Overview

This program provides a comprehensive overview of algorithms, covering fundamental concepts, data structures, and techniques. It explores various types of algorithms, including graph algorithms, internet algorithmics, and computational geometry. The program emphasizes algorithm analysis and computational intractability, equipping students with the skills to identify and analyze algorithms for efficient problem-solving.

Program Outline

Outline:

• Course Content:
• Basic concepts and theories in the identification and analysis of algorithms
• Different types of algorithms and how they are used to solve problems
• Review of fundamental tools:
• Algorithm analysis
• Basic data structures
• Searching
• Sorting
• Fundamental techniques
• Graph algorithms:
• Graphs
• Weighted graphs
• Matching
• Flow
• Internet algorithmics:
• Text processing
• Number theory and cryptography
• Network algorithms
• NP and computational intractability
• Computational geometry
• Algorithmic frameworks
• Analysis techniques for estimating run-time efficiency