5. How would you modify the dynamic programming algorithm for the coin- collecting problem if some cells on the board are inaccessible for the robot? Apply your algorithm to the board below, where the inaccessible cells are shown by X's. How many optimal paths are there for this board?

We use machine learning to solve problems if they satisfy three conditions. What are these conditions?

Consider eight points on the Cartesian two-dimensional x-y plane. a g C For each pair of vertices u and v, the weight of edge uv is the Euclidean (Pythagorean) distance between those two points. For example, dist(a, h) : V4? + 1? = /17 and dist(a, b) = v2? + 0² = 2. Because many pairs of points have identical distances (e.g. dist(h, c) V5), the above diagram has more than one minimum-weight spanning tree. dist(h, b) = dist(h, f) Determine the total number of minimum-weight spanning trees that exist in the above diagram. Clearly justify your answer.

Let's revisit our first problem, where we want to set up a series of chess matches so we can rank six players in our class. As we did before, we will assume that everyone keeps their chess rating a private secret; however, when two players have a chess match, the person with the higher rating wins 100% of the time. But this time, we are only interested in identifying the BEST of these six players and the WORST of these six players. (We don't care about the relative ordering or ranking of the middle four players.) Your goal is to devise a comparison-based algorithm that is guaranteed to identify the player with the highest rating and the player with the lowest rating. Because you are very strong at Algorithm Design, you know how to do this in the most efficient way. Here are five statements. A. There exists an algorithm to solve this problem using 6 matches, but there does not exist an algorithm using only 5 matches. B. There exists an algorithm to solve this problem using 7 matches,…

Consider the doctor-patient problem. There is a Doctor's clinic which has one Doctor, one patient chair, and n chairs for waiting for patients if there are any to sit on the chair. If there is no patient, then the Doctor sleeps in his own chair. When a patient arrives, he has to wake up the Doctor. If there are many patients and the Doctor is treating a patient, then the remaining patients either wait if there are empty chairs in the waiting room or they leave if no chairs are empty. Write a solution (Algorithm / Pseudocode) using semaphores.

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.

Please answer the following question in full detail. Please be specifix about everything: You have learned before that A∗ using graph search is optimal if h(n) is consistent. Does this optimality still hold if h(n) is admissible but inconsistent? Using the graph in Figure 1, let us now show that A∗ using graph search returns the non-optimal solution path (S,B,G) from start node S to goal node G with an admissible but inconsistent h(n). We assume that h(G) = 0. Give nonnegative integer values for h(A) and h(B) such that A∗ using graph search returns the non-optimal solution path (S,B,G) from S to G with an admissible but inconsistent h(n), and tie-breaking is not needed in A∗.

I’m meeting help with part C of this problem which is finding a recursive solution. The first picture shows you the problem and the second picture is the recursive solution that I have developed which is not working. Any help would be appreciated.

Calculate the optimal value of the decision parameter p in the Bresenham's circle drawing algorithm. The stepwise procedure for implementing Bresenham's algorithm for circle drawing is delineated.

Consider navigating the maze shown below. N (М G 1. S 2. A 3. B 4. F 8. 5. H 6. D L 7. P (2 G 2 2 4 C E P 2 2 2 A S B FL The maze is represented as a graph with edge costs as shown on the edges. The edge cost is 1 for all edges where the cost is not shown. Let S be the initial state and G be the goal state. List the first 8 vertices expanded by Uniform Cost Search (enter the single letter label of a node). K 2 2 J 2 D H