Java Programming Solutions
1. Largest of n natural numbers
import [Link].*;
class LargestNumber {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
[Link]("Enter n: ");
int n = [Link]();
int max = Integer.MIN_VALUE;
for(int i = 0; i < n; i++) {
int num = [Link]();
if(num > max) max = num;
}
[Link]("Largest number = " + max);
}
}
2. Prime number check
import [Link].*;
class PrimeCheck {
public static void main(String[] args) {
Scanner sc = new Scanner([Link]);
int n = [Link]();
boolean isPrime = true;
if(n <= 1) isPrime = false;
for(int i = 2; i <= n/2; i++) {
if(n % i == 0) {
isPrime = false;
break;
}
}
[Link](isPrime ? "Prime" : "Not Prime");
}
}
3. Menu Driven (Fibonacci & Factorial)
import [Link].*;
class MenuProgram {
static void fibonacci(int n){
int a=0,b=1;
for(int i=0;i<n;i++){
[Link](a+" ");
int c=a+b;
a=b;
b=c;
}
}
static int factorial(int n){
int fact=1;
for(int i=1;i<=n;i++) fact*=i;
return fact;
}
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
[Link]("[Link] [Link]");
int ch=[Link]();
[Link]("Enter number: ");
int n=[Link]();
switch(ch){
case 1: fibonacci(n); break;
case 2: [Link](factorial(n)); break;
}
}
}
4. Odd or Even
import [Link].*;
class OddEven {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n=[Link]();
[Link](n%2==0?"Even":"Odd");
}
}
5. Palindrome String
import [Link].*;
class Palindrome {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
String s=[Link]();
String rev=new StringBuilder(s).reverse().toString();
[Link]([Link](rev)?"Palindrome":"Not Palindrome");
}
}
6. Sum, Product and Reverse
import [Link].*;
class DigitOps {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n=[Link]();
int sum=0,prod=1,rev=0;
while(n>0){
int d=n%10;
sum+=d;
prod*=d;
rev=rev*10+d;
n/=10;
}
[Link]("Sum="+sum+" Product="+prod+" Reverse="+rev);
}
}
7. Array comparison
import [Link].*;
class ArrayCompare {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int arr[]=new int[10];
for(int i=0;i<10;i++) arr[i]=[Link]();
int key=[Link]();
int eq=0,gt=0,lt=0;
for(int x:arr){
if(x==key) eq++;
else if(x>key) gt++;
else lt++;
}
[Link]("Equal="+eq+" Greater="+gt+" Less="+lt);
}
}
8. Prices Average
import [Link].*;
class Prices {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
double arr[]=new double[5];
double sum=0;
for(int i=0;i<5;i++){
arr[i]=[Link]();
sum+=arr[i];
}
double avg=sum/5;
[Link]("Average="+avg);
for(double x:arr){
if(x>avg) [Link](x);
}
}
}
9. Armstrong numbers
import [Link].*;
class Armstrong {
static boolean isArmstrong(int n){
int sum=0,temp=n;
int digits=[Link](n).length();
while(temp>0){
int d=temp%10;
sum+=[Link](d,digits);
temp/=10;
}
return sum==n;
}
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int n=[Link]();
int arr[]=new int[n];
for(int i=0;i<n;i++) arr[i]=[Link]();
for(int x:arr){
if(isArmstrong(x)) [Link](x);
}
}
}
10. Matrix Operations
import [Link].*;
class MatrixOps {
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
int a[][]=new int[2][2];
int b[][]=new int[2][2];
int c[][]=new int[2][2];
for(int i=0;i<2;i++)
for(int j=0;j<2;j++){
a[i][j]=[Link]();
b[i][j]=[Link]();
c[i][j]=a[i][j]+b[i][j];
}
[Link]("Addition:");
for(int i=0;i<2;i++){
for(int j=0;j<2;j++)
[Link](c[i][j]+" ");
[Link]();
}
[Link]("Transpose:");
for(int i=0;i<2;i++){
for(int j=0;j<2;j++)
[Link](a[j][i]+" ");
[Link]();
}
}
}
11. Function Overloading (Area)
class Area {
void area(double r){
[Link]("Circle="+3.14*r*r);
}
void area(double l,double b){
[Link]("Rectangle="+l*b);
}
void area(double r,double h,boolean cyl){
[Link]("Cylinder="+2*3.14*r*(r+h));
}
public static void main(String[] args){
Area a=new Area();
[Link](5);
[Link](4,6);
[Link](3,7,true);
}
}
12. Multiple Inheritance using Interfaces
interface Rect{
void rectArea(int l,int b);
}
interface Tri{
void triArea(int b,int h);
}
class AreaImpl implements Rect,Tri{
public void rectArea(int l,int b){
[Link]("Rectangle="+l*b);
}
public void triArea(int b,int h){
[Link]("Triangle="+0.5*b*h);
}
public static void main(String[] args){
AreaImpl a=new AreaImpl();
[Link](4,5);
[Link](3,6);
}
}
13. Applet Frame Window
import [Link].*;
import [Link].*;
public class MyApplet extends Applet{
public void paint(Graphics g){
[Link]("Name: ABC",50,50);
[Link]("Address: XYZ",50,70);
[Link]("Qualification: [Link]",50,90);
}
}
14. Draw Line
import [Link].*;
import [Link].*;
class LineDraw extends JPanel{
protected void paintComponent(Graphics g){
[Link](g);
[Link](50,50,200,200);
}
public static void main(String[] args){
JFrame f=new JFrame();
[Link](new LineDraw());
[Link](300,300);
[Link](true);
}
}
15. Graphics Shapes
import [Link].*;
import [Link].*;
class Shapes extends JPanel{
protected void paintComponent(Graphics g){
[Link](g);
[Link](10,10,50,50);
[Link](70,10,50,50);
[Link](130,10,50,50,0,180);
int x[]={200,220,240};
int y[]={50,10,50};
[Link](x,y,3);
}
public static void main(String[] args){
JFrame f=new JFrame();
[Link](new Shapes());
[Link](300,200);
[Link](true);
}
}
16. Number Format Exception
import [Link].*;
class ExceptionDemo{
public static void main(String[] args){
Scanner sc=new Scanner([Link]);
try{
int a=[Link]([Link]());
int b=[Link]([Link]());
[Link](a+b);
}catch(NumberFormatException ex){
[Link]([Link]());
}
}
}
17. String Operations
class StringOps{
public static void main(String[] args){
String a="Hello";
String b="World";
[Link]([Link](b));
[Link](a+b);
[Link]([Link]());
}
}
18. Fraction Class
class Fraction{
int num,den;
Fraction(int n,int d){
num=n;
den=d;
}
void display(){
[Link](num+"/"+den);
}
public static void main(String[] args){
Fraction f=new Fraction(3,4);
[Link]();
}
}
