Design of Computer Programs
Offered By: Stanford University via Udacity
Course Description
Overview
Understanding how to approach programming problems and devise a solution is an essential skill for any Python developer. In this course, you’ll learn new concepts, patterns, and methods that will expand your coding abilities from programming expert, Peter Norvig.
Syllabus
- Winning Poker Hands
- Steps of the design process and developing for clarity and generality.,Arguments for program correctness and experimentation and simulation.,Design tradeoffs; Simplicity and Clarity. Decomposition and composability.
- 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; Longest palindrome substring algorithm.
- Regular Expressions, other languages and interpreters
- Defining the language of regular expressions and Interpreting the language.,Defining the set of strings matched by a regular expression,Other languages.
- Dealing with complexity through search
- Search: finding your way with a flashlight or boat.,Analyzing the efficiency of an algorithm.,Recurrence relations and Matching data types with algorithms.
- Dealing with uncertainty through probability
- Probability: the game of Pig.,Maximizing expected utility to optimize strategy.
- Word Games
- Managing complexity.,Large sets of words.,Appropriate data structures.
- Conclusion
- Interviews and practice exam.
Taught by
Peter Norvig
Tags
Related Courses
Big DataUniversity of Adelaide via edX Artificial Intelligence (AI) Education for Teachers
Macquarie University via Coursera Foundations of Data Science
Berkeley University of California via edX Computational Thinking for K-12 Educators: Abstraction, Methods, and Lists
University of California, San Diego via Coursera Computational Thinking for K-12 Educators: Conditional Loops and If Statements
University of California, San Diego via Coursera