Question 9 10 pts Select all the answers below which are TRUE A greedy algorithm

Question

Question 9 10 pts Select all the answers below which are TRUE A greedy algorithm is a top-down approach. O To use the greedy algorithm discussed in class for solving the activity selection problem, all the activities have to be sorted in monotonically increasing order of their starting time. Let Z be an LCS of two sequences X and Y. Then the length of Z is at least half of the length of X The running time for solving the Longest Common Subsequence using Brute Force is O(n). The running time of the GREEDY-ACTIVITY-SELECTOR (sf) algorithm is O(ngn) if the input activities are not sorted. LCS-Length(X,Y) algorithm has the running time RT O(mn), where n is the length of X and m is the length of Y. A greedy algorithm does not always yield to an optimal solution, but for some problems it does compute an optimal O O solution.

Explanation / Answer

1.Greedy Algorithms uses top down approch for problem solving - TRUE

2.Sort the activities according to their finishing time.Select the first activity from the sorted array and print it.-TRUE

3.TRUE

4.Brute force attack running time for longest subsequence is = O(n) -TRUE

5.TRUE

6.TRUE

7.A greedy algorithm does not always yield to an optimal solution,but for some problems may yield.Mostly provides closest solution - TRUE

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.