ADA QUIZZZZZ 2nd Time

1. 1 What does time complexity measure in an algorithm?

• A . Number of operations executed

• B . Amount of memory used

• C . Number of lines of code

• D . Input size

2 Which of the following best describes space complexity?

• A . The amount of time an algorithm takes to run

• B . The amount of memory an algorithm requires to execute

• C . The number of inputs an algorithm can handle

• D . The number of times an algorithm loops

3 Quick sort is an example of a sorting algorithm based on which strategy?

• A . Dynamic programming

• B . Greedy approach

• C . Divide and conquer

• D . Backtracking

4 What is the worst-case time complexity of quick sort?

• A . O(n)

• B . O(n log n)

• C . O(n^2)

• D . O(log n)

5 Which of the following is/are property/properties of a dynamic programming problem?

• A . Optimal substructure

• B . Overlapping subproblems

• C . Greedy approach

• D . Both optimal substructure and overlapping subproblems

6 What are the constraints of the 0/1 Knapsack Problem?

• A . Items` weights and values are negative.

• B . Knapsack`s capacity is unlimited.

• C . Each item can only be chosen once, and the total weight must not exceed the knapsack`s capacity.

• D . Each item can be chosen multiple times.

7 What is the primary objective of the All Pairs Shortest Path problem in graph theory?

• A . To find the shortest path from one specific vertex to another.

• B . To find the shortest path between every pair of vertices in a graph.

• C . To detect negative weight cycles in a graph.

• D . To find the longest possible path in a graph.

8 What is the objective of the Traveling Salesperson Problem (TSP)?

• A . To find a shortest possible route that visits every city and returns to the origin city.

• B . To maximize the cost of traveling between cities.

• C . To visit as many cities as possible.

• D . To find the longest possible route that visits every city once.

9 What is the primary goal of constructing a Minimum Cost Spanning Tree (MCST) in a weighted graph?

• A . To find the shortest path between two specific vertices.

• B . To connect all vertices with the least total edge weight without creating cycles.

• C . To find the longest possible path without repeating edges.

• D . To maximize the differences in weight between consecutive edges.

10 Which algorithm is a popular greedy method used to find the MCST of a graph?

• A . Dijkstra’s Algorithm

• B . Kruskal’s Algorithm

• C . Floyd-Warshall Algorithm

• D . Bellman-Ford Algorithm