What is the primary purpose of an algorithm?

• To visualize data

• To analyze data structures

• To store data efficiently

• To provide a sequence of computational steps

Which of the following is a method for analyzing the performance of an algorithm?

• Time complexity

• Data validation

• Memory allocation

• Input processing

What does Big O notation represent?

• Exact complexity of an algorithm

• Lower bound of an algorithm's complexity

• Average case complexity

• Upper bound of an algorithm's complexity

Which algorithm is an example of the divide and conquer strategy?

• Merge Sort

• Insertion Sort

• Selection Sort

• Bubble Sort

What is the time complexity of the Quick Sort algorithm in the average case?

• O(log n)

• O(n log n)

• O(n^2)

• O(n)

Which of the following problems can be solved using dynamic programming?

• Graph Coloring

• Depth First Search

• Binary Search

• Knapsack Problem

What is the main characteristic of NP-Hard problems?

• They cannot be solved in polynomial time

• They can be solved in polynomial time

• They have a known solution

• They are easy to solve

In which algorithm is the 8 Queens Problem typically solved?

• Backtracking

• Dynamic Programming

• Branch and Bound

• Greedy Method

What is the primary goal of performance analysis in algorithms?

• To write code efficiently

• To determine time and space complexity

• To debug programs

• To visualize data structures

Which of the following notations indicates that a function grows slower than another?

• Little o notation

• Omega notation

• Theta notation

• Big O notation