ADA Module-3 Quiz 2025

What is the main idea behind dynamic programming?

• Dynamic programming is a method for creating random algorithms.

• Dynamic programming eliminates the need for recursion entirely.

• The main idea behind dynamic programming is to optimize recursive algorithms by storing previously computed results to improve efficiency.

• Dynamic programming is only used for sorting algorithms.

Explain the Knapsack Problem and its significance.

• The Knapsack Problem is only applicable in financial contexts.

• The Knapsack Problem focuses solely on maximizing weight without considering value.

• The Knapsack Problem is a linear programming problem that minimizes cost.

• The Knapsack Problem is a combinatorial optimization problem that seeks to maximize value within a weight limit.

What are memory functions in the context of dynamic programming?

• Memory functions are a type of data structure for storing variables.

• Memory functions are only used in recursive algorithms.

• Memory functions are techniques for optimizing sorting algorithms.

• Memory functions are techniques used in dynamic programming to store and reuse previously computed results.

Describe Warshall’s Algorithm and its application.

• Warshall's Algorithm calculates the minimum spanning tree of a graph.

• Warshall's Algorithm is used to find the shortest path in a graph.

• Warshall's Algorithm is used to compute the transitive closure of a directed graph, determining the reachability of vertices.

• Warshall's Algorithm is a sorting algorithm for arrays.

What is Floyd’s Algorithm used for?

• Finding the maximum flow in a network

• Floyd's Algorithm is used for finding shortest paths in a weighted graph.

• Sorting elements in a list

• Calculating the determinant of a matrix

What is the difference between Prim’s and Kruskal’s Algorithms?

• Prim's algorithm adds edges randomly; Kruskal's algorithm grows the MST from a single edge.

• Prim's algorithm uses a sorted list of vertices; Kruskal's algorithm grows the MST from edges.

• Kruskal's algorithm starts from a vertex; Prim's algorithm adds edges from a sorted list.

• Prim's algorithm grows the MST from a vertex; Kruskal's algorithm adds edges from a sorted list.

Explain Dijkstra’s Algorithm for shortest paths.

• Dijkstra's Algorithm is a method for finding the shortest paths from a source node to all other nodes in a weighted graph.

• Dijkstra's Algorithm finds the longest path in a graph.

• Dijkstra's Algorithm only works for unweighted graphs.

• Dijkstra's Algorithm is used for sorting elements in an array.

What is the purpose of Huffman Trees in data compression?

• To reduce the size of images only.

• To create fixed-length codes for data storage.

• To encrypt data for secure transmission.

• To create efficient variable-length codes for data compression.

How do Huffman Codes work?

• Huffman Codes assign variable-length binary codes to characters based on their frequencies, optimizing data compression.

• Huffman Codes require equal-length binary codes for optimal performance.

• Huffman Codes are primarily used for image compression only.

• Huffman Codes use fixed-length codes for all characters.

In what scenarios is dynamic programming preferred over greedy methods?

• When the problem requires a simple heuristic approach without considering previous decisions.

• When the problem can be solved using a divide and conquer strategy without overlapping subproblems.

• When the problem has overlapping subproblems and requires global optimization.

• When the problem has a single optimal solution that can be found in a single pass.