If a problem can be solved optimally by solving its subproblems, it has the given attribute. overlapping subproblems, optimum substructure, memorizing, greedy?

Let A = {a1, a2, ..., an} and be a set of n positive integer and let T be another integer. Design a dynamic programming algorithm that determines whether there exists a subset of A whose total sum is exactly T. Analyze the time complexity of your solution. For instance, if A = 4, 5, 17, 23, 11, 2 and T = 35 the algorithm should return True because the subset 5, 17, 11, 2 sums to 35. For the same set of numbers if we choose T = 31 the problem has no solution, and the algorithm will return False. When designing the dynamic programming algorithm, please describe the size and dimensionality of the dynamic programming table, and explicitly formulate the recurrence relationship.

Suppose Professor Weine described a deterministic algorithm that runs in polynomial time for a known NP-Complete problem such as the Satisfiability problem How would this impact the class NP (the class of problems that can be solved nondeterministically in polynomial time)? 0. The class P would be strictly larger than the class NP 0. The class NP would be equal to the class P O.It would only impact P but not NP O.It would have no impact on the class NP

Let n = 2 and n = 2 (²). Draw Hs². This is from an optimization and convex analysis class

Two computer scientists-turned-farmers are planning what and how to plant during the upcoming season. There are four possible courses of action they can take, and they seek advice. In each case the outcome is either NP-complete or it can be calculated in polynomial time. You are tasked to assess the existence of a polynomial time algorithms and explain how it is assessed. If you find one, show it. If you did not find one, explain why one does not exist. There is a total of n tons of seeds to plant, with k number of types of crops, labeled for simplicity as c1, c2, c3, ..., ck. The quantities of each crop are given by 2i, where i ˃ 0 is an integer. The two farmers want to each plant an equal mix of crops.

If you can make an optimal solution for a problem by making optimal solutions for its subproblems, then the problem has the quality in question. a) Subproblems that overlap; b) best substructure; c) memory; d) greedy

This characteristic is met by a problem if it is feasible to develop an optimum solution for it by first creating optimal solutions for its subproblems. a) Subproblems that overlap; b) substructure that's optimum; c) memorization; d) greedy

1. A brute-force algorithm searches through the entire search space, similar to exhaustive search (worst case) or exhaustive optimization. True or False   2.Given a problem, the algorithm based on exhaustive search or exhaustive optimization always terminates with the correct solution True or False

Design a dynamic programming algorithm for the bigger-is-smarterelephant problem by comparing it, as done previously, with the problem of finding thelongest weighted path within a directed level graph problem.

A school is creating class schedules for its students. The students submit their requested courses and then a program will be designed to find the optimal schedule for all students. The school has determined that finding the absolute best schedule cannot be solved in a reasonable time. Instead they have decided to use a simpler algorithm that produces a good but non-optimal schedule in a more reasonable amount of time. Which principle does this decision best demonstrate?