I love the fact that professor has turned on the video in this lecture.Hope this continues in further weeks videos too....as it surely does make the lecture much more interactive. Also we missed you sir in previous week's intro and conclusion videos. And ofcourse, we do love to see the expressions of a programmer ;)
You play the video, you see another video being played inside that; you learn from the video being played then you learn from the video you played: RECURSION 😱
Learning Outcomes: 1. Modular approach. 2. Use functions to compute product of two matrices. recap: 0:292:503:30 matrix initialization: 9:2712:00 dot product: 13:5016:05 row matrix: 18:03 column matrix: 22:0023:20 multiplication of two matrices: 24:3026:4528:15 moral of the story: 33:00
The point is never to reduce the lines. If anything we can worry about reducing the complexity :-) Also, I’m coding on the fly and impromptu without considering much about the efficiency or length of the code. I personally think it helps me sync with the first timer students well.
8:50 this is not exactly what we wanted though, it creates a three-dimensional matrix here. Instead of append we should use extend here if we wish to pass [0,0,0] like that
there should not be limitations on education, it should be free to all. and it will also be helpful for beginners, who can watch this lecture as many times as they want, before register to iitm. Thanks, shailesh
I disagree with this approach, yes there are situations where making functions is useful, but making functions for the sake of making functions is not. I agree that breaking a big problem into smaller problems is the correct, but that not necessarily means we should create functions for everything. I get that he is merely giving us examples on how to use functions, I wish teacher clarified this. :) Even in the case of matrix multiplication, there should be only one function called multiply_matrix(matrix) which handles the multiplication of matrix. there is no point creating 5 different function which each have their own loops and variables. which will take more memory (in variables as well as more lines of code) and more cpu cycles to process.
IITM online degree is blessed to have this Professor
Yes, we surely are blessed to have him as our mentor.
True
Pro Tip : Watch these lectures if you are feeling asleep. You will never get bored coz of Sir's enthusiasm.
I love the fact that professor has turned on the video in this lecture.Hope this continues in further weeks videos too....as it surely does make the lecture much more interactive. Also we missed you sir in previous week's intro and conclusion videos. And ofcourse, we do love to see the expressions of a programmer ;)
Just wanted to say that Sir you explained matrix even better than we got in Maths course!
When I get bored of Maths 2, I come here to watch Sudarsan Sir's lectures. His classes are entertaining and informative.
You play the video, you see another video being played inside that; you learn from the video being played then you learn from the video you played: RECURSION 😱
Haahaaa.
You should post more jokes on recursion. That seems to be the best way to learn the otherwise not so easy topic :-)
😂
Learning Outcomes: 1. Modular approach. 2. Use functions to compute product of two matrices.
recap: 0:29 2:50 3:30
matrix initialization: 9:27 12:00
dot product: 13:50 16:05
row matrix: 18:03
column matrix: 22:00 23:20
multiplication of two matrices: 24:30 26:45 28:15
moral of the story: 33:00
Keep doing gretat initative
थैंक्यू
The way function gets exploited in this vid is 🤯
11:50 instead of using two for-i loops, we could nest the for-j loop in the first for-i loop itself after the .append([]) statement.
The point is never to reduce the lines. If anything we can worry about reducing the complexity :-)
Also, I’m coding on the fly and impromptu without considering much about the efficiency or length of the code. I personally think it helps me sync with the first timer students well.
@@sudarshaniyengar1814 yeah i get your point, i was just pointing out that this optimisation is possible if someone out there was wondering about it.
8:50 this is not exactly what we wanted though, it creates a three-dimensional matrix here. Instead of append we should use extend here if we wish to pass [0,0,0] like that
Yep. A mistake in the ipython shell, although we don’t carry forward the error in the code. Correct me.
@@sudarshaniyengar1814 yeah the actual code didn't have this error :)
Excellent lecture
just curious, why aren’t the lectures private on youtube anymore?
they used to be private in the earlier term
there should not be limitations on education,
it should be free to all.
and it will also be helpful for beginners, who can watch this lecture as many times as they want, before register to iitm.
Thanks, shailesh
I think so too!
@@shailxiitm Great point but If they have already watched the lectures why would they register for the course they already have the knowledge
@@tanishaaa.m for solving questions, getting more concept, and afterall degree
@Tanisha I believe they are public to make other 'Brands' get the sense of quality of the contents and thus setting the bars high😂
full of doubts need to rewatch and code by own multiple times
20:00 for the row() function we can simply return M[i]. wont work for column() tho :(
So true. Wanted to keep it uniform :-)
@@sudarshaniyengar1814 I thought it has something to with shallow copies of lists. Maybe you wanted to preserve the data of the original matrix.
I disagree with this approach, yes there are situations where making functions is useful, but making functions for the sake of making functions is not. I agree that breaking a big problem into smaller problems is the correct, but that not necessarily means we should create functions for everything. I get that he is merely giving us examples on how to use functions, I wish teacher clarified this. :)
Even in the case of matrix multiplication, there should be only one function called multiply_matrix(matrix) which handles the multiplication of matrix. there is no point creating 5 different function which each have their own loops and variables. which will take more memory (in variables as well as more lines of code) and more cpu cycles to process.