Lec 2 | MIT 6.01SC Introduction to Electrical Engineering and Computer Science I, Spring 2011

Поділитися
Вставка
  • Опубліковано 12 вер 2024

КОМЕНТАРІ • 46

  • @bigollie006
    @bigollie006 6 років тому +21

    This is why I love the internet

  • @boredcrab2
    @boredcrab2 6 років тому +20

    "It's simple. We kill the batman"

  • @davemartin157
    @davemartin157 7 років тому +7

    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:
    ua-cam.com/video/WbWb0u8bJrU/v-deo.html

  • @iremkaya9103
    @iremkaya9103 7 років тому +4

    Gives me such hype when i get the questions correct :D

  • @Khan69317
    @Khan69317 9 років тому +11

    Anyone else almost tear up when he explained the recursive programming for the towers of Hanoi? So f***ing elegant.

    • @parasharjjjayant
      @parasharjjjayant 7 років тому +4

      he did not explain the algo..

    • @adambe1126
      @adambe1126 Рік тому

      Yep and I thought I was such a weirdo but glad I'm not the only one! It's just so beautiful.

  • @luiscser8703
    @luiscser8703 5 років тому +3

    this class is wonderfull and amasing, I use much of this content in developing my work

  • @jimsimon2536
    @jimsimon2536 5 років тому

    read your turing check shannon and niquist turing ultimately describes a state machine as a determanistic system

  • @jonahansen
    @jonahansen 4 роки тому

    Dennis Freeman is da man!

  • @frenchmlewis1948
    @frenchmlewis1948 11 років тому

    We need this lectures......open course ware is the best source

  • @freddyhank
    @freddyhank Рік тому +1

    We don’t need to go to another planet to find intelligent life. We need only to enroll at MIT….

  • @jimsimon2536
    @jimsimon2536 5 років тому

    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

  • @davemartin157
    @davemartin157 7 років тому +1

    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?

  • @alexandergarcia-yo6kw
    @alexandergarcia-yo6kw 3 роки тому

    I think for this case is much more intuitive the OOP aproach than function or imperative ones

  • @m.saifulislam311
    @m.saifulislam311 3 роки тому +1

    MIT Lecture on EEE 6.02 👍

  • @Fumblerful
    @Fumblerful 4 роки тому

    Why did the accumulator return two values? Did it start with 8 and step 13 then start with 13 and step with 8?

  • @oliversimpson730
    @oliversimpson730 7 років тому

    Why should you focus on procedures that minimise mathematical functions?

  • @FunsoPopoola
    @FunsoPopoola 10 років тому +1

    An awesome lecture

  • @jimsimon2536
    @jimsimon2536 5 років тому

    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

  • @prashantsingh1096
    @prashantsingh1096 3 роки тому +1

    Please recommend any book for self learner . I already have a book on Python by John Guttag .

    • @luznoceda666
      @luznoceda666 2 роки тому

      I can recommend you the app sololearn. There is a free version and not time limit. It has like five python courses.

  • @jimsimon2536
    @jimsimon2536 5 років тому

    nice shift to octal and hex . . . denny i must be wrong . . .Pascal obviates the need for oops

  • @constantegmail1804
    @constantegmail1804 7 років тому

    Increment 1 + 3
    Increment 4 + 3
    Increment 7 + 3
    square 10
    4 procedures?????

    • @iremkaya9103
      @iremkaya9103 7 років тому +1

      You add 1 by incrementing.

  • @samk8890
    @samk8890 12 років тому

    good lecture

  • @jimsimon2536
    @jimsimon2536 5 років тому

    stacks linked lists lead to trees . . . that must be the way you teach.

  • @jimsimon2536
    @jimsimon2536 5 років тому

    that separates engineers from theorists

  • @millennia
    @millennia 11 років тому +3

    ah those students don't know what treasures they're sitting upon.

  • @jimsimon2536
    @jimsimon2536 5 років тому

    the scope of the variable ie global local static etc

  • @bestofluck9766
    @bestofluck9766 6 років тому

    just Wow

  • @mrkosilathi
    @mrkosilathi 12 років тому

    MY DREAM! MY DREAM IS TO GO HERE!!!

    • @rhn6075
      @rhn6075 4 роки тому +2

      so? did you went there?

  • @forheuristiclifeksh7836
    @forheuristiclifeksh7836 6 місяців тому

    35:42

  • @jimsimon2536
    @jimsimon2536 5 років тому

    my request is speed regardless of elegance . . .which one denny?

  • @user-xw9jh5wn9i
    @user-xw9jh5wn9i 9 років тому

    good

  • @forheuristiclifeksh7836
    @forheuristiclifeksh7836 6 місяців тому

    12:05

  • @samilnaml7299
    @samilnaml7299 3 роки тому

    Nicee

  • @optimusprimum
    @optimusprimum Рік тому

    13:16

  • @midastouchpr3563
    @midastouchpr3563 3 роки тому

    I thought he was a Larry Page on the thumbnail of this video.

  • @jimsimon2536
    @jimsimon2536 5 років тому

    venn and vietch

  • @zargothraxsorcerer4867
    @zargothraxsorcerer4867 3 роки тому +2

    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.

  • @Cyraxxhole
    @Cyraxxhole Рік тому

    snooze fest