Possible cuts in a bar Program plan: Import required packages Define the class “Sequence”. Define the class “main” Create an object for scanner class Get the value from the user Call the method “c(number)”. Call the method “d(number)”. Define the method “c()”. Declare required variables. Check whether “k” to “0”. Assign “1” to “res”. Otherwise, call the method “c(k-1)”. Return the value “res”. Define the method “d()”. Declare required variables. Check whether “k” to “0”. Assign “1” to “res”. Otherwise, assign “0” to “res”. Iterate till “i” is less than “k”. Call the method “d(i-1)*d(k-1)”. Return the value “res”.

Question

Want to see the full answer?

Answer 1

Question

Chapter 11, Problem 4PP

Program Plan Intro

Possible cuts in a bar

Program plan:

Import required packages

Define the class “Sequence”.

Define the class “main”

Create an object for scanner class

Get the value from the user

Call the method “c(number)”.

Call the method “d(number)”.

Define the method “c()”.

Declare required variables.

Check whether “k” to “0”.

Assign “1” to “res”.

Otherwise, call the method “c(k-1)”.

Return the value “res”.

Define the method “d()”.

Declare required variables.

Check whether “k” to “0”.

Assign “1” to “res”.

Otherwise, assign “0” to “res”.

Iterate till “i” is less than “k”.

Call the method “d(i-1)*d(k-1)”.

Return the value “res”.

Expert Solution & Answer

Want to see the full answer?

Check out a sample textbook solution

See solution

Students have asked these similar questions

You and your friends decided to hold a “Secret Santa” gift exchange, where each person buys a gift for someone else. To see how this whole thing works, let’s consider the following example. Suppose there are 7 people A, B, C, D, E, F, and G. We denote x → y to mean “x gives a gift to y.” If the gift exchange starts with person A, then they give a gift to E. Then E gives a gift to B. And it is entirely possible that B gives a gift to A; in such a case we have completed a “cycle.” In case a cycle occurs, the gift exchange resumes with another person that hasn’t given their gift yet. If the gift exchange resumes with person D, then they give a gift to G. Then G gives a gift to F. Then F gives a gift to C. Then finally C gives a gift to D, which completes another cycle. Since all of the people have given their gifts, the giftexchange is done, otherwise the gift exchange resumes again with another person. All in all, there are two cycles that occurred during the gift exchange: A → E → B → A…

Use a computer programming language of your choice to implement the dynamic programming that allows the change of edge weights and compute the shortest path from 1 to 14, and also shows the shortest route. For example, what is the shortest path and its route from node 1 to node 14 if the distance from node 4 to node 7 is 9?

Suppose a Genetic Algorithm uses chromosomes of the form x=abcdef with a fixed length of six genes.Each gene can be any digit between 0 and 9 . Let the fitness of individual x be calculated as : f(x) =(a+b)-(c+d)-(e+f) And let the initial population consist of four individuals x1, ... ,x4 with the following chromosomes : x1 = 3 5 3 2 6 5, x2 = 9 8 0 1 2 2, x3 = 1 2 2 1 2 3, x4 = 7 9 2 3 1 1 1. 1.Evaluate the fitness of each individual, showing all your workings, and arrange them in order with the fittest first and the least fit last. 2. calculate the average fitness. 3. Perform the following crossover operations:a- Cross the fittest two individuals using one point crossover at the middle point.b- Cross the second and third fittest individuals using a two point crossover (points b and e). Suppose the new population consists of the four offspring individuals received by the crossover operations in the above question. Evaluate the fitness of the new population, showing all your…