Solve this problem by dynamic programming. 11.3-3. A company is planning its advertising strategy for next year for its three major products. Since the three products are quite different, each advertising effort will focus on a single product. In units of millions of dollars, a total of 6 is available for advertising next year, where the advertising expenditure for each product must be an integer greater than or equal to 1. The vice-president for mar- keting has established the objective: Determine how much to spend on each product in order to maximize total sales. The following toble givos the ostim nd ino in golog Gin on ioto units) for

Solve this problem by dynamic programming. 11.3-3. A company is planning its advertising strategy for next year for its three major products. Since the three products are quite different, each advertising effort will focus on a single product. In units of millions of dollars, a total of 6 is available for advertising next year, where the advertising expenditure for each product must be an integer greater than or equal to 1. The vice-president for mar- keting has established the objective: Determine how much to spend on each product in order to maximize total sales. The following toble givos the ostim nd ino in golog Gin on ioto units) for

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter10: Classes And Data Abstraction

Section: Chapter Questions

Problem 19PE

See similar textbooks

Similar questions

In Java - A year in the modern Gregorian Calendar consists of 365 days. In reality, the earth takes longer to rotate around the sun. To account for the difference in time, every 4 years, a leap year takes place. A leap year is when a year has 366 days: An extra day, February 29th. The requirements for a given year to be a leap year are: 1) The year must be divisible by 4 2) If the year is a century year (1700, 1800, etc.), the year must be evenly divisible by 400; therefore, both 1700 and 1800 are not leap years Some example leap years are 1600, 1712, and 2016. Write a program that takes in a year and determines whether that year is a leap year. Default code: import java.util.Scanner; public class LabProgram { public static void main(String[] args) { Scanner scnr = new Scanner(System.in); int inputYear; boolean isLeapYear; isLeapYear = false; inputYear = scnr.nextInt(); /* Type your code here. */ }}
4. Let N(x) be the statement “x has visited North Dakota,” where the domain consists of the students in your school. Express each of these quantifications in English. a) ∃x N(x) b) ∀x N(x) c) ˺∃x N(x) d) ∃x ˺N(x) e) ˺∀x N(x) f ) ∀x ˺N(x)
Consider the following skeletal C program: void fun1(void); /* prototype */void fun2(void); /* prototype */void fun3(void); /* prototype */void main() { int a, b, c; . . .}void fun1(void) { int b, c, d; . . .}void fun2(void) { int c, d, e; . . .}void fun3(void) { int d, e, f; . . .}Given the following calling sequences and assuming that dynamic scoping is used, whatvariables are visible during the execution of the last function? Include with each visible variablethe name of the function in which it was defined.a. main calls fun1; fun1 calls fun2; fun2 calls fun3.b. main calls fun1; fun1 calls fun3.c. main calls fun2; fun2 calls fun3; fun3 calls fun1.d. main calls fun3; fun3 calls fun1.e. main calls fun1; fun1 calls fun3; fun3 calls fun2. Consider the following program, written in JavaScript-like syntax: // main programvar x, y, z;function sub1() {var a, y, z;. . .}function sub2() { var a, b, z; . . .}function sub3() { var a, x, w; . . .}Given the following calling sequences and…
:Create the logic for the dice game Pig, in which a player can compete with the computer. The objectof the game is to be the first to score 100 points. The user and computer take turns “rolling” a pair of dicefollowing these rules:• On a turn, each player rolls two dice. If no 1 appears, the dice values are added to a running total for theturn, and the player can choose whether to roll again or pass the turn to the other player. When a player passes,the accumulated turn total is added to the player’s game total.• If a 1 appears on one of the dice, the player’s turn total becomes 0; in other words, nothing more isadded to the player’s game total for that turn, and it becomes the other player’s turn.• If a 1 appears on both of the dice, not only is the player’s turn over, but the player’s entire accumulatedtotal is reset to 0.• When the computer does not roll a 1 and can choose whether to roll again, generate a random valuefrom 1 to 2. The computer then will decide to continue when the…
Consider an online auction system where the current highest bid for each item must be maintained. A person who wishes to bid on an item calls the bid(amount) function, which compares the amount being bid to the current highest bid. If the amount exceeds the current highest bid, the highest bid is set to the new amount. This is illustrated below:void bid(double amount) {if (amount > highestBid)highestBid = amount;} Describe how a race condition is possible in this situation and what might be done to prevent the race condition from occurring. Based on the solution you describe, rewrite the bid function that can solve the problem.
Q2: Write aprogram in CT' using OOP to create a class (A) , that contain the iöllowingIUnction:— (drawl) to drawa line Of Stars (Then create a class (B) , with public visibility mode inherit from class (A) ,contain the following function:(draw2) to draw the shape bellow using the tilnction (drawl),
Write a function with the interface doRandomWalk(nstep,startPosition), that takes the number of steps nstep for a random walk and the startPosition of the random walk on a straight line, and returns the location of the final step of the random walker. Problem Part B Now, write another function with the interface simulateRandomWalk(nsim,nstep,startPosition) that simulates nsim number of random-walks, each of which contains nstep steps and starts at startPosition. Then, this function calls doRandomWalk() repeatedly for nsim times and finally returns a vector of size nsimcontaining final locations of all of the nsim simulated random-walks. Problem Part C Now write a script that plots the output of simulateRandomWalk() for nsimnstepstartPosition===1000010−10 The resulting plot should look like the following, How do you interpret this result? How can uniformly-distributed random final steps end up having a Gaussian bell-shape distribution.
I need a class diagram for the following scenario: An application for tracking and managing videos for faculty and students at a university is to be developed. Videos can be scientific, religious or general. General videos are classified as miscellaneous, sports or entertainment while scientific videos are classified as natural science videos or social science videos. In general, professors can check out any number of videos, however, visiting professors can check out at most seven videos. Unlike regular professors, visiting professors can check out videos for the duration of only two weeks. Students can check out any number of religious videos and at most 2 scientific videos. Students can check out only scientific videos in the subject areas represented in their research groups. To facilitate this, students and professors can belong to research groups. A research group must have at least 2 professors and every student must belong to some research group. Professors that…
Write a C++ program with an EuropeanOption class (with fixed strike price K). It should hold information such as option type (call or put), spot price (of the underlying asset), strike price, interest rate, volatility (of the underlying asset) and time to maturity. Constructors don’t accept illegal values. Implement a getPrice() function which gives the price of the option using path independent simulation of the stock prices. Using the following dynamics for the stock price with the constant values: dSt= rStdt + σStdWt S0= 100 K = 105 r = 0.02 σ = 0.05 T = 10. Add more features to the class it should contain four member functions to compute the numerical Greeks (getDelta() for spot price, getRho() for interest rate, getVega() for volatility, and getTheta() for time to maturity) of a given option.
The game Capture is played by two players, First and Second, who take turns to move towards one another on a narrow bridge. Initially, the two players are at opposite ends of the bridge, at a distance of n feet from each other. (Here n is an arbitrary positive integer.) When it is their turn, they are allowed to jump 1, 2, or 3 feet toward each other. The game starts by First making a move first; the game is over when one player is able to capture (jump on top of) the other player. Generalize the problem further to the case when the initial distance is n feetand the players are allowed to jump any (positive) integer number of feet up to k feet. (Here n and k are arbitrary natural numbers.)
c++ or java or in pseudo code with explaining note: if anything is unclear or seems left out make an assumption and document your assumption Implement an algorithm for assigning seats within a movie theater tofulfill reservation requests. Assume the movie theater has the seatingarrangement of 10 rows x 20 seats, as illustrated to the below.The purpose is to design and write a seat assignmentprogram to maximize both customer satisfaction and customersafety. For the purpose of public safety, assume that a buffer of three seats inbetween Input DescriptionYou will be given a file that contains one line of input for eachreservation request. The order of the lines in the file reflects the order inwhich the reservation requests were received. Each line in the file will becomprised of a reservation identifier, followed by a space, and then thenumber of seats requested. The reservation identifier will have theformat: R####. See the Example Input File Rows section for anexample of the input…
You are a product manager and currently leading a team to develop a new product. Unfortunately, the latest version of your product fails the quality check. Since each version is developed based on the previous version, all the versions after a bad version are also bad. Suppose you have n versions [1, 2, ..., n] and you want to find out the first bad one, which causes all the following ones to be bad. given is an API bool isBadVersion(version) which returns whether version is bad. Implement a function to find the first bad version. You should minimize the number of calls to the API. please write code in python