MIT 6.006 episode 1

Algorithmic thinking and Peak finding

• Efficient procedures for solving problems on large inputs
• Scalability
• Classic data structures and classical algorithms
• Real implementations in Python

Content

• 8 modules
• Algorithmic thinking : peak finding
• Sorting and trees : Event simulation (logic network using a particular kind of data structure)
• Hashing : Genome comparison (human to rat genome)(have to ensure complexity to be able to finish in specified runtime)
• Numerics : RSA encryption (SSL, how does python handle what are called infinite precision numbers)
• Graphs : Rubiks cube assignment
• Shortest paths : Caltech -> MIT
• Dynamic Programming : Image compression
• Advanced topics : complexity theory , research in algorithms

Peak finder

• toy problem, but very evocative in the sense that it points out the problems involved in designing efficient algorithms
• one dimensional version called a peak finder
• runs on an array of numbersMIT 6.006 episode 1

Algorithmic thinking and Peak finding

• Efficient procedures for solving problems on large inputs
• Scalability
• Classic data structures and classical algorithms
• Real implementations in Python

Content

• 8 modules
• Algorithmic thinking : peak finding
• Sorting and trees : Event simulation (logic network using a particular kind of data structure)
• Hashing : Genome comparison (human to rat genome)(have to ensure complexity to be able to finish in specified runtime)
• Numerics : RSA encryption (SSL, how does python handle what are called infinite precision numbers)
• Graphs : Rubiks cube assignment
• Shortest paths : Caltech -> MIT
• Dynamic Programming : Image compression
• Advanced topics : complexity theory , research in algorithms

Peak finder

• toy problem, but very evocative in the sense that it points out the problems involved in designing efficient algorithms
• one dimensional version called a peak finder
• runs on an array of numbers
• toy problem, but very evocative in the sense that it points out the problems involved in designing efficient algorithms
• one dimensional version called a peak finder
• runs on an array of numbers