Видео

doesnt the degree of the tree represent the # of keys in the node rather than the child pointers. # of keys min (d - 1) and max 2 * d - 1

Note: the term "bit stable" used in the video should actually be "bi-stable"

Around 5:13 the expansion of 5.32 * 10^30 is missing two zeroes at the end. As stated, there should be 31 total digits in the result: 5,320,000,000,000,000,000,000,000,000,000

thanks man

Beautiful explanation!

Thank you for your clear explanation! I have a dumb question how do you make sure that both the receiver and the sender know the CRC pattern? because if you send that too it might get affected from errors no? Thank you a lot in advance!

👍

Still dont get the math, but I know enough to BS this essay.

What type of encoding is used by computer network cards sending a signal through Ethernet cabling?

wait. Wouldn't be more simple to just use bool instead of this????

Thank you so much, hope I can use this on the exam I have tomorrow!

amazing video! would recommend to have a short summary of admissibility and consistency at end though, to better recap what was learned

huh???

Loved my logic couse at school, so much Prolog as well as Python.

Thank you very much

its not pie its pi like pee not fie light fight its fee

Pretty cool demonstration of a 4-Bit parallel shift register. Nice touch with the Load signal enable switch. Other videos don't cover that kind of stuff until much later.

Thank you ... This is by far the best tutorial video which clearly explain placement algorithm

still helping students in 2024, thanks man

what software did you use for these diagram?

Lets get lost tonight, you could be my black Kate Moss tonight, play secretary I'm the boss tonight, and you don't give a f*ck what they all say right. 😂

ESI

thank you

Thank you for the explanation!!

Thank you so much sir. You've covered all topics in just 10 minutes. Thank you So Much. I am grateful to you

Thank you professor

Thanks for nice explanation. I have doubt about if both CPUs issue write request to the same data location, then how it is resolved? As it seems to be the race condition then do I need to synchronize this scenario or what?

awesome 👏

really good explanations

Thank you. Thank you. Thank you. Evrythign just makes sense now.

Very helpful. Thank you!

After 8 years, It's still on point!

I missed this lecture and was totally clueless when we had to manually calculate a frame check sequence. This is exactly what I needed, and probably explained more clearly than the professor too! Thank you

When CPU 1 performs the Read operation will it fetch the new data which is modified by CPU 2 or it will get the old data that was there before CPU 2 modified it?

University of Limpopo was here 🔥🔥🔥2014

❤❤❤❤❤❤❤

In Invalid state, does modified cache update the memory or it will just update the another shared cache?

work ip address

Teach at Penn State. Please. COMENG 362 needs you brother

Thank you sir

Here is the values for the parameters in the equation, for who still cannot link up the action demonstration and the equation: 7:08 Given: gamma = 1, alpha = 0.5, The cost refers to r_action = -0.04 Let s = (bottom left corner) denoted as [[0,0,0,0], [0,0,0,0], [1,0,0,0]) (as long as you can identify the location) a = UP Q(bottom left, , UP) = 0 + 0.5(-0.04 + 1*0 -0) = -0.02

I'm so glad I found your channel. Thanks for sharing

perfect explanation .thanks mate

im cooked

This is the best video on the topic, thank you! I finally understood it:)

Great!

I love the song choices lol

I've seen a lot of cache videos, but none of them explained how the tags worked. This is the first video that very clearly explains direct mapping. Thanks!

how do you know what addressing mode is being used in binary code

Thank you so much.