CC104 - Midterm Exam (Week 9)

What is an algorithm?

• A flowchart

• A step-by-step procedure to solve a problem

• A set of programming rules

• A type of variable

Which of the following is NOT a property of an algorithm?

• Finiteness

• Definability

• Input/output

• Ambiguity

An algorithm must always produce:

• Infinite steps

• An output

• Multiple solutions

• A program

What is the time complexity of an algorithm that has to check all elements in an array?

• O(1)

• O(log n)

• O(n)

• O(n^2)

Space complexity is concerned with:

• The time it takes to run the program

• The memory used by the program

• The speed of execution

• The number of variables

What does O(1) time complexity mean?

• Constant time

• Linear time

• Exponential time

• Quadratic time

Which of the following is an example of asymptotic notation?

• O(n)

• n=100

• log(n)

• n^2+2n

Time complexity measures:

• The size of the code

• The running time of an algorithm

• The amount of memory used

• The efficiency of the compiler

Which of these algorithms has the best time complexity?

• O(n^2)

• O(n log n)

• O(log n)

• O(2^n)

What is the purpose of Big O notation?

• To measure the memory usage

• To describe the performance of an algorithm

• To explain program syntax

• To design flowcharts