Answer:
//here is code in c++.
#include <bits/stdc++.h>
using namespace std;
int main()
{
// variable
int temp;
cout<<"Please enter the temperature:";
//read temperature from user
cin>>temp;
int n;
// reduce the case for switch
n=temp/10;
// print output according to the switch case
switch (n) {
case 7:
case 6:
cout<<"tennis"<<endl;
break;
case 5:
case 4:
cout<<"golf"<<endl;
break;
default:
if(temp>=80)
cout<<"swimming"<<endl;
else
cout<<"skiing"<<endl;
break;
}
return 0;
}
Explanation:
Read the value of temperature from user and assign it to variable "temp".
Calculate n=temp/10, to limit the number of cases in the switch statement.
if temperature is greater or equal 60 & less than 80, it will print "tennis".
If temperature is greater or equal 40 & less than 60, it will print "golf".
in default case, if temperature is greater than 80, it will print "swimming".
if less than 40, print "skiing".
Output:
Please enter the temperature::67
tennis
Answer:
Yes, the prices are anywhere from $30-$100 dollars+tax
https://www.kohls.com/catalog/juniors-homecoming-dresses-clothing.jsp?CN=Gender:Juniors+Occasion:Homecoming+Category:Dresses+Department:Clothing
Big-O notation is a way to describe a function that represents the n amount of times a program/function needs to be executed.
(I'm assuming that := is a typo and you mean just =, by the way)
In your case, you have two loops, nested within each other, and both loop to n (inclusive, meaning, that you loop for when i or j is equal to n), and both loops iterate by 1 each loop.
This means that both loops will therefore execute an n amount of times. Now, if the loops were NOT nested, our big-O would be O(2n), because 2 loops would run an n amount of times.
HOWEVER, since the j-loop is nested within i-loop, the j-loop executes every time the i-loop <span>ITERATES.
</span>
As previously mentioned, for every i-loop, there would be an n amount of executions. So if the i-loop is called an n amount of times by the j loop (which executes n times), the big-O notation would be O(n*n), or O(n^2).
(tl;dr) In basic, it is O(n^2) because the loops are nested, meaning that the i-loop would be called n times, and for each iteration, it would call the j-loop n times, resulting in n*n runs.
A way to verify this is to write and test program the above. I sometimes find it easier to wrap my head around concepts after testing them myself.
Answer:
Charge back.
Explanation:
A chargeback is a charge that is returned to a payment card after a customer successfully disputes an item on their account transactions report. Simply put, it is the reversal of a credit card payment that comes directly from the bank.
Most commonly the payer is a consumer.
A chargeback may occur on bank accounts or credit cards. They can be granted to a cardholder for a variety of reasons. A chargeback can be considered a refund since it returns specified funds taken from an account through a prior purchase. Chargebacks are focused on charges that have been fully processed and settled. Chargebacks can often take several days for full settlement as they must be reversed through an electronic process involving multiple entities.
The chargeback is ordered by the bank that issued the consumer's payment card.
1. It is based on scientific and technological advancements.
2. It is more a practical discipline and less a theoretical one.
3. It is a fast growing modern discipline.
4. It makes use of the research findings of psychology, sociology, engineering, sciences and social psychology etc., and applies the same to the field of education.
5. It brings pupils, teachers and technical means together in an effective way.
6. It is the science of techniques and methods. It locates the problems in the field of education, remedies them and ultimately aims at improving the education system.
7. It is bound to improve the teacher, the learner and the teaching learning process.
