CMSC420-0201: Lecture - Shared screen with speaker view
Good morning Dr. Mount!!!!!!
Can we throw a general exception for the methods?
Prof is there a way to turn your vol up? I can’t hear you all that clearly.
My volume bar is maxed out
That may be on your end, I can hear clearly
I can hear clearly
its fine for me
Fine for me!
Olayemi Oyindamola Ajayi
I can hear you
Kool might me then
Sorry about that
Try headphones if you aren't using them already maybe...
On zoom someone would have to manually type the captions
Kristin I like your style. Thanks !
Kamtocukwu you might already know this, but if you go to audio settings, you can turn up the speaker volume inside zoom
How come m-78 is left of o-45
it's just maintaining the heap property with respect to the numbers?
but binary tree process with respect to the letters?
Ohhh cuz its heap not binary search
when we have an imbalance, if (t) is on the left we do a right rotation, if t is on the right then we do a left rotation?
If t stays there, wouldn't it violate the property of bst, i.e. the left of t is less than t and so forth?
because you have to replace
the smaller of the left or right
can you pick one and stick to it?
Can you do a coin flip?
can you explain again how the priorities are organized?
I may have missed this during the example but what would happen in the deletion example in the rotationif b had a right child
could you explain to us the randomness of skip list one more time?
are the elements ordered?
sorted by order
I love them
For the first theorem, the proof ended with n/(n^c) = 1/n^(1-c). Isn't n/(n^c) = n^(1-c)?
Oh, sorry I read that wrong!
Confused about why it has to be consecutive heads. Wouldn’t you get the same probability/better randomness if you just selected based on total heads
if you did total heads then when would you stop flipping
oh ok I see. So the tail is just the end