Coursera - Introduction to Systematic Program Design - Part 1 (2013)

seeders: 0
leechers: 27
Added on January 17, 2016 by dezy17in Other > Tutorials
Torrent verified.



Coursera - Introduction to Systematic Program Design - Part 1 (2013) (Size: 1.32 GB)
 overview.pdf15.24 MB
 rolling-lambda-solution.rkt783.18 KB
 rolling-lambda-without-geometry-solution.rkt781.85 KB
 termination-solution.rkt214.21 KB
 sudoku-solution.rkt142.25 KB
 cat-v4.rkt123.35 KB
 cowabunga-v6.rkt118.59 KB
 cowabunga-v5.rkt117.07 KB
 cowabunga-v4.rkt114.82 KB
 cat.rkt113.82 KB
 cowabunga-v3.rkt111.91 KB
 rolling-lambda-without-geometry-starter.rkt630.18 KB
 rolling-lambda-starter.rkt630.06 KB
 termination-starter.rkt212.67 KB
 sudoku-v4.rkt138.79 KB
 sudoku-v3.rkt131.89 KB
 fractals-starter.rkt130.69 KB
 cantor-starter.rkt129.51 KB
 sudoku-v2.rkt126.86 KB
 sudoku-v1.rkt125.88 KB
 sudoku-starter.rkt122.83 KB
 all problems.pdf265.14 KB
 week5 self reference.pdf205.37 KB
 week4 worlds.pdf204.6 KB
 week7 local expression and abstraction.pdf196.67 KB
 week3 data.pdf195.9 KB
 week8 generative recursion.pdf191.75 KB
 week1 primitives.pdf185.71 KB
 week2 functions.pdf168.78 KB
 week6 mutual reference.pdf166.22 KB
 to do well.pdf116.28 KB
 06h.pdf780.08 KB
 05d.pdf735.02 KB
 06k.pdf693.07 KB
 07C.pdf676.81 KB
 07e.pdf667.68 KB
 03H.pdf667.24 KB
 06B.pdf646.42 KB
 05H.pdf627.31 KB
 01G.pdf619.06 KB
 07k.pdf613.38 KB
 01 core - 02 htdd.pdf256.74 KB
 01 core - 03 data driven templates.pdf216.77 KB
 01 core - 04 htdw.pdf170.71 KB
 01 core - 01 htd.pdf168.92 KB
 04 abstraction - 02 from type comments.pdf148.09 KB
 00 design recepies main.pdf139.04 KB
 03 control driven - 01 function composition.pdf131.68 KB
 04 abstraction - 03 abstract functions.pdf122.57 KB
 03 control driven - 03 generative recursion.pdf106.81 KB
 03 control driven - 02 backtracking.pdf106.34 KB
 04 abstraction - 01 from examples.pdf91.81 KB
 racket-5.3.5-bin-i386-win32.exe51.71 MB
 5 - 10 - 04j HtDW With Compound Data.srt36.71 KB
 9 - 2 - 08b - Fractals.srt26.81 KB
 8 - 13 - 07m Fold Functions.srt23.15 KB
 8 - 11 - 07k Using Built In Abstract Functions.srt22.97 KB
 9 - 11 - 08k - Sudoku -- Making the Wish List Come True 2.srt22.01 KB
 7 - 12 - 06l Backtracking Search.srt21.3 KB
 8 - 5 - 07e Local Expressions -- Encapsulation.srt21.16 KB
 8 - 10 - 07j Abstraction from Examples - 3.srt20.89 KB
 5 - 4 - 04d HtDW Program Through main Function.srt18.49 KB
 6 - 12 - 05l A Parlor Trick.srt18.47 KB
 5 - 10 - 04j HtDW With Compound Data.mp444.66 MB
 1 - 1 - 01a Introduction.mp429.27 MB
 5 - 4 - 04d HtDW Program Through main Function.mp429.22 MB
 7 - 12 - 06l Backtracking Search.mp428.67 MB
 7 - 5 - 06e More Helpers - Domain Knowledge.mp426.11 MB
 4 - 1 - 02a How to Design Functions (Full Speed).mp425.22 MB
 9 - 2 - 08b - Fractals.mp424.79 MB
 8 - 13 - 07m Fold Functions.mp422.89 MB
 9 - 11 - 08k - Sudoku -- Making the Wish List Come True 2.mp421.65 MB
 9 - 12 - 08l - Sudoku -- Making the Wish List Come True 3.mp421.42 MB


Description

Course Description

Instructors: Gregor Kiczales

Phones, diesel engines, animated newspapers, medical devices, games, political campaigns, medical research, mining, transportation systems, ... and so on, and on, and on... every day more of the world around us is at least partly run by computer programs. This means that being able to design programs - or at least be able to work with people who design programs - is becoming a more and more valuable skill.

To build your own programs you need to know two things: how to use the specific programming language and libraries needed, and the more general skill of how to design a program.

This course presents a design method that will enable you to approach the design of complex programs systematically. The method will work for programs in this course as well as hard to design programs you develop in the future.

Using this method you will learn how to model the information in a problem domain, how to structure program data to mirror that information and how to further structure the data to lead to a well organized program. You will also learn to distinguish those parts of a program that are naturally data driven, from those that should use an alternative algorithmic approach. The method uses unit-tests to both produce a better developed design, and to test your program as you develop it.

In the first course -- Part 1 -- we use a simple teaching language to cover the core of the design method. In Part 1 we cover various forms of data; simple interactive programs like games and animations; storing information in and rendering trees; and finally exploring search programs: programs that solve puzzles like Sudoku boards.

A second phase of the course, to be offered later, will consist of parallel tracks, with each track using a different popular programming language and focusing on a different kind of problem. This will help you bring the design method to whatever language and problem domain interests you.

Sharing Widget


Download torrent
1.32 GB
seeders:0
leechers:27
Coursera - Introduction to Systematic Program Design - Part 1 (2013)

All Comments

great upload!

please seeed
could you get us another parts?
Thanks for the upload.

Please Seed!!!