P020043224 aiaHurester nakedeer loInput:002010 70 440 02560 4320 100 forest80 24 marshOutput: Forester walked for 103.889 hoursForester walked for 121,376 hourMountaineer walked for 192.143 hoursMountaineer walked for 59.1405 hoursUnit is at 0, 100Unit is at 0, 100Unit is at 80, 24Unit is at 80, 24Input: 10 7044604 3280 24 mountainOutput : Forester walked for 809175 hoursMountaineer walked for 15.1523 hoursUnit is at 80, 24Unit is at 80, 24 In C+,Write a program that moves a forester unit and a mountaineer unit to a given target location andprints the number of hours it took for each unit to reach the targetFirst, the user will give the starting X and Y positions of the forester unit as well asa its base speed (allInts) Then the starting X and Y positions of the mountaineer unit as well as its base speed (all ints).Finally, the target X and Y positions (both ints) and the terrain type (std::string).Speed are given as distance traveled in one full day (i.e.,24 hours) and is affected by the terrain typeusing a multiplier over the base speed. Also, after 1 full day, each unit rests for a certain number ofhours. Speed multiplier and rest amount of each type of unit depending on the terrain type are asbelow.Speed MatiplierReu Duration Alier 1dayForesterMouraineerForesterMounmaineerForest135Moursain14Mansh0.51012Qihers0.85011After getting all this information, the program will move both the units to the target by printing out thetotal time (in hours) it took the units to reach their target and their final positions int he format seen inthe outputs.Requirements:You should deline a class fort he unit, two CHILD classes of the unit class one for the forester unit, anotherfort he mountaineer unit.Coordinate information should be kept as private inside the unit class whereas the speed informationshouldbe kept as protected inside the unit class.Classes should take the related input in their constructor functionsLhe base unit class MUST have a public function which prints out the current location of the unit.The base unit class MUST have a protected function which calculates the distance between itself and atarget location.Each child classes MUST have a public function which moves the unit to a target location given the terrainEype, calculates the total amount of hours it took the unit to reach to the target, and print it outGetting all the user input, instantiating objects, calling the move functions of the child classes should bedone in the main() function.Do NOT use pollymorphisim in this question(i.e., do NOT overload the move functionof the base dass).

Answered: D020 0 70 44 2025 3012 60432 8O 24 r…

Engineering

Computer Science

D020 0 70 44 2025 3012 60432 8O 24 r 3024 sairi lked la ked for 9.1ADS E 192.143hourN 0100

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 7PE

See similar textbooks

Similar questions

#10
Which of the following graphs is connected? A B C D E A 00100 BI0 010|1|1 C 10000 D 0 1 0 0 1 E 0 1 0 1 0 A B C D E A 0 0 1 0 1 B01010 10 C 1 0 0 0 1 DO 1000 E 10100 A B C D E A0011 0 B 0 0 0 0 1 C100 10 D 10100 E 0 1000
Learning In a 64-bit long floating point Machine number representing equivalent to decimal, consider the number is negative, c =1034 and f : the Machine number 22 24 26 28 representation is 110000001010 0101010101000000000000000000000000000000 none 110000001010 01010101000000000000000000000000000000000 0 110000001010 0101110100000000000000 0000000000000 N
- Entropy can be calculated by: E (I) -) P(k) log, P(k) k=0 Compute the entropy of the 4 by 4 image below 0 24 4 0 24 4 028|0 8 288
Suppose we have a group of proposed talks with preset start and end times. Students of CSE340 were asked to design an algorithm to schedule as many of these talks as possible in a lecture hall, under the assumptions that once a talk starts, it continues until it ends, no two talks can proceed at the same time, and a talk can begin at the same time another one ends. Assume that talk j begins at time sj (where s stands for start) and ends at time ej (where e stands for end). One student proposed the algorithm shown in Algorithm 1 on the next page, which simply adds talks in order of earliest start time (smallest sj ). (a) Prove, using a counter example, that the proposed algorithm does not always produce an optimal schedule (i.e., a schedule with most possible talks). (b) Another student proposed adding talks in order of shortest duration (ej - sj ). Prove, using a counter example, that even with this new criteria, the algorithm does not always produce an optimal schedule.
واجب : اكتب المثال 3 بالصيغة if else مثال 4: اكتب برنامج بلغة ماتلاب لقراءة قیم x,y وحساب المعادلة التالية : X+3y X-3 2x X-5,x36,x%3D0 Z= ху X-2 x/y X=4 error Other wise 1: باستخدام التعليمة if else واجب 2: باستخدام التعليمة Switch case
Assume thatn = 8 and the observations are X1 = 1.01 X2 = 1.02 X3 = 1.19 X4 = 1.19 X5 = 1.28 X6 = 2.39 X, = 2.56 Xs = 2.58 Assume that the EM algorithm is initialized at On = 3. What are the values of the first three iterates 01, 02, and 03 of the EM algorithm? 02 = 03
Writing in JAVA language the round robin algorithm CODE, to solve this problem. PROCESS TICKS A B с D PROCESS A B с D 1 Quatum = 5 ticks 1 tick context switch This is the result you have to get t 7 3 12 4 RESOLUTION IMAGE LA 7 3 12 4 LB 012 ARRIVAL 0 2 6 20 LC T 18 7 26 9 4 5 6 7 8 LD 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 18 19 20 21 2 28 29 NOTE: YOU MUST PLACE THE RESOLUTION TEXT CODE TO COPY, NOT HANDWRITTEN AND NOT ON IMAGE.
Can someone help about my assignment? Instruction is on image: Given: Last Name First Name ID Phone Salary=========== ========== ======== ======= =====Wood Carpenter 333556666 222-222-2222 40000Ironman Iron 444444443 828-888-8888 73000Goal-keeper Martin 777777777 888-666-8888 86000 Here is the input file.Doe John 555555555 333-333-3333 65000Doe Jan 444444444 333-333-3333 75000Hardworker John 888888888 888-888-8888 55000Programmer Travis 555446666 666-666-6666 76000 Output:Original ListLast Name First Name ID Phone Salary=========== ========== ======== ======= =====Doe John 555555555 333-333-3333 85000Doe…
The latest super-duper supercomputer has memory locations that are 64-bits wide. What is the largest unsigned integer that can be stored in one memory location? Suppose that we use sign-magnitude for storing negative numbers and dedicate one bit for a sign bit. What would be the largest POSITIVE integer that can be stored in a memory location.
Q. Idempotency law isI. P Ú P = P.II. P Ù P = P.III. P + P = P.(a) Only (I) above(b) Only (II) above(c) Only (III) above(d) Both (I) and (II) above
An animal name has been encoded using the letter to number correspondence abc de f 8hijk 1 m nopP arstu vH x y z e 1 2 3 4 5 6 7 8 9 1e 11 12 13 14 15 16 17 18 19 28 21 22 23 24 25 and the encryption function e:n + (n + 2) mod 26 The result is the secret identification kiwcpc . What is the animal? The answer will be a nonsense word (no numbers).