Free Course by Peter Norvig at udacity
40 views
Skip to first unread message
Chong
Apr 15, 2012, 8:43:49 PM4/15/12
to cfau...@googlegroups.com
http://www.udacity.com/overview/Course/cs212
PETER NORVIG
Peter Norvig is Director of Research at Google Inc. He is also a Fellow of the American Association for Artificial Intelligence and the Association for Computing Machinery. Norvig is co-author of the popular textbook Artificial Intelligence: A Modern Approach. Prior to joining Google he was the head of the Computation Sciences Division at NASA Ames Research Center.
SYLLABUS
DESIGN OF COMPUTER PROGRAMS
The key to progressing from a novice programmer to an expert is mindful practice. In this class you will practice going from a problem description to a solution, using a series of assignments. With each problem you will learn new concepts, patterns, and methods that will expand your ability and help move you along the path from novice towards expertise.
WEEK 1:
Winning Poker Hands
Steps of the design process; Developing for clarity and generality; Arguments for program correctness; Experimentation and simulation.; Design tradeoffs; Simplicity and Clarity. Decomposition and composability.
WEEK 2:
Back of the Envelope
Back of envelope calculations; When to use brute force and when to be clever; The Zebra puzzle; Generator expressions; Permutations and combinations. Cryptarithmetic; Recursive and wishful thinking.
WEEK 3:
Regular Expressions, other languages and interpreters
Defining the language of regular expressions; Interpreting the language; Defining the set of strings matched by a regular expression; Other languages.
WEEK 4:
Dealing with complexity through search
Search: finding your way with a flashlight or boat; pouring water. Analyzing the efficiency of an algorithm; Recurrence relations; Matching data types with algorithms; Majority algorithm; Longest palindrome substring algorithm.
WEEK 5:
Dealing with uncertainty through probability
Probability: the game of Pig; Maximizing expected utility to optimize strategy.
WEEK 6:
Word Games
Managing complexity; Large sets of words; Appropriate data structures; Word games.
WEEK 7:
Conclusion
Final exam/project
PETER NORVIG
Peter Norvig is Director of Research at Google Inc. He is also a Fellow of the American Association for Artificial Intelligence and the Association for Computing Machinery. Norvig is co-author of the popular textbook Artificial Intelligence: A Modern Approach. Prior to joining Google he was the head of the Computation Sciences Division at NASA Ames Research Center.
SYLLABUS
DESIGN OF COMPUTER PROGRAMS
The key to progressing from a novice programmer to an expert is mindful practice. In this class you will practice going from a problem description to a solution, using a series of assignments. With each problem you will learn new concepts, patterns, and methods that will expand your ability and help move you along the path from novice towards expertise.
WEEK 1:
Winning Poker Hands
Steps of the design process; Developing for clarity and generality; Arguments for program correctness; Experimentation and simulation.; Design tradeoffs; Simplicity and Clarity. Decomposition and composability.
WEEK 2:
Back of the Envelope
Back of envelope calculations; When to use brute force and when to be clever; The Zebra puzzle; Generator expressions; Permutations and combinations. Cryptarithmetic; Recursive and wishful thinking.
WEEK 3:
Regular Expressions, other languages and interpreters
Defining the language of regular expressions; Interpreting the language; Defining the set of strings matched by a regular expression; Other languages.
WEEK 4:
Dealing with complexity through search
Search: finding your way with a flashlight or boat; pouring water. Analyzing the efficiency of an algorithm; Recurrence relations; Matching data types with algorithms; Majority algorithm; Longest palindrome substring algorithm.
WEEK 5:
Dealing with uncertainty through probability
Probability: the game of Pig; Maximizing expected utility to optimize strategy.
WEEK 6:
Word Games
Managing complexity; Large sets of words; Appropriate data structures; Word games.
WEEK 7:
Conclusion
Final exam/project
Reply all
Reply to author
Forward
0 new messages