Introduction to Algorithms
3rd Edition
ISBN: 9780262033848
Author: Thomas H. Cormen, Ronald L. Rivest, Charles E. Leiserson, Clifford Stein
Publisher: MIT Press
expand_more
expand_more
format_list_bulleted
Question
Chapter 16.1, Problem 5E
Program Plan Intro
To modify the Activity-Selection problem in such a way that the total value of activities scheduled is maximized, that is,
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Let's consider the bar cutting problem: Suppose we have a bar of length n. p is the selling price of a bar of length i; Let's assume that (i=1, 2, ..., n). Our goal is to split the bar into parts of integer length to get maximum profit.
(a) Design a dynamic programming algorithm for this problem. Instead of pseudocode, a well-explained explanation is preferred. Also mention the time and place complexity of your algorithm. (Hint: Define the function F(n) as the maximum profit that can be obtained for a stick of length n and construct an iterative relation.)
(b) Apply the dynamic programming algorithm you designed for the following example: You have a stick of length 6. Selling prices of parts: pi=1, P2=6, p3=7, p=11, p=14, po=15.
Suppose that there are m students who want to take part in n projects. A student
is allowed to join in a particular project only if the student is qualified for the project. Each
project can only have a limited number of students, and each student can take part in at most
one project. The goal is to maximize the number of students that are admitted to the projects.
Show how to solve this problem by transforming it into a maximum flow problem. What is the
running time of your algorithm?
A robot can move horizontally or vertically to any square in the same row or in the same column of a board. Find the number of the shortest paths by which a robot can move from one corner of a board to the diagonally opposite corner. The length of a path is measured by the number of squares it passes through, including the first and the least squares. Write the recurrence relation if you solve the problem by a dynamic programming algorithm.
Chapter 16 Solutions
Introduction to Algorithms
Ch. 16.1 - Prob. 1ECh. 16.1 - Prob. 2ECh. 16.1 - Prob. 3ECh. 16.1 - Prob. 4ECh. 16.1 - Prob. 5ECh. 16.2 - Prob. 1ECh. 16.2 - Prob. 2ECh. 16.2 - Prob. 3ECh. 16.2 - Prob. 4ECh. 16.2 - Prob. 5E
Ch. 16.2 - Prob. 6ECh. 16.2 - Prob. 7ECh. 16.3 - Prob. 1ECh. 16.3 - Prob. 2ECh. 16.3 - Prob. 3ECh. 16.3 - Prob. 4ECh. 16.3 - Prob. 5ECh. 16.3 - Prob. 6ECh. 16.3 - Prob. 7ECh. 16.3 - Prob. 8ECh. 16.3 - Prob. 9ECh. 16.4 - Prob. 1ECh. 16.4 - Prob. 2ECh. 16.4 - Prob. 3ECh. 16.4 - Prob. 4ECh. 16.4 - Prob. 5ECh. 16.5 - Prob. 1ECh. 16.5 - Prob. 2ECh. 16 - Prob. 1PCh. 16 - Prob. 2PCh. 16 - Prob. 3PCh. 16 - Prob. 4PCh. 16 - Prob. 5P
Knowledge Booster
Similar questions
- Exercise 4 20= 10+4+6 The rod-cutting problem consists of a rod of n units long that can be cut into integer-length pieces. The sale price of a piece i units long is Pi for i = 1,...,n. We want to apply dynamic programming to find the maximum total sale price of the rod. Let F(k) be the maximum price for a given rod of length k. 1. Give the recurrence on F(k) and its initial condition(s). 2. What are the time and space efficiencies of your algorithm? Now, consider the following instance of the rod-cutting problem: a rod of length n=5, and the following sale prices P1=2, P2=3, P3-7, P4=2 and P5=5.arrow_forward1. Let S = {1,2...n} be a set activities, where activity i € S has a start time si, a finish time f; and a profit p, asSociated with it. Design an dynamic programming algorithm for computing a set of compatible activities of maximum profit. Argue that the time complexity of you algorithm is O(n log(n)). (You must start with the correct definitions, and then write a recurrence relation.)arrow_forward8. A school is creating class schedules for its students. The students submit their requested courses and then a program will be designed to find the optimal schedule for all students. The school has determined that finding the absolute best schedule cannot be solved in a reasonable time. Instead they have decided to use a simpler algorithm that produces a good but non-optimal schedule in a more reasonable amount of time. Which principle does this decision best demonstrate? A. Unreasonable algorithms may sometimes also be undecidable B. Heuristics can be used to solve some problems for which no reasonable algorithm exists C. Two algorithms that solve the same problem must also have the same efficiency D. Approximate solutions are often identical to optimal solutions 0000arrow_forward
- There are n people who want to carpool during m days. On day i, some subset ???? of people want to carpool, and the driver di must be selected from si . Each person j has a limited number of days fj they are willing to drive. Give an algorithm to find a driver assignment di ∈ si each day i such that no person j has to drive more than their limit fj. (The algorithm should output “no” if there is no such assignment.) Hint: Use network flow. For example, for the following input with n = 3 and m = 3, the algorithm could assign Tom to Day 1 and Day 2, and Mark to Day 3. Person Day 1 Day 2 Day 3 Driving Limit 1 (Tom) x x x 2 2 (Mark) x x 1 3 (Fred) x x 0arrow_forwardQuestion 2: Consider the 0/1 knapsack problem. Given Nobjects where each object is specified by a weight and a profit, you are to put the objects in a bag of capacity C such that the sum of weights of the items in the bag does not exceed Cand the profits of the items is maximized. Note that you cannot use an item type more than once. a. Using dynamic programming, write an algorithm that finds the maximum total value according to the above constraints. b. What is the complexity of your algorithm? c. Show the dynamic programming table for the following data: W= { 2 ,7 , 1} , P={ 3 ,15 , 2 } and C=8.arrow_forwardIf a problem H is NP-Complete, then.. (Multi-choose) For any problem L in NP, there is a polynomial-time reduction from L to H For any problem L in P, there is a polynomial-time reduction from L to H H belongs to the class P H belongs to the class NP ."An output to problem H is either "yes" or "noarrow_forward
- Develop a dynamic programming algorithm for the knapsack problem: given n items of know weights w1, . . . , wn and values v1, . . . ,vn and a knapsack of capacity W, find the most valuable subset of the items that fit into the knapsack. We assume that all the weights and the knapsack’s capacity are positive integers, while the item values are positive real numbers. (This is the 0-1 knapsack problem). Analyze the structure of an optimal solution. Give the recursive solution. Give a solution to this problem by writing pseudo code procedures. Analyze the running time for your algorithms.arrow_forwardThis assignment uses several heuristic search techniques to find possibly optimal truth assignments for variables in the given Boolean formulas (see the bottom of the assignment). The formulas are in conjunctive normal form (ANDs of ORs). The fitness of an assignment is the number of clauses (ORs) that the assignment satisfies. If there are c clauses, then the highest fitness is bounded by c. However, if the formula is not satisfiable, then you cannot simultaneously make all c clauses true. You will use three of the following seven techniques: DPLL Resolution Genetic algorithms Local search Simulated annealing GSAT WalkSAT You must choose at least one complete algorithm to implement - DPLL or Resolution.arrow_forwardClasses are scheduled at a school. Once students have submitted their course requests, a computer algorithm can determine the optimal schedule for everyone. The school has concluded that it will take too long to determine the best schedule. Instead, they resort to a less sophisticated method that produces a serviceable if not ideal timetable. Which guiding concept is represented here?arrow_forward
- Write a recurrence that would be used in dynamic programming for thefollowing problem: Given a rod of length n and an array A of prices thatcontain all prices of all the pieces smaller than n. Determine the maximumvalue obtained by cutting up the rod and selling the pieces. Note that youcould sell the rod at its original length without cutting it.arrow_forwardMore and more seafood is being farm-raised these days. A model (differentialequation) used for the rate of change for a fish population, P(t) in farmingponds is given by P'(t) = b(1-(P(t)/Pm)) - hP(t) where b is the birth rate, PM is the maximum number of fish the pond cansupport, and h is the rate the fish are harvested. Write a python code that implements the Forward Euler method to solve thedifferential equation Suppose that the carrying capacity PM = 20, 000 fish with a birth rateof 6% and a harvesting rate of h = 0%, use your Python code to findand plot the numerical solution for the first 400 days for different valuesof y0. Pick y0 < 20, 000, y0 > 20, 000. Don’t forget to label all your plotswith x and y axes label, titles and legends. Use a time step ∆t = 0.1arrow_forwardA school is creating class schedules for its students. The students submit their requested courses and then a program will be designed to find the optimal schedule for all students. The school has determined that finding the absolute best schedule cannot be solved in a reasonable time. Instead they have decided to use a simpler algorithm that produces a good but non-optimal schedule in a more reasonable amount of time. Which principle does this decision best demonstrate?arrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill EducationStarting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSONDigital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
- C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSONDatabase Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage LearningProgrammable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education