FUNDAMENTALS OF ALGORITHMS - UNIT 1 MCQS

What is an algorithm?

• A random guess about a problem.

• An algorithm is a step-by-step procedure for solving a problem.

• A collection of data points without a process.

• A recipe for cooking a meal.

Explain the purpose of pseudo code.

• To replace the need for actual coding in software development.

• The purpose of pseudo code is to outline algorithms in a simplified, human-readable format that focuses on logic rather than syntax.

• To provide a detailed programming language syntax guide.

• To serve as a final implementation of the code.

Define time complexity and its importance.

• Time complexity is only relevant for sorting algorithms.

• Time complexity measures the space an algorithm uses regardless of input size.

• Time complexity is a measure of how many lines of code an algorithm has.

• Time complexity is a measure of the time an algorithm takes to run as a function of the input size, and it is important for evaluating and comparing the efficiency of algorithms.

What is space complexity?

• Space complexity is the number of steps an algorithm takes to complete.

• Space complexity refers to the speed of an algorithm.

• Space complexity only considers the input size of an algorithm.

• Space complexity is the total amount of memory space required by an algorithm, including both input and auxiliary space.

Describe Big O notation with an example.

• Big O notation is a method to calculate the exact runtime of an algorithm, such as O(n!) for factorial time complexity.

• Big O notation is a way to express the time complexity of an algorithm, such as O(n^2) for a quadratic time complexity.

• Big O notation measures the space complexity of an algorithm, such as O(1) for constant space complexity.

• Big O notation is used to describe the average case performance of an algorithm, like O(n) for linear time complexity.

What does Omega notation represent?

• Omega notation represents a lower bound on the growth rate of a function.

• Omega notation indicates the exact growth rate of a function.

• Omega notation is used to describe the average case performance of an algorithm.

• Omega notation represents an upper bound on the growth rate of a function.

Explain Theta notation and its significance.

• Theta notation indicates that a function grows faster than another function.

• Theta notation provides a tight bound on the growth rate of functions, indicating that a function grows at the same rate as another function.

• Theta notation only describes the upper bound of a function's growth rate.

• Theta notation is used exclusively for sorting algorithms.

What is Little o notation?

• Little o notation is denoted as f(x) = o(g(x)) if for every positive constant ε, there exists a constant M such that |f(x)| < ε|g(x)| for all x > M.

• Little o notation indicates that f(x) grows faster than g(x).

• Little o notation is used to describe the upper bound of a function.

• Little o notation is a method for calculating limits in calculus.

How do you measure the performance of an algorithm?

• Based on the programming language used

• Through user satisfaction ratings

• By the number of lines of code written

• Performance of an algorithm is measured by its time complexity, space complexity, and empirical execution metrics.

What are randomized algorithms?

• Algorithms that always produce the same output regardless of input.

• Algorithms that require no randomness to function effectively.

• Algorithms that are only used for sorting data.

• Randomized algorithms are algorithms that incorporate randomness to improve performance or simplify problem-solving.