Answer:
Explanation:
Known Variables A = max Daily Rentals
X = Damaged helmets %
lets find the formula to calculate Helmets per location :taking 1st row as an example.
412 = B - (B*13/100)
412 = (100B-13B)/100
412*100 = 87B
B= 412*100/87
Hence, the generic formula becomes : B= A*100/(100-X)
Applying the same formula for each row and then using ROUND function of excel to round off the digits
=ROUND(number,digits) where number is the number you would like to round off and the digits is the number of decimal digits for it to round off. Since we want natural numbers in our example, we will be using digits as 0.
Explanation:
See attached pictures also.
Answer:
The program is written using PYTHON SCRIPT below;
N=int(input(" Enter number of Rows you want:"))
M=[] # this for storing the matrix
for i in range(N):
l=list(map(int,input("Enter the "+str(i+1)+" Row :").split()))
M.append(l)
print("The 2D Matrix is:\n")
for i in range(N):
print(end="\t")
print(M[i])
W=[] # to store the first non zero elemnt index
T=[] # to store that value is positive or negative
L=len(M[0])
for i in range(N):
for j in range(L):
if (M[i][j]==0):
continue
else:
W.append(j) # If the value is non zero append that postion to position list(W)
if(M[i][j]>0): #For checking it is positive or negative
T.append(+1)
else:
T.append(-1)
break
print()
print("The first Non Zero element List [W] : ",end="")
print(W)
print("Positive or Negative List [T] : ",end="")
print(T)
Explanation:
In order for the program to determine a set of test cases it takes in input of 2D matrix in an N numbet of rows.
It goes ahead to program and find the column index of the first non-zero value for each row in the matrix A, and also determines if that non-zero value is positive or negative. The If - Else conditions are met accordingly in running the program.
<u>C++ program - Insertion sort</u>
<u></u>
#include <bits/stdc++.h>
using namespace std;
/* Defining function for sorting numbers*/
void insertionSort(int array[], int n)
{
int i, k, a;
for(i=1;i<n;i++)
{
k=array[i];
a=i-1;
while(a>=0 && array[a] > k) // moving elements of array[0 to i-1] are greater than k, to one position //
{
array[a+1] = array[a];
a =a-1;
}
array[a+1] =k;
}
}
/* Driver function */
int main()
{
int array[] = { 12,56,76,43,21};
//input integers
int n = sizeof(array) / sizeof(array[0]);
//finding size of array
insertionSort(array, n);
//Calling function
for (int i = 0; i < n; i++)
//printing sorted array
cout << array[i] << " ";
cout << endl;
return 0;
}
Answer:
A
Explanation:
A system used for processing customer payments. A tool used to coordinate recruitment of new employees. A mobile app used by customers to place orders.
