A student has been asked to put some parcels on a shelf. The parcels all weigh different amounts, and the shelf has a maximum safe loading weight capacity of 150 Kg. The weight of parcels are as follows (in Kg): The student has been asked to load the maximum weight possible parcels on the shelf subject to the maximum safe loading weight. State two possible approaches for a greedy algorithm solution to solve this problem. In each case, state clearly the result you would get from applying that approach to this problem, stating whether the solution is optimal or not. If your answer does not produce an optimal solution, what algorithm could be employed to find one?

Q: Let's consider the bar cutting problem: Suppose we have a bar of length n. p is the selling price of…

A: To solve this problem, we have to solve in bottom-up manner. In Bottom-up approach we solve the…

Q: Write a recurrence that would be used in dynamic programming for the following problem: Given a rod…

A: #include<stdio.h>#include<limits.h> // this is mainly used for the finding of two…

Q: (a) A student has been asked to put some parcels on a shelf. The parcels all weigh different…

A: Answer: We need to write which algorithms would be acceptable so we will see in the more details…

Q: Sum of Squared Errors: Remember from your statistics courses that if two random variables X and Y…

A: Here is the  python code of above problem. See below step for code.

Q: We want to send n cargo by n truck. Each truck can move only one cargo and receives different costs…

A: We want to send n cargo by n truck. Each truck can move only one cargo and receives different costs…

Q: Use Greedy approach for the following problem: The prices for the following animals are: Lamb: 15 TL…

A: The first rule is that all the animals should be bought so to ensure that(and by thinking greedily)…

Q: b. Using Karnaugh map, simplify the following Boolean function F (show your grouping): [2 Marks] AB…

A:

Q: How can i find the number of paths possible for 0 to N stairs when the user may jumps 1 ,2 & 3…

A: The solution to the given problem is below.

Q: Design a greedy algorithm to make change for n cents using the least number of coins among quarters…

A: 1)Consider n<5, then use n pennies.consider 5<=n<`0, then use n-5 pennies and 1…

Q: Consider the problem of making change for n cents using the fewest number of coins. Assume that we…

A: Recursive Backtracking Algorithm: Function CoinChange(n, coins) return CoinChangeRecursive(n,…

Q: given %matplotlib inlineimport numpy as npfrom matplotlib import pyplot as pltimport math

A: Let's Solve the question Step by Step : 4.1) Find the first 3 non-zero terms of Taylor series for…

Q: have a knapsack with the limit of W. There are likewise n things, the I-th one has weight wi.…

A: Here have to determine about the Knapsack  programming problem statement.

Q: Information on morphine: Morphine can be administered via injection / IV. The quantity of morphine…

A: ANSWER:-

Q: Given the graph below. The graph is: * all answers are correct (except “all answers are incorrect")…

A: A graph is a cluster of nodes connected among themselves via edges.

Q: Many scheduling problems can be solved using greedy algorithms. A classic problem is as follows:…

A: A greedy algorithm is a problem-solving approach that makes locally optimal choices at each step in…

Q: 2. Honest Goblins are Easy to Find At Hogwarts a new shipment of n goblins has arrived. To be of any…

A: Assume that more than half of the given n goblins are truth tellers.   Pairing the goblins and…

Q: Consider the problem of making change for n cents using the fewest number of coins. Assume that we…

A: Instead of starting with the larger problem and breaking it down into smaller subproblems…

Q: Suppose, you are working in a company 'X' where your job is to calculate the profit based on their…

A: In Python, classes are used to define new types of objects with their own properties and methods.…

Q: An electrician has wired n lights, all initially on, so that: 1) light 1 can always be turned…

A: IMPLEMENTATION: The algorithm works from left to right implementing individual bits. First bit can…

Q: You have a five-quart jug, a three-quart jug, and an unlimited supply of water (but no measuring…

A: we can just play with the jugs using given steps: 1. Pour water into the five-quart container.2.…

Q: Question 2: Consider the 0/1 knapsack problem. Given Nobjects where each object is specified by a…

A: a) Code for this problem     #include <bits/stdc++.h> using namespace std; int max(int a,…

Q: We have 13 items in total. There are 6 guidebooks, and 7 towels. We pick two items, and among those,…

A: A combination is a technique that determines the number of possible arrangements in a collection…

Q: Consider the same house rent prediction problem where you are supposed to predict price of a house…

A: The solution to the above question is:

Q: Suppose that there are m students who want to take part in n projects. A student is allowed to join…

A: In this m students wants to take part in n project only if they pass the criteria of the project.…

Q: Assuming you possess a total of 'm' dollars, and are accompanied by a group of 'n' friends. For…

A: Imagine that you have a total of 'm' dollars, and you are in the company of 'n' friends. Each of…

Q: The diagram below shows roads connecting towns near to Rochdale. The numbers on each arc represent…

A: Answer: We need to write the find the minimum path from source to destination using the Dijkstra's…

Q: Consider the same house rent prediction problem where you are supposed to predict price of a house…

A: The problem is about linear regression with L1 regularization (also known as Lasso Regression). The…

Q: random variables X and Y are related by a relation YaX+b and you had a set of observations (1.1),…

A: the python code is an given below :

Q: numerous bouquet combinations, including two 5-rose bouquets (total profit of $70), and a 4-rose…

A: Roses 1 2 3 4 5 Profit $5 $15 $24 $30…

Q: Many scheduling problems can be solved using greedy algorithms. A classic problem is as follows:…

A: It is possible to invent several greedy algorithms for the problem.

Q: I have a hand of five cards, n of which are aces. An observation is: I shuffle the cards, pick one…

A: Solution: Given, n = 5, k = 1, m = 5. Now, P(n) = 5k/m = 5/5 = 1. Hence, the probability of getting…

Q: A bottle factory produces bottles of equal mass. During a production, the weight of one of the…

A: Input:First-line contains T number of test cases.For each of the T-test cases, the first line…