Pick the first four numbers of your index number eg. 0401 if index number is 04011212 i. 45 ii. 654 iii. 545 iv. 665 V. 6565 Use your index number as n1=0401 and let n2= 45. Using Fibonacci series, generate the values of n3 up to n10. Do this for i., ii, iv and v. b. Write the c++ code for generating i. а. Use the following information to solve i. and ii. Initial velocity = u Angle of fire e Time of flight to apex of trajectory = (uSin®)/g Total time of flight t = (2uSine)/g Range to apex of trajectory = (u²Sin20)/2g Total range s = (u²Sin20)/g Max altitude h = (uSin 0)²/(2g) i. Using simulation of 3 different angles and use graphs to show that the maximum range can only be achieved at angle 45 degrees if u is a constant. Explain your solution in ii. ii.

Pick the first four numbers of your index number eg. 0401 if index number is 04011212 i. 45 ii. 654 iii. 545 iv. 665 V. 6565 Use your index number as n1=0401 and let n2= 45. Using Fibonacci series, generate the values of n3 up to n10. Do this for i., ii, iv and v. b. Write the c++ code for generating i. а. Use the following information to solve i. and ii. Initial velocity = u Angle of fire e Time of flight to apex of trajectory = (uSin®)/g Total time of flight t = (2uSine)/g Range to apex of trajectory = (u²Sin20)/2g Total range s = (u²Sin20)/g Max altitude h = (uSin 0)²/(2g) i. Using simulation of 3 different angles and use graphs to show that the maximum range can only be achieved at angle 45 degrees if u is a constant. Explain your solution in ii. ii.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter7: Arrays

Section: Chapter Questions

Problem 7PP: (Numerical) Using the srand() and rand() C++ library functions, fill an array of 1000 floating-point...

See similar textbooks

Similar questions

Pick the first four numbers of your index number eg. 0401 if index number is 04011212 i. 45 ii. 654 iii. 545 iv. 665 v. 6565 a. Use your index number as n1=0401 and let n2= 45. Using Fibonacci series, generate the values of n3 up to n10. Do this for i., ii, iv and v. b. Write the c++ code for generating i.
Question 5 Use the first four numbers of the index number 04011212 i. 45 ii. 654 iii. 545 iv. 665 v. 6565 a. Use those first four index numbers for n1 and let n2= 45. Using Fibonacci series, generate the values of n3 up to n10. Do this for i., ii, iy and v b. Write the ct+ code for generating i.
Can you do number 15, 16 and 17 of just part h. Thank you
Find error in the code given below.
remaining two from 8. Just need D and E
Please help me write the new code using the given example
le.com/forms/d/e/1FAlpQLSc6PlhZGOLJ4LOHo5cCGEf9HDChfQ-tT1bES-BKgkKu44eEnw/formResponse The following iterative sequence is defined for the set of positive integers: Sn/2 3n +1 ifn is odd if n is even Un = Using the rule above and starting with 13, we generate the following sequence: 13 u13 = 40 u40 =20 u20 = 10→ u10 =5 u5 = 16 u16 = 8 ug = 4 → Us =2 u2 =1. It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. The below function takes as input an integer n and returns the number of terms generated by the sequence starting at n. function i-Seq (n) u=n; i=%3; while u =1 if statement 1 u=u/2; else statement 2 end i=i+1; end statement 1 and statement 2 should be replaced by: None of the choices statement 1 is "mod(u,2)=D%3D0" and statement 2 is "u = 3*u+1;" statement 1 is "u%2" and statement 2 is "u = 3*u+1;" O statement 1 is "mod(n,2)=30" and statement 2 is "u = 3*n+1;"
Rewrite a and b in index notation, and rewrite c and d in direct notation. a. k O m + Y™N b. tr(Q)(A·x) c. X¡BjkYk d. XmAikYmBxj
(Numerical) Using the srand() and rand() C++ library functions, fill an array of 1000 floating-point numbers with random numbers that have been scaled to the range 1 to 100. Then determine and display the number of random numbers having values between 1 and 50 and the number having values greater than 50. What do you expect the output counts to be?
Pls help with this homework.
Create a recursive function that multiplies two positive integers without the need of the * (or /) operator. You can utilise addition, subtraction, and bit shifting, but you should keep the amount of operations to a minimum.
Let A = {a, b, c} and B = {u, v}. Write a. A × B b. B × A