Basic Quiz on Algorithmic Complexity

What is an algorithm?

• A diagram

• A type of software

• Step-by-step instructions to solve a problem

• A computer

What does time complexity tell us?

• How much memory is used

• How many steps an algorithm takes

• How fast the computer is

• How long the wires are

What does space complexity measure?

• Number of inputs

• Time taken

• Memory used by the algorithm

• Screen size

What is Big-O notation used for?

• To find battery level

• To measure memory only

• To show how fast an algorithm grows

• To make games

In Big-O, what does "n" mean?

• Number of wires

• Input size

• Output

• Error message

What is the best case?

• When algorithm takes longest time

• When algorithm takes no time

• When algorithm runs fastest

• When algorithm fails

What is the worst case?

• Slowest performance

• Fastest performance

• Average performance

• No performance

What is average case?

• Best performance

• Slowest performance

• Typical or expected performance

• Error performance

Big-O of constant time is written as:

• O(n)

• O(1)

• O(log n)

• O(n²)

Why do we study time and space complexity?

• To improve screen quality

• To play games faster

• To write efficient programs

• To increase RAM