I think it is 3 no? Maybe I dunno but I am confident
Answer:
It depends on the situation
import "from random import randrange"
for printing random numbers between integers "random.randrange(num1, num2"
Syntax:
"random.randrange(start, stop, step)"
Parameter Values:
start - optional - an integer defining which position to start - default = 0
stop - required - an integer defining which position to end.
step - optional - an integer define the incrementation - default = 1
Explanation:
The syntax is a bit weird but I hope I was a help
The question above has multiple choices as follows.
<span>a.
</span>App extensions
<span>b.
</span>Sitelink extensions
<span>c.
</span>Structured snippet extensions
<span>d.
</span>RSLAs (remarketing lists for search ads)
The correct answer is (A) App extensions
App extensions are a great way for people to access your
website. They allow you to link to your tablet or mobile app from your text adds.
If you want to drive app downloads, app promo ads might be the best option.
Answer:
The code to the given question can be given as:
Code:
1)
2 arrays that used to store 10 employee identification number and grosspay amount in parallel and its data-type is int and double.
int Employee_id[10]; //array that store integer value
double Weekly_Gross_Pay[10]; //array that store double value
2)
Define loop for print the details of employees’ identification number and weekly gross pay.
for(int i=0; i<10; i++)
{
cout <<Employee_id[i] <<" " << Weekly_Gross_Pay[i] << endl;
}
Explanation:
The explanation of the above code can be given as:
In Code (1) we declare two array that's data-type is integer and double. In Employee_id array it store the integer values and Weekly_Gross_Pay it store the double value.
In Code(2) It is used to print the value of array. In that code, we used for a loop because of its entry control loop and we know the size of the array. In this loop, we declare a variable (i) and initialized the value 0 and check the condition(i)less than 1 and increment of i. It prints all the 10 values.
