Recent questions tagged greedy-algorithms

Suppose Huffman coding is implemented as follows.Initially, the $n$ symbols are stored in a min priority queue according to their frequencies.The algorithm repeatedly per...

Which of the following are limitations of Greedy algorithms?They always fail for NP hard problem.They may not give the optimal solution for all problems.They are faster t...

Match the LIST-I with LIST-IILIST-ILIST-IIA.Dynamic programmingI.Floyd Warshall Shortest pathB.GreedyII.Huffman codingC.Back trackingIII.Hamiltonian cycle problemD.Branch...

Match the LIST-I with LIST-IILIST - ILIST - IIA.Dijkstra's AlgorithmI.GPS route findingB.Huffman CodingII.Data compressionC.KMP string matchingIII.Text editor search func...

Which of the following is true about Greedy algorithm?does not make any optimizationmakes local optimal decisions based on the selected criterionrequires exhaustive searc...

Which of the following algorithms use Greedy strategy?Dijkstra's algorithmKruskal's algorithmHuffman codingBellman-Ford algorithmChoose the correct answer from the option...

Which of the following problems can be solved using a greedy approach?Knapsack problem ($0/1$ version)Job Scheduling with deadlines and profitsFibonacci sequence calculat...

As we have to select maximal set of “non overlapping” activities. So like job scheduling algo of greedy we can solve it. So according to that complexity must be O(n logn)...

consider the following message BCCABBDDAECCBBAEDDCC find the no of bits requiered for huffman encoding of above message

Given a set $\mathcal{F}$ of intervals $\left(s_{i}, t_{i}\right)_{i=1}^{n}$ on the integer line (assume all $s_{i}, t_{i}$ are distinct), a subset $S$ of $\mathcal{F}$ i...

Consider yourself an engineer who wants to design a greedy algorithm for a tour company.The tour company will be given a list of $n$ tourists, each with a positive minimu...

Recall the Interval Scheduling Problem. A set of $n$ requests is given, each with a given start and finish time, $[s_i, f_i ].$ The objective is to compute the maximum nu...