How to Code: Systematic Program Design - Part 3 (edX)

How to Code: Systematic Program Design - Part 3 (edX)
Free Course
Categories
Effort
Certification
Languages
How to Code: Systematic Program Design - Part 1; How to Code: Systematic Program Design - Part 2
Misc
How to Code: Systematic Program Design - Part 3 (edX)
Adding abstraction and generative recursion to the design tools makes complex problems like puzzle solvers and graph search straightforward.

In part 3 of the How to Code – Systematic Program Design series, you will design programs that even experienced developers would find challenging. The design method you have been learning since How To Code - Systematic Program Design Part 1 will really deliver here, because you will be able to crank out these programs with relative ease.

By learning how to capture common data and control structures using abstraction, your programs will get shorter and better tested.

In this part of the course we will learn how to design search programs. You will design a program to solve Sudoku puzzles, and will be able to design many other puzzle solvers as well.

This course is part of the How to Code - Systematic Program Design XSeries Program:
How to Code: Systematic Program Design - Part 1
How to Code: Systematic Program Design - Part 2

What you'll learn:

- How to identify commonalities is data data definitions and functions.

- How to capture those commonalities as abstractions.

- How to design functions that operate on graphs.

- How to design programs that search a given problem space to find a valid solution.





Free Course
How to Code: Systematic Program Design - Part 1; How to Code: Systematic Program Design - Part 2