Explain the concept of dropping low$-$order terms in Big O notation.

a$.$

Dropping low$-$order terms means ignoring terms with a lower power of n in Big O notation.

b$.$

Dropping low$-$order terms means excluding terms that are not directly related to the input size.

c$.$

Dropping low$-$order terms means focusing only on the highest order term in Big O notation.

d$.$

Dropping low$-$order terms means reducing the complexity of an algorithm by removing unnecessary operations.

$25$ points

QUESTION $2$

Which case does Big O notation typically consider when analyzing an algorithm's efficiency?

a$.$

Best case scenario

b$.$

Average case scenario

c$.$

Worst case scenario

d$.$

All of the above

$25$ points

QUESTION $3$

What is Big O notation and why is it used in algorithm analysis?

a$.$

Big O notation is a mathematical model used to predict the runtime of an algorithm.

b$.$

Big O notation is a measure of the physical size of an algorithm.

c$.$

Big O notation is a programming language used to write efficient algorithms.

d$.$

Big O notation is a technique used to optimize memory usage in algorithms.

$25$ points

QUESTION $4$

What is the rule regarding constants in Big O notation?

a$.$

Constants are irrelevant in Big O notation and can be ignored.

b$.$

Constants should always be included in Big O notation for accuracy.

c$.$

Constants can be dropped from Big O notation if they are small.

d$.$

Constants have no impact on the efficiency of an algorithm.