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

Finally a clear explanation. Thank you.

Bk be

Great explanation! 5:20 I just wonder why the cost function be (h(x)^2 - y^2) instead of (h(x) - y)^.

ı am trying to implement but ı am having some problems like sticking in a loop and not traveling all nodes in my graph

why are u make it so complex 😵‍💫

Iam Thinking to learn kotlin but im scared did i get job or not in future currently iam in 3 year of my college.... What you say or just i learn java?

you saved my life!

Worth adding here that the Opcode has: first byte which describes which kind of ADD (direction, byte or word) and the second byte which describes with registers are involved (eg BL, CL) and the addressing mode and 'displacement' for the Operand.

Just WOW!

I have a doubt in Gradient Descent, when you multiply cost function with alpha (learning rate) why does the cost function go down and not go up? eg if alpha is 1000 or 0.0001, when multiplied with J, the value of J will go up. Confused. Thanks

5:00 This is VERY BAD WORDING, WRONG, causes CONFUSION. Task 2 and 3 still take their time to complete their own task and the three tasks work parallelly with each other.

what happens if a node's adjacent nodes have all been visited but that node is not the final node in our graph ? then its going to crash ? how should we go about that ?

Thanks

very good teaching approach🪅♥

Communication really plays a wider role in teaching someone. Your teaching was so good!!!! Your explanation made all my doubts get cleared!. Thank you so much!

Thanks 💝