Investment strategy your knowledge of algorithms

Assignment Help Data Structure & Algorithms
Reference no: EM13164633

Planning an investment strategy your knowledge of algorithms helps you obtain an exciting job with the acme computer company, along with a $10,000 signing bonus. you decide to invest this money with the goal of maximizing your return at the end of 10 years. you decide to use the amalgamated investment company to manage your investments. amalgamated investments requires you to observe the following rules. it offers n different investments, numbered 1 through n. in each year j , investment i provides a return rate of rij . in other words, if you invest d dollars in investment i in year j , then at the end of year j , you have drij dollars. the return rates are guaranteed, that is, you are given all the return rates for the next 10 years for each investment. you make investment decisions only once per year. at the end of each year, you can leave the money made in the previous year in the same investments, or you can shift money to other investments, by either shifting money between existing investments or moving money to a new investement. if you do not move your money between two consecutive years, you pay a fee of f1 dollars, whereas if you switch your money, you pay a fee of f2 dollars, where f2 gt f1.

a. the problem, as stated, allows you to invest your money inmultiple investments in each year. prove that there exists an optimal investment strategy that, in each year, puts all the money into a single investment. (recall that an optimal investment strategy maximizes the amount of money after 10 years and is not concerned with any other objectives, such as minimizing risk.)

b. prove that the problem of planning your optimal investment strategy exhibits optimal substructure.

c. design an algorithm that plans your optimal investment strategy. what is the running time of your algorithm?

d. suppose that amalgamated investments imposed the additional restriction that, at any point, you can have no more than $15,000 in any one investment. show that the problem of maximizing your income at the end of 10 years no longer exhibits optimal substructure.

Reference no: EM13164633

Questions Cloud

How many bits are required in the address bus : You have been assigned to design a 8M x 32 bit memory board. You may use only 256K x 8 bit RAM chips with full parallel addressing.a) How many bits are required in the Address Bus of the whole board?
Design a phonecall class that holds a phone number : Design a PhoneCall class that holds a phone number to which a call is placed, the length of the call in minutes, and the rate charged per minute. Overload extraction and insertion operators for the class.
Design a class named checkingaccount : Design a class named CheckingAccount that holds a checking account number, name of the account holder, and balance.include methods to set values for each data field and a method that displays all the account information. Create the class diagram a..
Determine the highest bit rate possible for a circuit : 1. Determine the number of conditions possible for a binary code
Investment strategy your knowledge of algorithms : Planning an investment strategy your knowledge of algorithms helps you obtain an exciting job with the acme computer company, along with a $10,000 signing bonus. you decide to invest this money with the goal of maximizing your return at the end of..
Write program using a switch statement that display polygon : Write a program using a switch statement that displays the name of a polygon with sides between 3 and 12 depending on the number entered by the user
On any given execution your program : On any given execution your program will produce just one version of the figure. However, you should refer to the class constant throughout your code, so that by simply changing your constant's value and recompiling, your program would produce a f..
When the jmpc field in the microinstruction is enabled : Assume that when the JMPC field in the microinstruction is enabled (set), MBR is ORed with NEXT_ADDRESS to determine the address of the next microinstruction to be executed
Write a program that prompts for and accepts input of test : write a program that prompts for and accepts input of test ggrades that are integers between 0 and 100. For each numerical test grade,  program should display a corresponding letter grade

Reviews

Write a Review

Data Structure & Algorithms Questions & Answers

  Empty stack

1. Suppose an initially empty stack S has performed a total of 25 push operations, 12 top operations, and 10 pop operations, 3 of which generated EmptyStackExceptions, which were caught and ignored. What is the current size of S?

  Design algorithm to solve spectral assembly problem

Design an algorithm to solve the Spectral Assembly problem under the above conditions. Does the problem have a unique solution?

  Describe why algorithm runs in on time

Assume you have the array A of n items, and you want to find k items in A closest to the median of A. Describe why your algorithm runs in O(n) time.

  Diameter bounded minimum spanning tree of graph by prim-s

Modify Prim's or Kruskal's algorithm to determine diameter bounded minimum spanning tree of complete graph. A diameter bounded minimum spanning tree is spanning tree.

  Generalize 2-3 algorithms for insert and delete

Generalize the 2-3 algorithms for INSERT and DELETE to K-J trees, where non-leaf vertices have between K and J children for fixed integers K >=2, and J>= 2K-1.

  Show result of inserting keys using linear probing

Show the result of inserting these keys using linear probing, using quadratic probing with c1 = 1 and c2 = 3, and using double hashing with h2(k) = 1 + (k mod (m ¡ 1)).

  Question about site structure

Browse the Web to discover examples of the following site structures Linear and Hierarchical and describe how the content fits the structure.

  Why knapsack problem known as zero-one knapsack problem

Why Knapsack Problem explained as 0/1 Knapsack Problem. Skecth Dynamic Programming Tables (one for calculating optimal value and one for keeping track of items used.

  Transmitting image using raster scan order

If we were to transmit this image using raster scan order, after 15 seconds how many rows of the image will the user have received?

  A binary search tree for link information

A binary search tree with N nodes has N + 1 null references, half the space allocated in a binary search tree for link information is wasted. Suppose that if a node has a null left child, we make its left child link to its inorder predecessor, and if..

  Create time algorithm-minimum time required to finish task

Create the O(|V | + | E |) time algorithm which, given times ti and the dependencies, determines minimum time required to complete all the tasks.

  Solving single source shortest paths problem

Here is a proposed algorithm to solve single source shortest paths problem in a weighted directed graph G with possibly negative edges weights.

Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd