Zoom Logo

CMSC420-0201: Lecture - Shared screen with speaker view
Bailey Fokin
09:17
when will grades be released for the HW?
Bailey Fokin
12:20
say our rational was not as good but we got the right answer, will we still get points for the questions?
William Cao
13:40
lag
Bailey Fokin
19:22
would it also work if you hadp!= q.left?
Bailey Fokin
19:45
instead of p == q.right
Samantha Tang
20:04
If our programs were not as simple, but did follow the same intuition, would we be eligible for the full points?
Bailey Fokin
28:09
is it still possible to be correct if the equation for f(c) doesn't take that form?
William Cao
28:33
I it simplifies?
William Cao
29:06
if*
Bailey Fokin
30:48
Yeah, I meant algebraically equiv. Thank goodness mine simplifies to that lol
William Cao
31:09
For the challenge question did we have to prove O(n)?
Bailey Fokin
31:55
when watching youtube videos introduces you to the tortoise and hare alg during the summer
Bailey Fokin
33:46
https://www.youtube.com/watch?v=pKO9UjSeLew
Russell William Schwartz
34:21
^^^
Bailey Fokin
34:28
the video was finding dup numbers in a list of numbers and they used t and hare alg to solve it
William Cao
35:56
Floyd's cycle finding algo
Bailey Fokin
42:42
Ill grading be based just on junit testing? will there be release/secret tests?
Kamtochukwu Okafor
43:19
Why are we storing a k,v pair in the in the ext node ?
Bailey Fokin
44:51
I am assuming since we are doing java, we have to use camel case rather than snake case :"(
Kamtochukwu Okafor
44:52
External
Hyen Jeong
52:50
and this extended bst does not balance itself right?
Shameer Shahab
53:07
Were the splitter values random
Sonya Rumenova Radichkova
54:33
Are you creating a new splitter value for every insertion of a key value pair?
James Brunner
58:27
Is a structure like this ever used in industry? Im having trouble thinking of a scenario when this would have a significant advantage over a regular BST
Neehar Peri
58:59
Can you think of an extended binary search tree as a way to implement a decision tree?
James Brunner
01:01:02
Thank you so much that makes sense :)
James Brunner
01:01:14
<3 <3
Sonya Rumenova Radichkova
01:03:23
Shouldn’t it not be x since the x is not on the left
Sonya Rumenova Radichkova
01:03:30
Is on the left**
William Cao
01:03:37
no
William Cao
01:03:42
left is <
Sonya Rumenova Radichkova
01:03:53
Shouldn’t it be y
William Cao
01:04:20
or x+1
William Cao
01:04:29
because that's faster then accessing y
Sonya Rumenova Radichkova
01:05:21
If you said there’s a new splitter for every insertion, shouldn’t we assume that there already was a y splitter
Hyen Jeong
01:20:58
in "root.insert(x)", .insert method is coming from XBSTree class or Node classes
Hyen Jeong
01:20:59
?
John Heide
01:21:22
I think node
Samantha Tang
01:22:06
How much time would you expect we would have for the project? Like a week?
Bin Zheng
01:22:09
thank you!
Sahil Dev
01:22:09
Thank you!