Page 195 - CA_Blue( J )_Class10
P. 195
{ if(i%2==0)
s=s-Math.pow(x, i);
else
s=s+Math.pow(x, i);
}
System.out.println("Result = " + s);
break;
case 2:
for(i = 1; i <= 5; i++) {
p = p*10+1;
System.out.print(p + " ");
}
break;
default: System.out.println ("Wrong choice");
}
}
}
25. Design a class to overload a function sumSeries() as follows:
(i) void sumSeries(int n, double x): with one integer argument and one double argument to find and display the sum of the
series given below:
s = x / 1 - x / 2 + x / 3 - x / 4 + x / 5 … N terms.
(ii) void sumSeries(): to find and display the sum of the following series:
s = 1 + (1 × 2) + (1 × 2 × 3) + … + (1 × 2 × 3 × 4 … × 20) [2016]
Ans. class Overload{
void sumSeries(int n, double x){
double sum = 0.0,r,i;
for( i = 1; i <= n; i++){
if(i%2==0)
{ sum -= x/i; }
else
{ sum += x/i; }
}
System.out.println("Sum = " + sum);
}
void sumSeries(){
long sum = 0L,p=1L;
int i;
for(i = 1; i <= 20; i++){
p=p*i;
sum += p;
}
System.out.println("Sum = " + sum);
}
void main()
{ sumSeries(4,2.0);
sumSeries();
}
}
26. Write a program to accept a number and check and display whether it is a Niven number or not. Niven number is that number
that is divisible by its sum of digits.
Example: Consider the number 126.
Sum of its digits is 1 + 2 + 6 = 9, and 126 is divisible by 9. [2016]
Ans. import java.util.*;
class Niven{
public static void main()
{
Scanner sc= new Scanner(System.in);
int n,s=0,i;
System.out.print("Enter the number: ");
193
Iterative constructs in Java 193

