The course Design of Computer Programs on Udacity covers a range of topics related to designing and developing computer programs. It starts with discussing the steps of the design process and emphasizes the importance of clarity and generality in program development. The course also explores arguments for program correctness and the use of experimentation and simulation. Design tradeoffs, such as simplicity and clarity, are examined, along with concepts like decomposition and composability. The course then delves into back of the envelope calculations, teaching when to use brute force and when to be clever. It uses examples like the Zebra puzzle to demonstrate the use of generator expressions, permutations, and combinations. The topic of cryptarithmetic is covered, including recursive and wishful thinking, as well as the longest palindrome substring algorithm. Regular expressions and their interpretation are discussed, along with the use of other languages and interpreters. The course also addresses dealing with complexity through search, analyzing algorithm efficiency, and matching data types with algorithms using recurrence relations. Dealing with uncertainty through probability is explored, using the game of Pig as an example and discussing how to maximize expected utility to optimize strategy. Word games are used to teach managing complexity and appropriate data structures. The course concludes with interviews and a practice exam.