Added: 3 years ago
From: MIT
Views: 95,583
Sort by time | Sort by thread (beta)

Link to this comment:

Share to:

All Comments (78)

Sign In or Sign Up now to post a comment!
  • PHD at 20 years old WTF!!!

  • Greatly indebted to his Advanced Data Structure course for my summer work. This is though trivial stuff - yet I am amazed few people find it fast.

  • Demaine was a child prodigy.[2] He entered Dalhousie University in Canada at the age of 12, completed his bachelor's degree when only 14 and completed his PhD when only 20 years old.

    My face when...

  • i didn't understand single piece of info from this " Prof " :(

  • if you don't like lecturer. you are always welcome to open book and to try to understand by yourself independently. I don't understand your problem

  • Comment removed

  • okay so what do i need to know in order to fully get what he's saying ?

  • @ayyashC If you want to fully understand this course you need basic math (calculus) and probability. Also you should have some basic programming skills. And as always in such courses you have to solve the exercises yourself.

  • Yeah i agree with you people. He's kind of fast not explaining the details of the content. particularly we are not mathematics students.

  • At 31:00 closed captioning says "(laughter)"....deaf people: you are being lied to.

  • I am from the UK and a software engineering student at a London university. I hate people like this lecturer because once they get going they dont realize that we are students and here because we dont know this stuff, i am not really talking about him because i dont have a right, but he falls in that category as many of my professors.

  • @yamaasmaye I can't agree more with you!

  • I'll admit I feel stupid for not being able to follow this. It might (does) have something to do with me not knowing much of the vocabulary he's using. It's still a month til I enter uni though and I am quite confident I'll get it by the time I actually need it.

  • @narutofan9999

    Sure it is not easy to follow this when you never heard a math lecture before. But when you do your classes in the right order and start with the easy stuff, everything is understandable when you are willing to invest an appropriate amount of work. So dont worry !

  • Comment removed

  • its so nice to have these videos n its lyk i m in class...he might b a little fast but u can always pause to understand d stuff!!!!

    i m loving it

  • I love that Googling "Erik Demaine" has the Geico caveman in the first result

  • Comment removed

  • Comment removed

  • loving it

    

  • American comments on basic math are just adorable

  • actual lecture begins at 1:10:31

  • why black board ? xD

  • Erik is good and seems he has good understanding of concepts. Surely it will take time for him to be more effective.

  • Glad MIT has the OpenCourseWare and this guy is very intelligent but he seemed rushed and nervous or short of breath most of the time which made it hard to follow him.

  • I kinda got bored watching this, he repeated himself over and over again :( 

  • Dear MIT students, why are you unable to follow such a simple lecture. Also, read your textbook before class!

  • as an EE student I had to take a couple of programming courses and im done with my basic math courses (upto differentials and linear algebra). I scored 95% and up in all my programming classes and i thought i was a good programmer. But after staring at this lecture blankly I figured out I am just not that good. I bet the MIT students felt the same way. Otherwise they are in a whole different level..

  • what kind of prerequisites do u need to understand this?????

  • @holyvincent420 algebra? Discrete math, and even some calculus (asymptotic). Also, having some experience with programming will get you father.

  • @TheMaltodexter well i have some programming experience........

    but nothing in maths...

    will it b enough....

  • The bald guy is better than this Erik Demaine

  • @Waranle the "bald guy" wrote the textbook that is most widely used to teach algorithms. He is the L in CLRS Into to Algorithms

  • @Waranle the "bald guy" wrote the textbook that is most widely used to teach algorithms. He is the L in CLRS Intro to Algorithms

  • @Waranle you think so because you dont understand advanced math, you prob think your highschool teacher who learned you how to deal with secondgrade solutions (that you didnt understand what you were doing, you just following algotrits , what this lection is actually about.

  • @Huxflux22 lection? let help your dumb ass the word is actually "lecture" and wait you still doing Calculus löl Shut the fuck up stupid kid

  • If anyone is interested in asymptotic analysis and is at the beginning of wrapping their mind around it, watch this UCBerkeley lecture first .youtube.com/watch?v=ca3e7UVme­Uc.

  • Nice shirt, Erik Demaine.

  • When I watch your lectures with the lecture notes it becomes much easier. Thank you mit.

  • I'm really looking forward to when they re-record these lectures in HD.

  • @BeIwantTo This is MIT not preschool, there is too much material covered for hand holding. If you want something more thorough get the book. If you don't understand what he's saying then take advice of Lecture 1; PREREQUISITES.

  • @BeIwantTo Completely agree with your comment.

    Unfortunately, this is the way most university lecturers in the world,

    show-off their knowledge. They have zero ability in teaching.

    I wonder, what are the benifits of getting help from a teacher (lecturer),

    compared to referring text books and internet containing same material.

  • @fonsidream Well reading book you go yourself with your own speed, watching video you follow with lecturer's speed. It's cool together.

    By the way if it's too fast you can always pause / go back. If it's too slow it would be harder - you can miss something important.

    As for me I found some his points / summarizations really nicely presented.

  • But, I have to add that he's looking really excited to what he's doing, and this is very nice

  • this guy is teaching in fast forword. he doesn't even give a second for students to ask something. i think he discourages undergraduates

  • @interted Honestly, MIT students in that class must be either

    exceptionally good to follow him or just dumb not to protest him to

    explain in a general presentable manner.

    He made me angry for wasting my time. If I see him on road, I will kick is balls off. No kidding!

  • @fonsidream

    we follow him, it is the top program in the world

  • @fonsidream

    we follow him because we read the material before lectures. btw, it is the top program in the world

  • @fonsidream

    In his defense, for a lot of MIT students, they've seen this before. You learn this in 6.046's prereqs, 6.042 and 6.006

  • @loginname8374 I wouldn't give them so much credit. They sat silent for a while on the "arithmetic series" question, which is pre-pre-calculus

  • @fonsidream You, sir, are retarded. This is completely trivial stuff and -what a suprise- MIT students are expected to be smart, maybe?? You dumb redneck

  • Erik Demaine is the youngest professor in the history of the MIT! He became professor at MIT at 20! Wow!

  • Comment removed

  • @exceptionhandling

    Is he teaching or just in a race of writing? Fooh! Take a deep breath!

    I suggest him to take more interest on learning about his studentes, before teaching them.

    He can consume time, with the help of some slides and projector. I guess, MIT can afford a bit of technology to improve the quality of lectures.

  • @exceptionhandling

    wow, that's impressive. But I like Charles more

  • Comment removed

  • the microphone was too close....

  • I think his teaching ability is pretty good. His lecture lines up well with the class I'm currently in, so I don't find it too difficult to follow where he's going with everything...

  • man that guy seems nervous.

  • Shouldn't it be 2n^2 = O(n^2)? Because if you choose c = 2, then you get 2n^2 <= 2 * n^2.

  • 2n^2 = O(n^3) AND

    2n^2 = O(n^2) AND

    2n^2 = O(n!) AND ...

    When big O notation is used, function f(x) is not necessarily tightly bounded.

  • @DBaltrus Yes, it is true that there is point, from which n! and n^3 is always more than n^2, so all statements are true. But n^2 is more accurate, for example when you are comparing 2 algorithms with O(n^2) and O(n^3) you know which is cheaper. Otherwise you could use same quickly rising function, like 2^n, on every algorithm.

  • i am lovin it !!!!!!!!

  • Thanks MIT for all of your old college INTRO courses, yes this is great material. Lol.

  • Comment removed

  • 2n^2 = O(n^3)

    it makes all the difference

  • ty for making this available.. I slept through most of this material when I was a student in the UK. But then its not rocket science hey. Always great to have a recap.

  • Is he a good professor?

  • buena idea

Loading...
Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more