Answer:
1) List
2) Dictionary
3) Tuple
Explanation:
A list uses square brackets. It is used to store multiple items in just one variable. They are usually changeable and give room for duplicates. You use append to add to the collection.
A dictionary uses curly brackets. You use update to add to the collection. A dictionary is created by placing the elements in curly brackets and separating them with a comma. It is changeable and it does not give room for duplicates.
A tuple uses parentheses. You cannot change it once you create it. It is an ordered list of elements that is finite and can also store multiple items in one variable.
The simple interset program is a sequential program, and does not require loops and conditions
The simple interset program in Python, where comments are used to explain each line is as follows:
#This gets input for the principal amount
P = int(input("P = "))
#This gets input for the rate
R = int(input("R = "))
#This gets input for the number of years
N = int(input("N = "))
#This calculates the simple interest
I = P * R * T * 0.01
#This prints the simple interest
print("Simple Interest =",I)
Read more about simple interest at:
brainly.com/question/2294792
Answer:
Answer explained
Explanation:
From the previous question we know that while searching for n^(1/r) we don't have to look for guesses less than 0 and greater than n. Because for less than 0 it will be an imaginary number and for rth root of a non negative number can never be greater than itself. Hence lowEnough = 0 and tooHigh = n.
we need to find 5th root of 47226. The computation of root is costlier than computing power of a number. Therefore, we will look for a number whose 5th power is 47226. lowEnough = 0 and tooHigh = 47226 + 1. Question that should be asked on each step would be "Is 5th power of number < 47227?" we will stop when we find a number whose 5th power is 47226.
// making the class
class Counter {
int counter;
int limit;
// Constructor
Counter(int a, int b){
counter = a;
limit = b;
}
// static function to increment
static increment(){
if(counter<limit)
nCounter+=1;
}
// Decrement function
void decrement(){
if(counter>0)
nCounter-=1;
}
int getValue(){
return counter;
}
static int nCounter;
int getNCounters(){
return nCounter;
}
};
// Initializa the static
int Counter::nCounter = 0;
