00:01
We need to state true or false over here for each statement.
00:08
So the first one is said to be false.
00:10
This statement is not a well defined statement.
00:13
It seems to be a combination of mathematical expression.
00:18
Second is true.
00:20
The expression is indeed in o n to the power 3 because it grows lower than n to the power 3.
00:27
Third is also true.
00:29
The equation grows at most quadratically and o n to the power 2 is a tighter bound.
00:38
Fourth one is said to be false.
00:41
Insertion in a haas table with changing typically takes 0, 1 time on average, but it can take longer in the worst case depending on the number of collisions.
00:54
Fifth one is said to be true.
00:56
There are known problems in np that are not in p...