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

There are a set of courses, each of them requiring a set of disjoint time intervals. For example, a course could require the time from 9am to 11am and 2pm to 3pm and 4pm to 5pm. You want to know, given a number K, if it’s possible to take at least K courses. You can only take one course at any single point in time (i.e. any two courses you choose can’t overlap). Show that the problem is NP-complete, which means that choosing courses is indeed a difficult thing in our life. Use a reduction from the Independent set problem.

We have n glasses which can hold a varying amount of liquid. We will say that glass1 is size q1 quarts and glass2 is size q2 quarts, etc. We now give you a size, say x quarts. You must give me a glass of exactly x quarts. You are allowed to fill any glass to exactly its size and to pour any liquid from one glass into another. When you pour, you either have to empty the glass you are pouring from or fill the glass you are pouring into. Can you do it?More concrete example: G1 has size 10 quarts. G2 has size 4 quarts. G3 has size 1 quart. You can get a 5 quart drink by filling G1, pouring 4 quarts from it into G2 and 1 quart of it into G1. After that, G1 has exactly 5 quarts. In the same problem, we could get 8 quarts by filling G2 twice and emptying it into G1 twice. Given This: Write an algorithm to do this and determine its complexity.

Suppose you have a set of n lectures that need to be scheduled in classrooms. Each lecture has fixed starting and ending times. You would like to use as few classrooms as possible to schedule all lectures. For example: Lectures 1 2 3 4 7 8 9. 10 3:00 Starts: 9:00 9:00 9:00 11:00 11:00 1:00 1:00 2:00 3:00 Ends: 10:30 12:30 10:30 12:30 2:00 2:30 2:30 4:30 4:30 4:30 These lectures can be scheduled in 3 classrooms. Explain how a brute force algorithm would solve this problem and analyze its complexity. Design a more efficient algorithm to solve this problem, and analyze its complexity [Important instruction: Create an arbitrary list of 10 lectures starting 4 times and their corresponding ending times to provide full explanation of how your proposed algorithm should work step by step] • Implement your algorithm using Python