Problem-Solving Techniques Quiz

Which of the following is the first step in problem-solving?

• Algorithm design

• Problem understanding

• Code implementation

• Debugging

What is the purpose of an algorithm in problem-solving?

• To describe the problem

• To provide step-by-step instructions to solve the problem

• To test the solution

• To compile the code

Which technique is NOT used for problem-solving?

• Divide and Conquer

• Brute Force

• Time Complexity Reduction

• Dynamic Programming

What does time complexity of an algorithm measure?

• The maximum memory required

• The execution time as a function of input size

• The number of lines in the algorithm

• The correctness of the algorithm

What is space complexity?

• The amount of memory an algorithm uses

• The execution speed of an algorithm

• The length of the program

• The size of the output

Which of the following represents a time-space tradeoff?

• Using more memory to speed up computations

• Using less memory and getting faster execution time

• Reducing time complexity without changing space complexity

• Writing shorter code to save memory

What does Big-O notation represent?

• The worst-case complexity of an algorithm

• The average-case complexity of an algorithm

• The best-case complexity of an algorithm

• The space complexity of an algorithm

If an algorithm runs in O(n2), what happens if the input size doubles?

• Execution time quadruples

• Execution time doubles

• Execution time remains the same

• Execution time increases exponentially

Which of the following is NOT an asymptotic notation?

• Big-O

• Omega (Ω)

• Theta (Θ)

• Sigma (Σ)

What does Omega (Ω) notation represent?

• Best case complexity

• Worst case complexity

• Average case complexity

• Space complexity