write a program C++ program and Use a recursive function that finds the n-th term using the following rule: tn=3tn-1+12tn-2 .
please help me out!
write a program using DO WHILE LOOP
Write a program that computes the cost of a long distance call. The cost of the call is determined
according to the following rate schedules.
a. A call made between 8:00 AM and 6:00 PM is billed at a rate of 6 rupees per minute.
b. A call made before 8:00 AM or after 6:00 PM is charged at a rate of 3.75 rupees.
According to this schedule, if a call starts at any time between 8:00 AM and 6:00 PM, and it ends
after 6:00 PM then it will be charged at the rate of 6 rupees per minute for the time before 6:00
PM and for the rest of the time the rate will be 3.75 rupees per minute. For example if a call
starts at 5:55 PM and ends at 6:05 PM then the charges on this call will be 48.75 (30 rupees for
first 5 minutes and 18.75 rupees for rest of the time).
Similarly if a call starts at the time before 8:00 AM but ends after 8:00 AM then it will be
charged at the rate of 3.75 rupees for the time before 8:00 AM and for remaining minutes after
8:00 AM the rate will be 6 rupees per minute. For example if a call starts at 7:49 AM and ends at
8:01 AM the charge on that call will be 47.25 rupees (41.25 for first 11 minutes and 6 rupees for
last minute).
The input to the program will consist of the time the call started, and the length of call in
minutes. The output will be the cost of call. The time is to be input in 24-hours notation, so the
time 1:30 PM is input as 13:30. The time will be input using two variables of type int, one used
for hour and other used for minutes. The number of the minutes for length of the call will also be
input as a value of type int.
After completing the program test it for following inputs. (first try to judge the answers manually
and then compare the values with the program output. I may be applying different test data to
test your program).
Input
Output
Start time
Length
Cost
8: 21 10 60
17:55 10
7:49 12
6:00 30
8:00 5
APPLIED PROGRAMMING (APR520S) ASSIGNMENT 1
Problem Solving Tools Total Marks: 50 Marks Due: Friday 22 August 2014
Suppose we want to construct a C/C++ program that can be used to calculate the area or the volume for a range of 2-D and 3-D shapes respectively. Consider only the following shapes.
(a) 2-dimensional shapes: triangle, square, rectangle, circle, and trapezium
(b) 3-dimensional shapes: cuboid, cylinder, cone, and sphere
Suppose that we want our program to firstly ask the user whether to calculate the area (2-D) or volume (3-D), then secondly ask for the type of the shape, then thirdly ask for inputs of all required dimensions, then fourthly calculate the required area or volume, and then finally display the required result to the user.
Required:
1. Construct a flowchart for this C/C++ program. [15]
2. Develop a pseudocode for this C/C++ program. [15]
3. Construct a hierarchy (structure) chart for this C/C++ program. [10]
4. Construct an IPO chart for this C/C++ program. [10]
Sure! I can help you with that. Here's a sample C++ program that uses a recursive function to find the n-th term using the given rule:
```cpp
#include <iostream>
using namespace std;
int nthTerm(int n) {
if (n == 0) {
return 0;
}
else if (n == 1) {
return 1;
}
else {
return 3 * nthTerm(n - 1) + 12 * nthTerm(n - 2);
}
}
int main() {
int n;
cout << "Enter the value of n: ";
cin >> n;
cout << "The " << n << "-th term is: " << nthTerm(n) << endl;
return 0;
}
```
Explanation:
1. We define a recursive function `nthTerm` that takes an integer `n` as its parameter and returns the n-th term.
2. In the `nthTerm` function, we have three base cases:
- If `n` is 0, we return 0 since the 0-th term is 0.
- If `n` is 1, we return 1 since the 1st term is 1.
- For any other value of `n`, we recursively calculate the n-th term using the given rule: `tn = 3tn-1 + 12tn-2`.
3. In the `main` function, we prompt the user to enter the value of `n`.
4. We call the `nthTerm` function with the given `n` and display the result.
You can run this program and provide a value for `n`, and it will calculate and display the n-th term based on the recursive function.