DSA + System Design - 17

Which of the following is a key characteristic of a greedy algorithm?

• It always finds the optimal solution

• It builds up a solution piece by piece, always choosing the next piece that offers the most immediate benefit

• It is guaranteed to be the fastest algorithm for a problem

• It explores all possible solutions

Which of the following problems can be solved using a greedy algorithm?

• Traveling Salesman Problem

• 0/1 Knapsack Problem

• Fractional Knapsack Problem

• Longest Common Subsequence

In the context of graph algorithms, which of the following algorithms is NOT typically associated with a greedy strategy?

• Dijkstra's Algorithm

• Prim's Algorithm

• Kruskal's Algorithm

• Bellman-Ford Algorithm

The Huffman coding algorithm is a classic example of a greedy algorithm. What is its primary use?

• Pathfinding in graphs

• Compression

• Sorting

• Scheduling

In a job scheduling problem where each job has a start time, end time, and profit, which greedy strategy typically ensures the maximum profit?

• Select jobs in order of non-decreasing start times

• Select jobs in order of non-decreasing end times

• Select jobs in order of non-increasing profit

• Select jobs in order of non-increasing duration

What is the time complexity of Kruskal's algorithm for finding the Minimum Spanning Tree of a graph with V vertices and E edges, assuming the edges are initially sorted?

• O(V^2)

• O(E log V)

• O(E + V log V)

• O(V log V)

Given n items with weights and values, and a knapsack with capacity W, what is the time complexity of solving the Fractional Knapsack Problem using a greedy algorithm?

• O(n)

• O(n log n)

• O(n^2)

• O(nW)

What type of data structure is often used in Prim's algorithm to efficiently retrieve the next vertex with the minimum edge weight?

• Stack

• Queue

• Min-Heap

• Hash Table

Why should I spend money on Ineuron "DSA + System Design" Course?

• DSA + System design are initial rounds of all MAANG companies

• Basic to Advance course for MAANG

• No course in market can beat price and content

• All of the Above