BCS Software Languages

What is linear in time complexity?

• A flat horizontal line on a graph showing time to complete a function and the size of the input

• A straight, steadily rising line on a graph showing time to complete a function and the size of the input

• A curved, upward rising line on a graph showing time to complete a function and the size of the input

What is constant time in time complexity?

• A flat horizontal line on a graph showing time to complete a function and the size of the input

• A curved, upward rising line on a graph showing time to complete a function and the size of the input

• A straight, steadily rising line on a graph showing time to complete a function and the size of the input

What is quadratic time in time complexity?

• A straight, steadily rising line on a graph showing time to complete a function and the size of the input

• A curved, upward rising line on a graph showing time to complete a function and the size of the input

• A flat horizontal line on a graph showing time to complete a function and the size of the input

How to count the number of operations a function/method uses?

Count the number of ____ used.

What is time complexity?

• A way of showing how the time it takes to run a class increases as the size of the input increases

• A way of showing how different computers take different amounts of time to complete the same function

• A way of showing how the time it takes to complete a function increases as the size of the input increases

Why is counting seconds not optimal for measuring performance, and what is better to count instead?

• Different machines can take different lengths of time.

• All machines take the same length of time to complete the same function, so there is no point using this

• Counting the number of draw calls is optimal

• Counting the number of operations is optimal

What is the expression for linear time complexity?

• O(n²)

• O(n)

• O(1)

What is the expression for quadratic time complexity?

• O(n)

• O(n²)

• O(1)

What is the expression for constant time complexity?

• O(1)

• O(n)

• O(n²)

What are some of the steps to calculate the time complexity expression type to run a function from an equation?

• Count the operators (+,-,=,/,*)

• Find the fastest growing term (some terms will be constants and some will be changing parameters)

• Take out the coefficient (a constant being multiplied by a changing value)

• Take out the operators (+,-,=,/,*)