Distributed Denial of Service /<span> </span><span>DDoS</span>
Answer:
Hi!
The correct answer is E.
Explanation:
void change(int ar[], int low, inthigh) {
int temp;
if(low< high) { <em>// here ask if the positions low and high of the array are the same.</em>
temp= ar[low]; <em>// first, saves the element on ar[low] in temp.</em>
ar[low]= ar[high]; <em>// second, the element on ar[high] in ar[low]. First switch.</em>
ar[high]= temp; <em>// third, saves the element on temp in ar[high]. Complete switch.</em>
change(ar,low + 1, high - 1); <em>// Recursive call, adding one position to low, and subtracting one position to high. </em><em>Important: </em><em>When low and high have the same value, the recursive call will finish.</em>
}
}
Result: Switch the lower half of elements in the array with the upper half.
Answer:
The answer is "Option d".
Explanation:
Please find the complete question in the attached file.
Answer:
Explanation:
#include <iostream>
using namespace std;
// Recipe of single portion salad
int main()
{
float Qing[3]={0.0,0.0,0.0};
string ItemName[3]={" "," "," "};
int qty=0;
cout<<"Please enter 3 Ingredients required for Salad and Quantity required for a single serve"<<endl;
for (int i=0;i<3;i++)
{
cout<<"Enter the ingredient number "<<(i+1)<<" :";
cin>>ItemName[i];
cout<<"Qty required for single serve (in Oz) :";
cin>>Qing[i];
}
cout<<"Number of servings required :";
cin>>qty;
cout<<endl<<"Total Quantities required for "<<qty<<" servings"<<endl;
for (int i=0;i<3;i++)
{
cout<<ItemName[i]<<" Qty for "<<qty<<" servings :"<<(Qing[i]*qty)<<" Oz."<<endl;
}
return 0;
}
// You can run this after compiling without any problem.
I'm not absolutely positive that my answer is correct... but here's what I got...
Mother: 33 years old
Daughter: 15 years old
