Code & Math

Lesson 3: Common code patterns: iterative programs

Massachusetts Institute of Technology: Introduction to Computer Science and Programming

View the complete course at: http://ocw.mit.edu/6-00F08

Introduction to Computer Science & Programming Class Notes

Good Programming Style: Use comments. Type discipline (check
types of operands to properly apply correct operations). Descriptive use of good
variable names as a way of documenting code. Testing all possible branches
Read more →

Lesson 6: Bisection methods, Newton/Raphson, introduction to lists

Massachusetts Institute of Technology (OpenCoarseWare): Introduction to Computer Science and Programming

View the complete course at: http://ocw.mit.edu/6-00F08

Introduction to Computer Science & Programming Class Notes

Bisection methods, Newton/Raphson, introduction to lists

Speed of Convergence
sqrt(x)
f(guess = guess2 -x
f(guess) = 0

As discussed in lesson 5, the best method to find the answer for
differentiable functions is the Netwon/Ralphson Method.

guess i = guess i – f (guess i) / 2 ...

Lesson 1: Goals of the course; what is computation; introduction to data types, operators, and variables

Massachusetts Institute of Technology: Introduction to Computer Science and Programming

Instructors: Prof. Eric Grimson, Prof. John Guttag

View the complete course at: http://ocw.mit.edu/6-00F08

License: Creative Commons BY-NC-SA
More information at http://ocw.mit.edu/terms
More courses at http://ocw.mit.edu

Introduction to Computer Science & Programming Notes

Computational Thinking (Write Code)

Understand Code (Read Code)

Map Problems Into Computation (Analysis & Design)

What is Computation? To better answer ...