Algorithms MCQ

Question : Which of the following sorting algorithms has the best average-case time complexity?

Bubble Sort

Selection Sort

Merge Sort

Insertion Sort

Correct Answer :  Merge Sort

Question : What is the time complexity of the Quick Sort algorithm in the worst case?

O(n)

O(n log n)

O(n^2)

O(log n)

Correct Answer :  O(n^2)

Question : Which sorting algorithm is an example of an in-place sorting algorithm?

Merge Sort

Heap Sort

Quick Sort

Radix Sort

Correct Answer :  Quick Sort

Question : Which of the following sorting algorithms has the best space complexity?

Merge Sort

Quick Sort

Insertion Sort

Selection Sort

Correct Answer :  Merge Sort

Question : Which of the following sorting algorithms is stable?

Quick Sort

Merge Sort

Heap Sort

Selection Sort

Correct Answer :  Merge Sort

Question : Which sorting algorithm is known for its efficient performance on almost sorted arrays or small data sets?

Merge Sort

Quick Sort

Insertion Sort

Bubble Sort

Correct Answer :  Insertion Sort

Question : Which sorting algorithm is not suitable for large data sets or arrays?

Quick Sort

Merge Sort

Bubble Sort

Insertion Sort

Correct Answer :  Bubble Sort

Question : Which sorting algorithm has the best average-case time complexity among the following?

Bubble Sort

Quick Sort

Insertion Sort

Selection Sort

Correct Answer :  Quick Sort

Question : Which sorting algorithm is based on the divide and conquer strategy?

Insertion Sort

Bubble Sort

Quick Sort

Selection Sort

Correct Answer :  Quick Sort

Question : Which sorting algorithm is not comparison-based?

Merge Sort

Quick Sort

Counting Sort

Bubble Sort

Correct Answer :  Counting Sort

Question : Which sorting algorithm works by repeatedly stepping through the list, comparing each pair of adjacent items, and swapping them if they are in the wrong order?

Merge Sort

Quick Sort

Bubble Sort

Insertion Sort

Correct Answer :  Bubble Sort

Question : Which sorting algorithm is also known as a "sinking sort"?

Bubble Sort

Quick Sort

Merge Sort

Insertion Sort

Correct Answer :  Bubble Sort

Question : Which sorting algorithm uses the idea of a "pivot" element to partition the array into two sub-arrays?

Merge Sort

Quick Sort

Selection Sort

Insertion Sort

Correct Answer :  Quick Sort

Question : Which sorting algorithm is typically used for sorting small data sets or as a subroutine in other algorithms like quicksort?

Insertion Sort

Merge Sort

Heap Sort

Quick Sort

Correct Answer :  Insertion Sort

Question : Which sorting algorithm has the best worst-case time complexity among the following?

Merge Sort

Quick Sort

Bubble Sort

Selection Sort

Correct Answer :  Merge Sort

Question : Which sorting algorithm is most suitable for sorting linked lists?

Merge Sort

Quick Sort

Bubble Sort

Insertion Sort

Correct Answer :  Merge Sort

Question : Which sorting algorithm has the best performance for sorting nearly sorted arrays?

Quick Sort

Merge Sort

Insertion Sort

Bubble Sort

Correct Answer :  Insertion Sort

Question : Which sorting algorithm is based on the principle of repeatedly selecting the smallest (or largest) element from the unsorted portion of the array and moving it to its correct position in the sorted portion?

Selection Sort

Bubble Sort

Merge Sort

Insertion Sort

Correct Answer :  Selection Sort

Question : Which sorting algorithm is not inherently recursive?

Merge Sort

Quick Sort

Bubble Sort

Selection Sort

Correct Answer :  Selection Sort

Question : Which sorting algorithm has the best performance for sorting data that is already mostly sorted?

Bubble Sort

Insertion Sort

Merge Sort

Quick Sort

Correct Answer :  Insertion Sort

Question : Which searching algorithm works only on sorted arrays?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Binary Search

Question : What is the time complexity of Linear Search in the worst-case scenario?

O(1)

O(log n)

O(n)

O(n log n)

Correct Answer :  O(n)

Question : Which searching algorithm divides the search interval in half at each step?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Binary Search

Question : Which searching algorithm is typically used for searching in unsorted arrays?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Linear Search

Question : What is the time complexity of Binary Search in the worst-case scenario?

O(1)

O(log n)

O(n)

O(n log n)

Correct Answer :  O(log n)

Question : Which searching algorithm is based on the principle of dividing the search space into smaller subspaces?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Binary Search

Question : Which searching algorithm is typically used for traversing graphs?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Depth-First Search (DFS)

Question : What is the time complexity of Depth-First Search (DFS) in the worst-case scenario?

O(1)

O(log n)

O(n)

O(n log n)

Correct Answer :  O(n)

Question : Which searching algorithm is based on the principle of exploring all neighbors at the current depth level before moving on to the next level?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Breadth-First Search (BFS)

Question : What is the time complexity of Breadth-First Search (BFS) in the worst-case scenario?

O(1)

O(log n)

O(n)

O(n log n)

Correct Answer :  O(n)

Question : Which searching algorithm is used to find the shortest path in unweighted graphs?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Breadth-First Search (BFS)

Question : Which searching algorithm can be implemented using recursion?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Depth-First Search (DFS)

Question : Which searching algorithm is not suitable for searching in large data sets?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Linear Search

Question : Which searching algorithm can be used to find the presence of a target element in an array?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Linear Search

Question : Which searching algorithm is based on the principle of comparing the target value to the middle element of the array?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Binary Search

Question : Which searching algorithm is used for finding the connected components in a graph?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Depth-First Search (DFS)

Question : Which searching algorithm is based on the principle of exploring as far as possible along each branch before backtracking?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Depth-First Search (DFS)

Question : Which searching algorithm is used for finding the shortest path in weighted graphs?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Breadth-First Search (BFS)

Question : Which searching algorithm requires the elements to be sorted beforehand to guarantee correctness?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Binary Search

Question : Which searching algorithm can be used for solving maze problems?

Linear Search

Binary Search

Depth-First Search (DFS)

Breadth-First Search (BFS)

Correct Answer :  Depth-First Search (DFS)

Question : What is the time complexity of an algorithm that performs a single operation for each input element?

O(1)

O(log n)

O(n)

O(n^2)

Correct Answer :  O(n)

Question : Which notation represents the worst-case time complexity of an algorithm?

Big O (O)

Big Omega (Ω)

Big Theta (Θ)

Small O (o)

Correct Answer :  Big O (O)

Question : What does the Big O notation O(n log n) represent?

Linear time complexity

Quadratic time complexity

Logarithmic time complexity

Linearithmic time complexity

Correct Answer :  Linearithmic time complexity

Question : Which of the following factors can affect the performance of an algorithm?

Input size

Input distribution

Hardware platform

All of the above

Correct Answer :  All of the above

Question : What is the best-case time complexity of an algorithm?

The minimum time taken by the algorithm for any input

The average time taken by the algorithm for all inputs

The maximum time taken by the algorithm for any input

The time taken by the algorithm in the most common scenario

Correct Answer :  The minimum time taken by the algorithm for any input

Question : Which of the following factors is not considered in algorithm analysis?

Input size

Input distribution

Hardware platform

Software development tools

Correct Answer :  Software development tools

Question : What is the time complexity of an algorithm that executes a constant number of operations, regardless of the input size?

O(1)

O(log n)

O(n)

O(n^2)

Correct Answer :  O(1)

Question : Which of the following notations represents the lower bound of an algorithm's time complexity?

Big O (O)

Big Omega (Ω)

Big Theta (Θ)

Small O (o)

Correct Answer :  Big Omega (Ω)

Question : What is the space complexity of an algorithm?

The amount of memory required by the algorithm to run

The number of operations performed by the algorithm

The number of input elements processed by the algorithm

The time taken by the algorithm to execute

Correct Answer :  The amount of memory required by the algorithm to run

Question : Which of the following time complexities represents the fastest-growing rate?

O(log n)

O(n)

O(n^2)

O(2^n)

Correct Answer :  O(2^n)

Question : What is the time complexity of an algorithm that performs nested loops, each iterating up to 'n' times?

O(1)

O(log n)

O(n)

O(n^2)

Correct Answer :  O(n^2)

Question : Which of the following notations represents both the upper and lower bounds of an algorithm's time complexity?

Big O (O)

Big Omega (Ω)

Big Theta (Θ)

Small O (o)

Correct Answer :  Big Theta (Θ)

Question : What is the time complexity of an algorithm that divides the input size by a constant factor at each step?

O(1)

O(log n)

O(n)

O(n^2)

Correct Answer :  O(log n)

Question : Which of the following is not a common method for analyzing algorithm complexity?

Asymptotic analysis

Experimental analysis

Average-case analysis

Worst-case analysis

Correct Answer :  Experimental analysis

Question : What is the time complexity of an algorithm that performs a linear search through an unsorted array?

O(1)

O(log n)

O(n)

O(n^2)

Correct Answer :  O(n)

Question : What is the time complexity of an algorithm that sorts an array using the Bubble Sort technique?

O(1)

O(log n)

O(n)

O(n^2)

Correct Answer :  O(n^2)

Question : Which of the following notations represents the upper bound of an algorithm's time complexity?

Big O (O)

Big Omega (Ω)

Big Theta (Θ)

Small O (o)

Correct Answer :  Big O (O)

Question : What is the time complexity of an algorithm that performs a binary search through a sorted array?

O(1)

O(log n)

O(n)

O(n^2)

Correct Answer :  O(log n)

Question : What is the time complexity of an algorithm that performs a selection sort on an array of size 'n'?

O(1)

O(log n)

O(n)

O(n^2)

Correct Answer :  O(n^2)

Question : Which of the following notations represents the average-case time complexity of an algorithm?

Big O (O)

Big Omega (Ω)

Big Theta (Θ)

Small O (o)

Correct Answer :  Big Theta (Θ)

Question : What is dynamic programming?

A programming paradigm used for developing dynamic websites.

A programming technique used to solve problems by breaking them down into simpler subproblems.

A programming language specifically designed for solving mathematical optimization problems.

A type of programming that focuses on dynamic memory allocation.

Correct Answer :  A programming technique used to solve problems by breaking them down into simpler subproblems.

Question : Which of the following is a characteristic of dynamic programming?

It always involves recursion.

It relies on memoization to store solutions to subproblems.

It only works for problems with overlapping subproblems.

It does not handle optimization problems.

Correct Answer :  It relies on memoization to store solutions to subproblems.

Question : What is memoization in the context of dynamic programming?

Storing the solutions to subproblems so that they do not need to be recomputed.

A process of generating random solutions to subproblems.

Dividing a problem into smaller subproblems.

Solving a problem iteratively rather than recursively.

Correct Answer :  Storing the solutions to subproblems so that they do not need to be recomputed.

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

Sorting a list of integers.

Finding the shortest path in a graph.

Finding the maximum sum subarray.

Calculating the factorial of a number.

Correct Answer :  Finding the maximum sum subarray.

Question : What is the main idea behind dynamic programming?

Breaking down a problem into smaller subproblems and solving each subproblem only once.

Breaking down a problem into smaller subproblems and solving each subproblem multiple times.

Solving a problem directly without considering its subproblems.

Using recursion to solve a problem without considering its subproblems.

Correct Answer :  Breaking down a problem into smaller subproblems and solving each subproblem only once.

Question : Which of the following algorithms is not an example of dynamic programming?

Fibonacci sequence using recursion.

Knapsack problem.

Bellman-Ford algorithm for shortest paths.

Breadth-First Search (BFS).

Correct Answer :  Breadth-First Search (BFS).

Question : In dynamic programming, what is the purpose of solving smaller subproblems?

To find the optimal solution to the original problem.

To divide the problem into manageable chunks.

To minimize the time complexity of the algorithm.

To maximize the space complexity of the algorithm.

Correct Answer :  To find the optimal solution to the original problem.

Question : Which of the following is not a step in solving a problem using dynamic programming?

Memoization.

Solving the original problem.

Breaking the problem down into smaller subproblems.

Storing all possible solutions in a lookup table.

Correct Answer :  Storing all possible solutions in a lookup table.

Question : What is the time complexity of a dynamic programming solution to a problem with 'n' subproblems, each taking 'O(k)' time to solve?

O(k)

O(n)

O(n log n)

O(nk)

Correct Answer :  O(n)

Question : Which of the following is a drawback of dynamic programming?

It is difficult to implement.

It requires a large amount of memory.

It cannot handle problems with overlapping subproblems.

It may not always be the most efficient solution for a problem.

Correct Answer :  It may not always be the most efficient solution for a problem.