Відео

I say approach 2, simply because it’s not organized and you could do more by unsing the interface class extending it from the shape class

Thanks ❣❣

Thank you!

Not able to understand simply not an simple concept

nice

too complicated, bad narration! dislike

Is this algo correct? Remove all self-loops Remove all parallel edges between two vertex except the one with least weight Create a table where row and column will be exactly equal to the number of vertex. Put the value of edges on the table. All diagonal elements will be 0. If no edge is exited between any two vertex, put ∞ . Select a column as a starting node, and delete its row and indicate the node as finished. Find the minimum weight from the column of the deleted nodes’ column. Delete the row of the new node and indicate as the node as finished. Repeat the process from 6-7 until finished.

Amazing explenation!!!!

Great Explaination Dear...!!

nice explanation dear brother😇

Very neat and Clean Explanation,Thanks

Top class explanation. Thank You.

Indians speaking emglish sounds very ridiculous, next time use subtitles, or remove anything below your tonge, the world will thank you.

Indians speaking english sounds very ridiculous, next time use subtitles, the world will thank you

brother i dont found short video on this topic you are good i easily understand basic concept now i`m able to attempt paper if a get this question in my finals

could have used stack. but good explanation any way.

Quick question - IF we are subtracting the learning rate X cost function from the theta does that mean in every step we are decreasing the value of theta

Jyada English mat jhad😅

why did u not use threshold

Thanks a lot

it was super useful for me thank you my friend!

Good 🎉 Explanation

all the four 64 KB locations add upto 256 KB right? Then where is the rema ining 768KB go? The total memory is 1 MB

you forgot to multiply xi in the formula for calculating new weight.

Best explanation so far.. After so many other vids I only understood your explanation.. Thank you so much..

how to do classfication for any csv data

ur a legend for this

Sir u look like triggered insaan ( nishchay). But nice teaching sir 😀

what extension do you use to which prints the error like not defined etc?

Its really good video. crispy and clear. i have one doubt. for initialization of graph every node is a infinite but travel from A ->B =2 and A -> C =4 . how you have defined this initially. ?

I think you should use a dark color arrow, because the board is white.

Post this video pdf as well to easy to save file for revision

Please also solve numericals this is waste of time

Thank you !!!

Please continue the playlist.

thank you it gives me the main core pointes of this course

explained very well 👍

This man the legend 🔥

Good

This method does not account for if the head holds the element, and leaves no room for error checking.

THIS VIDEO HAS MORE CONTENT THAN MY SEMESTER

Jesus, it was so badly executed. I needed only to refresh something and I got headache.

Great tutorials! Please make linked list doubly, circular singly and circular doubly as well.😇

Bro which book should I prefer?? For this course??

17:45 in this you have changed the value of alpha 3 to 1 but as we have the value max which is 3 ,so why change to 1?, this i thought confusing?

You could have explained it better, some sort of confusion

Can you explain what is x(j) when we are trying to find out gradient descent?

In Async who a worker thread will know that it need to wait for a task to complete and it should take up another task?

You have done an amazing work. Thanks!

Great explanation sir