Answer:
FOR i% = 1 TO 100
IF ((i%\3) = i%/3) AND ((i%\7) = i%/7) THEN
PRINT i%
END IF
NEXT i%
Explanation:
Of course using MOD would be cleaner, but another way to check if a number is integer divisable is to compare the outcome of an integer division to the outcome of a floating-point division. If they are equal, the division is an integer division.
The program outputs:
21
42
63
84
Well in my opinion is that yes they do. The ability to be able to communicate with others so far way really helps society advance towards the future. And i cant stress of how the benefits of being able to share ideas with well anyone is so wonderful.
I hope this helps.
Answer:
Following are the program in c language
#include <stdio.h> // header file
int main() // main method
{
char name[90]="mantasa"; // storing name
char add[90]="120 lal bangla mumbai"; // storing address
printf("\n Name:%s\nAddress:%s",name,add); // print name and address
return 0;
}
Output:
Name:mantasa
Address:120 lal bangla mumba
Explanation:
In this program we are declaring the two array of char type which will store the name and address . after that we display name and address.
<u>Answer:</u>
<em>Big data is to analyze large complex data.</em>
<u>Explanation:</u>
It is basically a data processing software which has overcome the disadvantage which we had in <em>the classical software where it was not able to manage huge data in a faster mode.</em>
The mean of an informational collection is found by including all numbers in the informational index and afterwards partitioning by the number of qualities in the set.
<em>To answer the question is the word big points to a number? I would say yes, since it can handle large amount of data, it is so called “Big data.</em>
The middle is the center worth when an informational collection is requested from least to most noteworthy. <em>The mode is the number that happens frequently in an informational index.</em>
Answer:
public static String repeat(String text, int repeatCount) {
if(repeatCount < 0) {
throw new IllegalArgumentException("repeat count should be either 0 or a positive value");
}
if(repeatCount == 0) {
return "";
} else {
return text + repeat(text, repeatCount-1);
}
}
Explanation:
Here repeatCount is an int value.
at first we will check if repeatCount is non negative number and if it is code will throw exception.
If the value is 0 then we will return ""
If the value is >0 then recursive function is called again untill the repeatCount value is 0.
