3. Graph-theoretic Models
Вставка
- Опубліковано 14 жов 2024
- MIT 6.0002 Introduction to Computational Thinking and Data Science, Fall 2016
View the complete course: ocw.mit.edu/6-0...
Instructor: Eric Grimson
Prof. Grimson discusses graph models and depth-first and breadth-first search algorithms.
License: Creative Commons BY-NC-SA
More information at ocw.mit.edu/terms
More courses at ocw.mit.edu
His students didn't give this guy enough love for his jokes, he's hilarious
he is miced up, we cant hear if they laugh.
ua-cam.com/video/jqWt49o7R-k/v-deo.html&ab_channel=groonfaloon
He has been the Chancellor of MIT
So they might be a but nervous to disturb him in any way or just conscious
Australian trees :-)
This has nothing to do with them being nervous or the lecturer using a mic, because when I started computer science in 2013 in a university, I was a mature student over 10 years older than most of the class and I saw fist hand that most didn't have a sense of humour or simply get most of the jokes. Even for the brightest of students, the jokes would go straight over their heads. Sometimes it would of been just me and the lecturer laughing at something he said, because the joke was like a dad joke but was too much for the class. Many students were like introverts so was always a tough crowd to please. Even myself when trying to have a bit of fun with some of the class, it was incredible to see what could annoy them and I'd have to explain the joke to them because they would easily take offence to things. Even more hilarious was as quiet as many the class were, I was surprised how many would happily take ecstasy on a weekly basis lol.
This is amongst the more fascinating diamonds in the massive UA-cam rough. While not fully comparable to attending, lectures from the likes of MIT & such for free are quite worthwhile! Thank you and great content
Points connected by lines.
35:10 Depth-first search.
43:15 Breadth-first search.
Adding a little humor in lectures just takes it to next level
Helps when an assignment is due and you havn't attended any lectures. Thanks!
Amazing lecture. This one and the earlier are pieces of excellent work and the reason why MIT has been recognized for doing it so well. But the explanations about the implementations of the algorithms are a bit faster than my ability to grasp them. Above all, MIT continues to be a reference in teaching.
Does anyone grasp it this fast? I mean people who are this new to programming and the python language. Do they get it that fast?
I find myself having to pause the video and view the lecture slides to piece it together. I haven't developed the nerd's eye yet (nerd's eye = ability to read & understand code at the pace you would interpret a passage normally).
If I'm not mistaken, this is, for the majority sitting in that classroom (correct me if I'm wrong) the second course they have ever taken in programming. I've learnt, to some degree, OOP in C++ in school, but shit, not this fast! How do the students handle there?
MIT for a reason I guess...
@@erinsam7821 I doubt all the students there understood everything taught during the lecture. They probably have access to the recorded lectures which they can watch to recap.
@@erinsam7821 I think they have recitation class, in addition to lecture, where grad students give you more detailed examples and answer questions. Some OCW classes have those video's as well. Or I know there is one for Python for Harvard CS 50, ua-cam.com/video/mvlTSMUNQN4/v-deo.html
There's only one way practice. Listen to the lecture go to your machine and try to do yourself. Whenever a doubt arises return to video and clarify
In addition to what has been said in the other comments, there is also the relevant reading from the textbook for each lecture. I assume the students are supposed to read that before the lecture, to help them grasp the material.
*My takeaways:*
1. What is a graph 2:30
2. Coding examples 12:41
The most interesting lecture I've come across so far
Thank you MIT! Eric is an excellent instructor!!
No loops in your family trees XD
@@BenedictChen or if you are a European Royal.
Hi, amazing lectures. I have one suggestion for future recordings, especially for something code heavy: if we could be showing the slides longer than showing the professor talking most of the times, it would be much more helpful. Thank you for considering.
Hi Tong Wu, the slides for the course are available here. I like to go through them myself while running the video in the background. Hope it helps.
ocw.mit.edu/courses/electrical-engineering-and-computer-science/6-0002-introduction-to-computational-thinking-and-data-science-fall-2016/lecture-slides-and-files/
@@swellapplespice thank you for sharing info.
Thank you MIT
He is the architect of the Matrix
you made my day XD lol
40% of the thumbnails for this course are the professors opening their arms widely
That was definitely a optimized observation :)
.26_
Are they all called Temba?
Thanks Prof. Grimson and MIT.
Can you put the courses into one serie? They are amazing and I'm having difficulties to find the all. Thanks
Here is the 6.0002 playlist: ua-cam.com/play/PLUl4u3cNGP619EG1wp0kT-7rDE_Az5TNd.html. Best wishes on your studies!
Best course yet! Love this professor!
Awesome lecture! Thank you MIT!
I think at 29:00 it should say, "anything that works for a graph will also work for a digraph", not the other way round.
No, technically all graphs are digraphs(in reality, not in our program), so a (client) program written for a digraph will work for a graph, but if a program is written for a graph it assumes that there is no directionality associated with edges, i.e., they go both ways, this is not true for a digraph.
Eric's killing it again!
Theres one issue with the code that is given. Nowhere in the lecture notes or in the video defines the printPath() function. Also how does he print out in that format when the only way to do it is by calling on the Edge class method to print? especially when he is appending nodes and not edges. I am guessing it is done in the printPath() function
What a wonderful piece of art!
But may I ask how far should I be aware of Python in order to fully understand the code?
Yes, basic Python is required for this course (6.0001 Introduction to Computer Science and Programming in Python). See the course on MIT OpenCourseWare for more info at: ocw.mit.edu/6-0002F16. Best wishes on your studies!
Actually the DFS function doesn't return the shortest path at the end, just saying.
it's can help me a lot to connect algorithm and python
7:20 Australian trees lmao
A bit silly to define a __str__ method for an Edge class then instead of using it in __str__ of the Digraph class, they just repeat the same logic instead of printing the Edge instance and appending it to the result.
great lecture regardless, what an awesome teacher.
Andrew Crews how come. They can prevent accidental side affects
@Andrew Crews Also Key in Dictionary works, instead of looping over each key name and testing its equality.
Excellent lecture, but tough crowd.
Have I missed something or he didn't defined printPath anywhere?
what a great course this is awsome :D
Amazing content
Shouldn't there be an "or" instead of "and" at 24.33 in the last third line of code? Even if one is missing, we shouldn't be able to add an edge.
When we negate "and" it becomes "or". not(source and desnation) is the same as not source or not destination.
Why they are not showing the transit example?
Dalam Graph bentuk Tree,tidak diperbolehkan adanya loop atau circuit
mengapa pada contoh tree yang disajikan memiliki loop ?
thanks,mit
I need more courses
no need to inherit from 'object' class in python 3
love this !
"We leave this is an easy exercise for the reader". LOL
I wish data science could show me how to study more efficiently
32:57 I am getting a NameError in the code. Anyone else too getting error?
I’m getting the error too. Have you found out why?
REALLY bad camera work - barely ever shows his slides.
There are slides on the site. You should prepare them on hand while watching videos.
print screen helps
Read the description.
6:59
20:52
my family tree has cycles
33:16
9:33
Preposterous to think that anyone would be friends with someone who went to Stanford.
Not dry enough
Thank you , but can anyone give me the github link of this code?
Any materials we have for the course are available for free on MIT OpenCourseWare at: ocw.mit.edu/6-0002F16.
I drop my knee on the ground
"After November 8th, I might really want to take an European vacation. " Hmm... he saw it coming. Better listen to the scientists, POTUS.
Teacher looks like narendra modi
I need video translate into Arabic Please
Looks more like a New Zealand tree to me.
Why do you upload course for free?
About MIT OpenCourseWare: ua-cam.com/video/XUM4lLbG5UY/v-deo.html
Did you move to Europe? HAHAHAHA
Is this guy talking about poop?
The hard-to-find craftsman preferentially wish because jet individually scatter through a ten innocent. woebegone, handsome billboard
27:25
29:31
25:27