## Computer Applications

Using switch statement, write a menu driven program for the following:

(a) To find and display the sum of the series given below:

S = x^{1} - x^{2} + x^{3} - x^{4} + x^{5} - ………… - x^{20}; where x = 2

(b) To display the series:

1, 11, 111, 1111, 11111

For an incorrect option, an appropriate error message should be displayed.

#### Java

#### Java Iterative Stmts

#### ICSE

45 Likes

### Answer

```
import java.util.Scanner;
public class KboatSeriesMenu
{
public static void main(String args[]) {
Scanner in = new Scanner(System.in);
System.out.println("1. Sum of the series");
System.out.println("2. Display series");
System.out.print("Enter your choice: ");
int choice = in.nextInt();
switch (choice) {
case 1:
int sum = 0;
for (int i = 1; i <= 20; i++) {
int term = (int)Math.pow(2, i);
if (i % 2 == 0)
sum -= term;
else
sum += term;
}
System.out.println("Sum=" + sum);
break;
case 2:
int term = 1;
for (int i = 1; i <= 5; i++) {
System.out.print(term + " ");
term = term * 10 + 1;
}
break;
default:
System.out.println("Incorrect Choice");
break;
}
}
}
```

### Output

Answered By

14 Likes

## Related Questions

Write a program to input a number. Check and display whether it is a Niven number or not. (A number is said to be Niven which is divisible by the sum of its digits).

Example: Sample Input 126

Sum of its digits = 1 + 2 + 6 = 9 and 126 is divisible by 9.Using switch statement, write a menu driven program to:

(a) find and display all the factors of a number input by the user ( including 1 and the excluding the number itself).

Example:

Sample Input : n = 15

Sample Output : 1, 3, 5(b) find and display the factorial of a number input by the user (the factorial of a non-negative integer n, denoted by n!, is the product of all integers less than or equal to n.)

Example:

Sample Input : n = 5

Sample Output : 5! = 1*2*3*4*5 = 120For an incorrect choice, an appropriate error message should be displayed.

Write a program to accept a number and check whether it is a 'Spy Number' or not. (A number is spy if the sum of its digits equals the product of its digits.)

Example: Sample Input: 1124

Sum of the digits = 1 + 1 + 2 + 4 = 8

Product of the digits = 1*1*2*4 = 8A special two-digit number is such that when the sum of its digits is added to the product of its digits, the result is equal to the original two-digit number.

Example: Consider the number 59.

Sum of digits = 5 + 9 = 14

Product of digits = 5 * 9 = 45

Sum of the sum of digits and product of digits = 14 + 45 = 59Write a program to accept a two-digit number. Add the sum of its digits to the product of its digits. If the value is equal to the number input, then display the message "Special two—digit number" otherwise, display the message "Not a special two-digit number".