Answer:
Decision making structures require that the programmer specify one or more conditions to be evaluated or tested by the program, along with a statement or statements to be executed if the condition is determined to be true, and optionally, other statements to be executed if the condition is determined to be false.
Answer:
By Using the Greedy- Activity- Selection algorithm
Explanation:
The Greedy- Activity- Selection algorithm in this case involves
First finding a maximum size set S1, of compatible activities from S for the first lecture hall.
Then using it again to find a maximum size set S2 of compatible activities from S - S1 for the second hall.
This is repeated till all the activities are assigned.
It requires θ(n2) time in its worse .
<u> C++ Program to Print Pascal's Triangle</u>
#include<iostream>
//header file
using namespace std;
//driver function
int main()
{
int r;/*declaring r for Number of rows*/
cout << "Enter the number of rows : ";
cin >> r;
cout << endl;
for (int a = 0; a < r; a++)
{
int value = 1;
for (int b = 1; b < (r - a); b++)
/*Printing the indentation space*/
{
cout << " ";
}
for (int c = 0; c <= a; c++)
/*Finding value of binomial coefficient*/
{
cout << " " << value;
value = value * (a - c) / (c + 1);
}
cout << endl << endl;
}
cout << endl;
return 0;
}
<u>Output</u>
<u>Enter the number of rows : 5</u>
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
Answer:
Several of the subsystems evolved during the program through design changes: The parachute system, essential for booster recovery, was redesigned with larger parachutes in 1983. Frangible nuts, used in the space shuttle pad hold down and release system, were redesigned in 2008.
Try downloading an app if the phone is not doing it.
