MIT / Computer Science / Data Structures
Lecture : Register Machines
By Peter Szolovits | Structure and Interpretation of Computer Programs
Lecture 17 of 21
Rate this lecture -
Add to My Courses
More Lectures -
Course Description
This course introduces students to the principles of computation. Upon completion of 6.001, students should be able to explain and apply the basic methods from programming languages to analyze computational systems, and to generate computational solutions to abstract problems. Substantial weekly programming assignments are an integral part of the course. This course is worth 4 Engineering Design Points.
Courses Index
1 : Software Engineering   (Armando Fox / Berkeley)
2 : Data Structures   (Paul HILFINGER / Berkeley)
3 : Higher Computing   (Susan Crosson / University of New South Wales)
4 : Data Structures and Algorithms   (Susan Crosson / University of New South Wales)
5 : Design in Computing   (Susan Crosson / University of New South Wales)
6 : Introduction to Data Structures   (Bigbean Counter / International Technology University)
7 : Software Engineering - I   (Bigbean Counter / International Technology University)
8 : Software Engineering - II   (Bigbean Counter / International Technology University)
9 : data structures   (Armando Fox / UCLA)