Introduction to Computer Science and Programming

This subject is aimed at students with little or no programming experience. It aims to provide students with an understanding of the role computation can play in solving problems.  READ MORE

Decomposition and Abstraction through Functions

Professor Eric Grimson dives into Recursion theory, also called computability theory, studies the properties of computable functions and the Turing degrees, which divide the uncomputable functions into sets that have the same level of uncomputability. READ MORE

Common Code Patterns

This subject is aimed at students with little or no programming experience. It aims to provide students with an understanding of the role computation can play in solving problems. It also aims to help students, regardless of their major, to feel justifiably confident of their ability to write small programs that allow them to accomplish useful goals. READ MORE

Complexity log, linear, quadratic algorithms

Prof. Eric Grimson, Prof. John Guttag’s goal their subject matter to students with little or no programming experience. It aims to provide students with an understanding of the role computation can play in solving problems.  READ MORE

Bisection Methods Newton/Raphson

Newton’s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real-valued function. READ MORE

Follow Me