Note: please send me solutionproblems 3&4 normal solutionnot in program or outputProblem 3Suppose we have area and number of bedrooms and its corresponding fordifferent houses sold in Montreal. Now suppose john want to buy a househaving an area of 2000 feet2 with 2 bedrooms. Your task is to predict the priceof this house using KNN algorithm with K=3 and Euclidian distance formula.Living area (feet')# bedroomsHouse Price$ 400000S 330000S 369000$ 232000$ 5400002104160024003.141630004.Problem 4Use the k-means algorithm and Euclidean distance to cluster the following 9examples into 3 clusters: A1%= (-2,-1), A2=(-2,5), A3=(8,-4), A4=(3,-2),A5=(4,5), A6=(6,4), A7=(-1,2), A8=(4,-9), A9=(5,5). Suppose that the initialseeds (centers of each cluster) are A1, A4 and A7.a. Apply kmeans algorithm to tell finally which points are included in C1,C2 and C3.b. Draw all the 9 points on xy plane and circle each cluster to show itmakes sense or not.

Answered: Image /qna-images/answer/6d1882d6-f716-42a2-81c4-abcb8effca58.jpg

Problem 3 Suppose we have area and number of bedrooms and its corresponding for different houses sold in Montreal. Now suppose john want to buy a house having an area of 2000 feet2 with 2 bedrooms. Your task is to predict the price of this house using KNN algorithm with K=3 and Euclidian distance formula. Living area (feet') 2104 # bedrooms House Price $ 400000 S 330000 S 369000 $ 232000 $ 540000 3 1600 2400 3 1416 3000 4. Problem 4 Use the k-means algorithm and Euclidean distance to cluster the following 9 examples into 3 clusters: A1= (-2,-1), A2=(-2,5), A3=(8,-4), A4=(3,-2), A5=(4,5), A6=(6,4), A7=(-1,2), A8=(4,-9), A9=(5,5). Suppose that the initial seeds (centers of each cluster) are A1, A4 and A7.

Problem 3 Suppose we have area and number of bedrooms and its corresponding for different houses sold in Montreal. Now suppose john want to buy a house having an area of 2000 feet2 with 2 bedrooms. Your task is to predict the price of this house using KNN algorithm with K=3 and Euclidian distance formula. Living area (feet') 2104 # bedrooms House Price $ 400000 S 330000 S 369000 $ 232000 $ 540000 3 1600 2400 3 1416 3000 4. Problem 4 Use the k-means algorithm and Euclidean distance to cluster the following 9 examples into 3 clusters: A1= (-2,-1), A2=(-2,5), A3=(8,-4), A4=(3,-2), A5=(4,5), A6=(6,4), A7=(-1,2), A8=(4,-9), A9=(5,5). Suppose that the initial seeds (centers of each cluster) are A1, A4 and A7.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter15: Recursion

Section: Chapter Questions

Problem 18SA

See similar textbooks

Similar questions

Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies. Design a bottom-up (non-recursive) O(nk)-time algorithm that makes change for any set of k different coin denominations. Write down the pseudocode and analyze its running time. Argue why your choice of the array and the order in which you fill in the values is the correct one. Notice how it is a lot easier to analyze the running time of…
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies. Design a bottom-up (non-recursive) O(nk)-time algorithm that makes change for any set of k different coin denominations. Write down the pseudocode and analyze its running time. Argue why your choice of the array and the order in which you ll in the values is the correct one.
Consider the problem of making change for n cents using the fewest number of coins. Assume that we live in a country where coins come in k dierent denominations c1, c2, . . . , ck, such that the coin values are positive integers, k ≥ 1, and c1 = 1, i.e., there are pennies, so there is a solution for every value of n. For example, in case of the US coins, k = 4, c1 = 1, c2 = 5, c3 = 10, c4 = 25, i.e., there are pennies, nickels, dimes, and quarters. To give optimal change in the US for n cents, it is sufficient to pick as many quarters as possible, then as many dimes as possible, then as many nickels as possible, and nally give the rest in pennies. Prove that the coin changing problem exhibits optimal substructure. Design a recursive backtracking (brute-force) algorithm that returns the minimum number of coins needed to make change for n cents for any set of k different coin denominations. Write down the pseudocode and prove that your algorithm is correct.
Problem1Given a value `value`, if we want to make change for `value` cents, and we have infinitesupply of each of coins = {S1, S2, .. , Sm} valued `coins`, how many ways can we make the change?The order of `coins` doesn't matter.For example, for `value` = 4 and `coins` = [1, 2, 3], there are four solutions:[1, 1, 1, 1], [1, 1, 2], [2, 2], [1, 3].So output should be 4. For `value` = 10 and `coins` = [2, 5, 3, 6], there are five solutions: [2, 2, 2, 2, 2], [2, 2, 3, 3], [2, 2, 6], [2, 3, 5] and [5, 5].So the output should be 5. Time complexity: O(n * m) where n is the `value` and m is the number of `coins`Space complexity: O(n)""" def count(coins, value): """ Find number of combination of `coins` that adds upp to `value` Keyword arguments: coins -- int[] value -- int """ # initialize dp array and set base case as 1 dp_array = [1] + [0] * value.. (+.
Write Algorithm FOR An iterative solution to Towers of Hanoi.in: triplet S = s0, s1, s2 representing the current game stateout: triplet R = r0, r1, r2 representing the new game state
Algorithm to An iterative solution to Towers of Hanoi.in: triplet S = s0, s1, s2 representing the current game stateout: triplet R = r0, r1, r2 representing the new game statelocal: pole indices a, b, z ∈ {0, 1, 2}; disc numbers g, h ∈ [2, n]; last(Q) = Q|Q|−1, if1 ≤ |Q|, otherwise, last(Q) = +∞
We examine a problem in which we are handed a collection of coins and are tasked with forming a sum of money n out of the coins. The currency numbers are coins = c1, c2,..., ck, and each coin can be used as many times as we want. What is the bare amount of money required?If the coins are the euro coins (in euros) 1,2,5,10,20,50,100,200 and n = 520, we need at least four coins. The best option is to choose coins with sums of 200+200+100+20.
Your solution is completely incorrect as where did oyu get 5E could oyu please correct your asnwer? both part a and part b
Suppose we use the following KB (where x, y, z are variables and r1, r2, r3, goal are constants) to determine whether a particular robot can score. (a) Open(x) ∧ HasBall(x) → CanScore(x)(b) Open(x) ∧ CanAssist(y, x) ∧ HasBall(y) → CanScore(x) (c) PathClear(x,y) → CanAsist(x,y)(d) PathClear(x,z) ∧ CanAssist(z,y) → CanAssist(x,y) (e) PathClear(x,goal) → Open(x)(f) PathClear(y,x) → PathClear(x,y) (g) HasBall(r3)(h) PathClear(r1,goal) (i) PathClear(r2,r1) (j) PathClear(r3,r2) (k) PathClear(r3,goal)
Suppose we use the following KB (where x, y, z are variables and r1, r2, r3, goal are constants) to determine whether a particular robot can score. (a) Open(x) ∧ HasBall(x) → CanScore(x)(b) Open(x) ∧ CanAssist(y, x) ∧ HasBall(y) → CanScore(x) (c) PathClear(x,y) → CanAsist(x,y)(d) PathClear(x,z) ∧ CanAssist(z,y) → CanAssist(x,y) (e) PathClear(x,goal) → Open(x)(f) PathClear(y,x) → PathClear(x,y) (g) HasBall(r3)(h) PathClear(r1,goal) (i) PathClear(r2,r1) (j) PathClear(r3,r2) (k) PathClear(r3,goal) Intuitively, CanScore(x) means x can score on goal. CanAssist(x, y) means there exists some series of passes that can get the ball from x to y. Open(x) means x can shoot on goal directly. And P athClear(x, y) means the path between x and y is clear. Provide a SLD-derivation for the query CanScore(x) in which the answer provided is r1. Provide a SLD-derivation for the query CanScore(x) in which the answer provided is r3. How many “distinct” derivations (i.e., involving different…
Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible (nlogn or n at best, no n^2). Apply divide-and-conquer algorithm in the problem. Make sure ALL test cases return expected outputs by providing output screenshots. Hint: Use kth order statistics Output FormatOutput consists of K lines.For each query, output the age of Danny's soulmate in hours, similar to the input. Sample Input 05 3168141042 4 1 51 3 1 51 5 1 5 Sample Output 0101616 Sample Input 17 39301019263122 2 2 71 3 3 77 7 2 5 Sample Output 1301230 Sample Input 29 42635243231362722232 9 2 92 6 1 52 8 1 81 8 2 9 Sample Output 235323524 The actual code """Solves a test case Parameters:n : int - number of ages givenages : array-like - list of agess1 : int - start index of Danny's family. Also Danny's indexe1 : int - end index of Danny's familys2 : int…
Information is present in the screenshot and below. Based on that need help in solving the code for this problem in python. The time complexity has to be as less as possible (nlogn or n at best, no n^2). Apply divide-and-conquer algorithm in the problem. Make sure ALL test cases return expected outputs by providing output screenshots. Output FormatThe output contains one line with a single integer T_min, the minimum T needed to take out all N enemies within R rounds. If no T exists, print "A smile better suits a hero..." (without quotes) Sample Input 03 4 2 72212212 Sample Output 00 Sample Input 15 6 14 1283857211222 Sample Output 1A smile better suits a hero... Sample Input 25 6 2 1027261221211 Sample Output 23 The actual code """Solves a single test case. Parameters:n : int - number of enemiesk : int - number of attacksf : int - damage dealt by each conscious enemy each roundh : int - your max hit pointshp_i…