Lec 2 | MIT 6.01SC Introduction to Electrical Engineering and Computer Science I, Spring 2011
2012 ж. 12 Қаң.
110 370 Рет қаралды
Lecture 2: Primitives, Combination, Abstraction, and Patterns
Instructor: Dennis Freeman
View the complete course: ocw.mit.edu/6-01SCS11
License: Creative Commons BY-NC-SA
More information at ocw.mit.edu/terms
More courses at ocw.mit.edu
This is why I love the internet
"It's simple. We kill the batman"
Gives me such hype when i get the questions correct :D
If you are like me and can't understand the recursive code for the Tower of Hanoi recursion, an explanation is given in much more detail by Eric Grimson in a MIT OCW lecture for 6.00SC: kzhead.info/sun/isaQkpStb5SApY0/bejne.html
We need this lectures......open course ware is the best source
read your turing check shannon and niquist turing ultimately describes a state machine as a determanistic system
An awesome lecture
Dennis Freeman is da man!
this class is wonderfull and amasing, I use much of this content in developing my work
amasing? lol
I think for this case is much more intuitive the OOP aproach than function or imperative ones
Anyone else almost tear up when he explained the recursive programming for the towers of Hanoi? So f***ing elegant.
he did not explain the algo..
Yep and I thought I was such a weirdo but glad I'm not the only one! It's just so beautiful.
Where can I find an example of a transduce method implementing the done function from a terminating state machine written in python as hinted at in the course reading?
good lecture
the part you continue not to describe is the fact that a destination is there . . . does the destination provide input or does the command system make the destination implicit ie the destination is under water and the robot does not have flippers . . . hold your breath
Why did the accumulator return two values? Did it start with 8 and step 13 then start with 13 and step with 8?
Why should you focus on procedures that minimise mathematical functions?
We don’t need to go to another planet to find intelligent life. We need only to enroll at MIT….
just Wow
MIT Lecture on EEE 6.02 👍
nice shift to octal and hex . . . denny i must be wrong . . .Pascal obviates the need for oops
the scope of the variable ie global local static etc
fibannacci markov stochiastic and asymtopes series they are math structures that are a part but math such as recursion is not appropriate. at the end of the day how much money do you want to spend with what probability of success
good
Please recommend any book for self learner . I already have a book on Python by John Guttag .
I can recommend you the app sololearn. There is a free version and not time limit. It has like five python courses.
Nicee
stacks linked lists lead to trees . . . that must be the way you teach.
MY DREAM! MY DREAM IS TO GO HERE!!!
so? did you went there?
that separates engineers from theorists
Increment 1 + 3 Increment 4 + 3 Increment 7 + 3 square 10 4 procedures?????
You add 1 by incrementing.
ah those students don't know what treasures they're sitting upon.
my request is speed regardless of elegance . . .which one denny?
35:42
I thought he was a Larry Page on the thumbnail of this video.
12:05
venn and vietch
ridiculous lecture. said nothing about real program building. they jump directly to problem solving, at the time where many people don't even understand modular instructions of Programming Language. time wasted.
snooze fest
13:16