Scribd
Upload
975 views

Assignment: JAVA: AIM: Write A Menu Driven Java Program Which Will Read A Number and Should

The document describes a Java program that implements a menu with options to: 1) Calculate the factorial of a number, 2) Check if a number is Armstrong, 3) Check if a number is a palindrome, 4) Check if a number is prime, and 5) Print the Fibonacci series up to a given limit. The program uses classes, methods, conditionals, loops, and user input to perform the requested operations and return the appropriate output for each selection from the menu.

Uploaded by

Shubham Dhumal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
975 views

Assignment: JAVA: AIM: Write A Menu Driven Java Program Which Will Read A Number and Should

The document describes a Java program that implements a menu with options to: 1) Calculate the factorial of a number, 2) Check if a number is Armstrong, 3) Check if a number is a palindrome, 4) Check if a number is prime, and 5) Print the Fibonacci series up to a given limit. The program uses classes, methods, conditionals, loops, and user input to perform the requested operations and return the appropriate output for each selection from the menu.

Uploaded by

Shubham Dhumal
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 5

Assignment: JAVA

AIM: Write a menu driven Java program which will read a number and should
implement the following methods 1. factorial() 2. testArmstrong() 3.
testPalindrome() 4. testPrime() 5. fibonacciSeries()

PROGRAM:
package menujava;
import java.util.Scanner;
public class Main {
Scanner sc;
Main() {
sc = new Scanner(System.in);
}
void factorial() {
int num, fact;
fact = 1;

System.out.print("Enter a number to calculate factorial: ");


num = sc.nextInt();

for (int i = 1; i <= num; i++) {


fact *= i;
}

System.out.println(num + "!" + " = " + fact);


}

void testArmstrong() {
int num, temp,n=0;
int sum = 0;

System.out.print("Enter a number to check if it is armstrong: ");


num = sc.nextInt();
temp = num;

while(temp % 10 != 0){
temp = temp / 10;
n++;
}
temp = num;

while (temp != 0) {
sum += (int) Math.pow(temp % 10, n);
temp /= 10;
}
System.out.println(num == sum ? num + " is an armstrong number" : num + "
is not an armstrong number");
}

void testPalindrome() {
int r,sum=0,temp;
System.out.print("Enter the no. to check pallindrome : ");

int n= sc.nextInt();//It is the number variable to be checked for palindrome

temp=n;
while(n>0){
r=n%10; //getting remainder
sum=(sum*10)+r;
n=n/10;
}
if(temp==sum)
System.out.println("palindrome number ");
else
System.out.println("not palindrome");
}
void testPrime() {
int num, ct;
ct = 0;
System.out.print("Enter a number to check if it is prime: ");
num = sc.nextInt();

for (int i = 1; i <= num; i++) {


if (num % i == 0)
ct++;
}
System.out.println(ct == 2 ? num + " is a prime number" : num + " is not a
prime number");
}
void fibonacciSeries() {
System.out.print("Enter the no. to find fibbonacci series : ");
int count =sc.nextInt();
int n1=0,n2=1,n3,i;
System.out.print(n1+" "+n2);//printing 0 and 1

for(i=2;i<count;++i) {
n3=n1+n2;
System.out.print(" "+n3);
n1=n2;
n2=n3;
}
}
public static void main(String[] args) {
Main obj = new Main();
Scanner sc = new Scanner(System.in);
int choice;
choice = 0;

do {
System.out.println("\n\tMenu");
System.out.println("1. Factorial of a number");
System.out.println("2. Test if a number is Armstrong");
System.out.println("3. Test if a number is Palindrome");
System.out.println("4. Test if a number is Prime");
System.out.println("5. Fibonacci series till a limit");
System.out.println("6. Exit");
System.out.print("Your choice: ");
choice = sc.nextInt();

switch (choice) {
case 1: obj.factorial();
break;

case 2: obj.testArmstrong();
break;

case 3: obj.testPalindrome();
break;

case 4: obj.testPrime();
break;

case 5: obj.fibonacciSeries();
break;

case 6: System.out.println("\nExited Succesfully!");


break;

default: System.out.println("Wrong Choice, Please Try Again!");


}
} while (choice != 6);
}
}

OUTPUT:
Conclusion: In this way, we could implement a menu driven Java program which
will read a number and should implement the above methods.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy