th and fifth project that needs only $200 each. By establishing these four projects apart, the investor will have $200*4 (profit) +$200 (initial basic) = $1000. This amount of money will enable the establishment the 3rd project that needs $500 of investment to gain $200 of profit. Finally, to calculate the overall profit, you have collected $1200, where $200 of them are the initial basic and hence the profit is $1200 - $200 = $1000.  In the second example, your initial amount of money is $150, which enable you to invest in the 3rd project only. By doing so, your budget will increases to $200 and hence be able to invest in the 1st project to again increase your budget to $290. However, this is not enough to invest in the 3rd project. Finally, you collected $290, where $150 of them are the initial basic and hence the profit is $290 - $150 = $140.

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Explanation In the first example, your initial amount of money is $200, which enable you to invest in the first, second, fourth and fifth project that needs only $200 each. By establishing these four projects apart, the investor will have $200*4 (profit) +$200 (initial basic) = $1000. This amount of money will enable the establishment the 3rd project that needs $500 of investment to gain $200 of profit. Finally, to calculate the overall profit, you have collected $1200, where $200 of them are the initial basic and hence the profit is $1200 - $200 = $1000. 

In the second example, your initial amount of money is $150, which enable you to invest in the 3rd project only. By doing so, your budget will increases to $200 and hence be able to invest in the 1st project to again increase your budget to $290. However, this is not enough to invest in the 3rd project. Finally, you collected $290, where $150 of them are the initial basic and hence the profit is $290 - $150 = $140.

 

 

 """ I want the solution in python """

a) Design a brute-force algorithm to solve this problem , and analyse the complexity of your solution 

b) Design a more efficient algorithm to do the same task with less complexity  
and analyse the complexity of your solution. [Important instruction to be followed: Create an arbitrary input of at least 5 projects and use it to provide full explanation of how your proposed algorithm should work step by 
step] 

c) Develop a python code to implement your efficient algorithm. [The marks depend on the correctness of the code, indentation, comments, test-case] 

d) Prepare a brief report (250 words) comparing the two algorithms

Ex1
np
a; →
b; →
Ex2 np
a; →
b; →
Ex3
np
a; →
b; →
input
5 $200
$200 $200 $500 $200 $200
$200 $200 $200 $200 $200
3 $150
$200 $400
$150
$90 $1000 $50
5 $80
$1280 $640 $320 $160 $80
$1280 $640 $320 $160 $80
output
$1000
$140
$2480
Transcribed Image Text:Ex1 np a; → b; → Ex2 np a; → b; → Ex3 np a; → b; → input 5 $200 $200 $200 $500 $200 $200 $200 $200 $200 $200 $200 3 $150 $200 $400 $150 $90 $1000 $50 5 $80 $1280 $640 $320 $160 $80 $1280 $640 $320 $160 $80 output $1000 $140 $2480
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Follow-up Questions
Read through expert solutions to related follow-up questions below.
Follow-up Question

Since the algorithm given in part (a) is the most efficient algorithm, the maximum efficiency attained is O(n).

I want at least the efficiency of writing code with a screenshot in Python

d) Prepare a brief report (250 words) comparing the two algorithms

Solution
Bartleby Expert
SEE SOLUTION
Follow-up Question

Please solve all the steps well for the seventh time I sent this question and you did not solve it well

I want Python code with screenshots and comparison. I want to solve a paragraph a,b.c.d (250 words)

 

 

 

a) Design a brute-force algorithm to solve this problem , and analyse the complexity of your solution 

b) Design a more efficient algorithm to do the same task with less complexity  
and analyse the complexity of your solution. [Important instruction to be followed: Create an arbitrary input of at least 5 projects and use it to provide full explanation of how your proposed algorithm should work step by 
step] 

c) Develop a python code to implement your efficient algorithm. [The marks depend on the correctness of the code, indentation, comments, test-case] 

d) Prepare a brief report (250 words) comparing the two algorithms

Solution
Bartleby Expert
SEE SOLUTION
Follow-up Question

I want to code in Python the least efficient and the most efficient with screenshots
I also want the psudocode

Solution
Bartleby Expert
SEE SOLUTION
Similar questions
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY