Question $1(1$ point$)$

Algorithms with quadratic complexity are considered practical only with small inputs

True

False

Question $2(1$ point$)$

Consider the big$-$omega notation. Which of the statements below is correct?

Big$-$omega is used to specify an upper bound on a function

Big$-$omega is used to specify a lower bound on a function

Big$-$omega is used to plot the distribution of the function's execution times

Big$-$omega is used to specify an upper and lower bound simultaneously on a function

Question $3(1$ point$)$

For each algorithm, we can define best$-,$ average$-,$ and worst$-$case complexity. Which complexity is the most important?

Average$-$case

Best$-$case

Worst$-$case