logo Use SA10RAM to get 10%* Discount.
Order Now logo

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Juan FloresEnglish
(5/5)

737 Answers

Hire Me
expert
Vincent AlexanderEnglish
(5/5)

516 Answers

Hire Me
expert
Ivor CutlerLaw
(5/5)

553 Answers

Hire Me
expert
Abhilekh Nath DasComputer science
(/5)

860 Answers

Hire Me
Data structures & Algorithms

design a dynamic-programming solution that will help the theater manager go over the daily bids and select from among them the ones that will maximize the daily theater revenue R.

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

 

An exclusive all-day-long family theater has a capacity of C seats. To use the theater, each group must make a bid. Each bid cannot be less than a minimum amount (B) and any group can bid more than B to increase the chances of its bit being accepted to use the theater.

Your task is to design a dynamic-programming solution that will help the theater manager go over the daily bids and select from among them the ones that will maximize the daily theater revenue R.

  1. (10 points) First, let's evaluate the following seemingly promising greedy

Evaluate the strategy of dividing the group bid amounts by the group sizes and picking the group with the largest amount per member first. Give an example to show that this strategy does not produce an optimal solution.

  1. (10 points) Write an equation that expresses the maximum revenue R recursively and shows the optimal substructure of this
  2. (10 points) Draw the recursion tree of the following Assume that the theater capacity (C) is 15 and the minimum bid amount (B) is also $15

 

Group

1

2

3

4

5

Group size

3

2

5

7

6

Group bid

30

15

40

60

50

 

  1. (5 points) What is the optimal revenue (R) of the above example?
  2. (5 points) How many possible solutions are there?
  3. (10 points) Give a recursive solution to the recurrence equation of STEP
  4. (15 points) Give a non-recursive bottom-up algorithm to calculate
  5. (5 points) What is the running time of the STEP G algorithm?
  6. (15 points) Give a recursive top-down memoized algorithm to calculate
  7. (5 points) What is the running time of the STEP I algorithm?
  8. (10 points) Give an algorithm for printing the numbers of the groups whose bids are

Related Questions

. The fundamental operations of create, read, update, and delete (CRUD) in either Python or Java

CS 340 Milestone One Guidelines and Rubric  Overview: For this assignment, you will implement the fundamental operations of create, read, update,

. Develop a program to emulate a purchase transaction at a retail store. This  program will have two classes, a LineItem class and a Transaction class

Retail Transaction Programming Project  Project Requirements:  Develop a program to emulate a purchase transaction at a retail store. This

. The following program contains five errors. Identify the errors and fix them

7COM1028   Secure Systems Programming   Referral Coursework: Secure

. Accepts the following from a user: Item Name Item Quantity Item Price Allows the user to create a file to store the sales receipt contents

Create a GUI program that:Accepts the following from a user:Item NameItem QuantityItem PriceAllows the user to create a file to store the sales receip

. The final project will encompass developing a web service using a software stack and implementing an industry-standard interface. Regardless of whether you choose to pursue application development goals as a pure developer or as a software engineer

CS 340 Final Project Guidelines and Rubric  Overview The final project will encompass developing a web service using a software stack and impleme

Get Free Quote!

371 Experts Online