Scribd
Upload
2 views19 pages

Project Question For Java

The document contains a series of Java programming exercises that cover various topics such as calculating discounts on laptops, checking for prime palindromes, population growth, student eligibility based on marks, salary calculations with tax, and function overloading for geometric calculations. Each question includes a class definition with methods for accepting input, processing data, and displaying results. The exercises also explore concepts like pronic numbers, twisted primes, Niven numbers, spy numbers, magic numbers, and converting between decimal and binary.

Uploaded by

loftypraise16wt
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
2 views19 pages

Project Question For Java

The document contains a series of Java programming exercises that cover various topics such as calculating discounts on laptops, checking for prime palindromes, population growth, student eligibility based on marks, salary calculations with tax, and function overloading for geometric calculations. Each question includes a class definition with methods for accepting input, processing data, and displaying results. The exercises also explore concepts like pronic numbers, twisted primes, Niven numbers, spy numbers, magic numbers, and converting between decimal and binary.

Uploaded by

loftypraise16wt
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Part 1: Questions 1–5

Question 1: Laptop Discount


import [Link];

class Laptop
{
String name;
double price, dis, amt;

Laptop()
{
name = "";
price = dis = amt = 0;
}

void accept()
{
Scanner sc = new Scanner([Link]);

[Link]("Enter Customer Name: ");


name = [Link]();

[Link]("Enter Laptop Price: ");


price = [Link]();
}

void discount()
{
if(price <= 25000)
dis = price * 5 / 100;
else if(price <= 50000)
dis = price * 7.5 / 100;
else if(price <= 100000)
dis = price * 10 / 100;
else
dis = price * 15 / 100;

amt = price - dis;


}

void display()
{
[Link]("\nCustomer Name : " + name);
[Link]("Discount : " + dis);
[Link]("Amount Payable: " + amt);
}

public static void main(String args[])


{
Laptop obj = new Laptop();
[Link]();
[Link]();
[Link]();
}
}
Question 2: Prime Palindrome
import [Link];

class Calculate
{
int num, f, rev;

Calculate(int n)
{
num = n;
f = 0;
rev = 0;
}

int prime()
{
int c = 0;

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


{
if(num % i == 0)
c++;
}

if(c == 2)
return 1;
else
return 0;
}

int reverse()
{
int t = num;

while(t > 0)
{
rev = rev * 10 + t % 10;
t /= 10;
}

return rev;
}

void display()
{
if(prime() == 1 && reverse() == num)
[Link]("Prime Palindrome");
else
[Link]("Not a Prime Palindrome");
}

public static void main(String args[])


{
Scanner sc = new Scanner([Link]);

[Link]("Enter Number: ");


int n = [Link]();

Calculate obj = new Calculate(n);


[Link]();
}
}

Question 3: Population Growth


import [Link];

class Population
{
float p, r;

Population(int a, int b)
{
p = a;
r = b;
}

void print()
{
for(int year = 2001; year <= 2007; year++)
{
p = p * (1 + r / 100);

[Link]("Population at the end of " + year + " = " +


p);
}
}

public static void main(String args[])


{
Scanner sc = new Scanner([Link]);

[Link]("Enter Initial Population: ");


int p = [Link]();

[Link]("Enter Growth Rate: ");


int r = [Link]();

Population obj = new Population(p, r);

[Link]();
}
}

Question 4: Student Eligibility


import [Link];

class Student
{
String name;
int mm, scm;
double comp;

Student()
{
Scanner sc = new Scanner([Link]);

[Link]("Enter Name: ");


name = [Link]();

[Link]("Math Marks: ");


mm = [Link]();

[Link]("Science Marks: ");


scm = [Link]();

[Link]("Computer Marks: ");


comp = [Link]();
}

String check()
{
double avg = (mm + scm + comp) / 3;

if(mm >= 90 && scm >= 90 && comp >= 90)


return "Science with Computer";

else if(avg >= 90)


return "Bio-Science";

else if(avg >= 80)


return "Science with Hindi";

else
return "Not Eligible";
}

void display()
{
[Link]("Student : " + name);
[Link]("Eligibility : " + check());
}

public static void main(String args[])


{
Student obj = new Student();
[Link]();
}
}

Question 5: Salary
import [Link];

class Salary
{
String name, address, phone, subject;
double monthlySalary, incomeTax;

void accept()
{
Scanner sc = new Scanner([Link]);
[Link]("Name: ");
name = [Link]();

[Link]("Address: ");
address = [Link]();

[Link]("Phone: ");
phone = [Link]();

[Link]("Subject Specialisation: ");


subject = [Link]();

[Link]("Monthly Salary: ");


monthlySalary = [Link]();
}

void compute()
{
double annual = monthlySalary * 12;

if(annual > 175000)


incomeTax = (annual - 175000) * 5 / 100;
else
incomeTax = 0;
}

void display()
{
[Link]("\nName : " + name);
[Link]("Address : " + address);
[Link]("Phone : " + phone);
[Link]("Subject : " + subject);
[Link]("Annual Income Tax : " + incomeTax);
}

public static void main(String args[])


{
Salary obj = new Salary();
[Link]();
[Link]();
[Link]();
}
}
Question 6: Area using Function Overloading
import [Link].*;

class Area
{
void area(double base, double ht)
{
[Link]("Area of Parallelogram = " + (base * ht));
}

void area(double d1, double d2, char ch)


{
[Link]("Area of Rhombus = " + (0.5 * d1 * d2));
}

void area(double a, double b, double h)


{
[Link]("Area of Trapezium = " + (0.5 * (a + b) * h));
}

public static void main(String args[])


{
Area obj = new Area();

[Link](12, 8);
[Link](10, 12, 'R');
[Link](8, 10, 5);
}
}

Question 7: Perimeter using Function Overloading


class Perimeter
{
void perimeter(int s)
{
[Link]("Perimeter of Square = " + (4 * s));
}

void perimeter(int l, int b)


{
[Link]("Perimeter of Rectangle = " + (2 * (l + b)));
}

void perimeter(double r)
{
[Link]("Perimeter of Circle = " + (2 * 22 * r / 7));
}

public static void main(String args[])


{
Perimeter obj = new Perimeter();

[Link](5);
[Link](8,6);
[Link](7.0);
}
}
Question 8: Function Overloading (calculate)
class Calculate
{
void calculate(int m, char ch)
{
if(ch=='s')
{
if(m%7==0)
[Link]("Divisible by 7");
else
[Link]("Not Divisible by 7");
}
else
{
if(m%10==7)
[Link]("Last digit is 7");
else
[Link]("Last digit is not 7");
}
}

void calculate(int a,int b,char ch)


{
if(ch=='g')
[Link]("Greater = "+[Link](a,b));
else
[Link]("Smaller = "+[Link](a,b));
}

public static void main(String args[])


{
Calculate obj=new Calculate();

[Link](49,'s');
[Link](127,'a');
[Link](20,35,'g');
[Link](20,35,'s');
}
}

Question 9: Function Overloading (compare)


class Compare
{
void compare(int a,int b)
{
[Link]("Greater Integer = "+[Link](a,b));
}

void compare(char a,char b)


{
if(a>b)
[Link]("Higher Character = "+a);
else
[Link]("Higher Character = "+b);
}

void compare(String s1,String s2)


{
if([Link]()>[Link]())
[Link]("Longer String = "+s1);
else
[Link]("Longer String = "+s2);
}

public static void main(String args[])


{
Compare obj=new Compare();

[Link](20,40);
[Link]('A','Z');
[Link]("Computer","Java");
}
}

Question 10: Function Overloading (num_calc)


class NumCalc
{
void num_calc(int num,char ch)
{
if(ch=='s')
[Link]("Square = "+(num*num));
else
[Link]("Cube = "+(num*num*num));
}

void num_calc(int a,int b,char ch)


{
if(ch=='p')
[Link]("Product = "+(a*b));
else
[Link]("Sum = "+(a+b));
}

void num_calc(String s1,String s2)


{
if([Link](s2))
[Link]("Strings are Equal");
else
[Link]("Strings are Not Equal");
}

public static void main(String args[])


{
NumCalc obj=new NumCalc();

obj.num_calc(5,'s');
obj.num_calc(4,'c');
obj.num_calc(5,6,'p');
obj.num_calc(5,6,'a');
obj.num_calc("JAVA","JAVA");
}
}
Question 11: Pronic Number
import [Link].*;

class Pronic
{
public static void main(String args[])
{
Scanner sc = new Scanner([Link]);

[Link]("Enter a Number: ");


int n = [Link]();

boolean flag = false;

for(int i = 1; i <= n; i++)


{
if(i * (i + 1) == n)
{
flag = true;
break;
}
}

if(flag)
[Link](n + " is a Pronic Number.");
else
[Link](n + " is not a Pronic Number.");
}
}

Question 12: Twisted Prime


import [Link].*;

class TwistedPrime
{
static boolean prime(int n)
{
if(n < 2)
return false;

for(int i = 2; i <= [Link](n); i++)


{
if(n % i == 0)
return false;
}
return true;
}

public static void main(String args[])


{
Scanner sc = new Scanner([Link]);

[Link]("Enter a Number: ");


int n = [Link]();

int rev = 0, temp = n;


while(temp > 0)
{
rev = rev * 10 + temp % 10;
temp /= 10;
}

[Link]("Reverse = " + rev);

if(prime(n) && prime(rev))


[Link](n + " is a Twisted Prime.");
else
[Link](n + " is not a Twisted Prime.");
}
}

Question 13: Niven Number


import [Link].*;

class Niven
{
public static void main(String args[])
{
Scanner sc = new Scanner([Link]);

[Link]("Enter a Number: ");


int n = [Link]();

int sum = 0;
int temp = n;

while(temp > 0)
{
sum += temp % 10;
temp /= 10;
}

if(n % sum == 0)
[Link](n + " is a Niven Number.");
else
[Link](n + " is not a Niven Number.");
}
}

Question 14: Spy Number


import [Link].*;

class SpyNumber
{
public static void main(String args[])
{
Scanner sc = new Scanner([Link]);

[Link]("Enter a Number: ");


int n = [Link]();
int sum = 0;
int product = 1;
int temp = n;

while(temp > 0)
{
int digit = temp % 10;
sum += digit;
product *= digit;
temp /= 10;
}

if(sum == product)
[Link](n + " is a Spy Number.");
else
[Link](n + " is not a Spy Number.");
}
}

Question 15: Magic Number


import [Link].*;

class MagicNumber
{
public static void main(String args[])
{
Scanner sc = new Scanner([Link]);

[Link]("Enter a Number: ");


int n = [Link]();

int sum = n;

while(sum > 9)
{
int s = 0;

while(sum > 0)
{
s += sum % 10;
sum /= 10;
}

sum = s;
}

if(sum == 1)
[Link](n + " is a Magic Number.");
else
[Link](n + " is not a Magic Number.");
}
}
Question 16: Menu Driven Pattern Program
import [Link].*;

class Pattern
{
public static void main(String args[])
{
Scanner sc = new Scanner([Link]);

[Link]("MENU");
[Link]("1. Pattern 1");
[Link]("2. Pattern 2");
[Link]("Enter Choice: ");
int ch = [Link]();

switch(ch)
{
case 1:
for(int i=1;i<=5;i++)
{
for(int j=1;j<=i;j++)
[Link]("* ");
[Link]();
}
break;

case 2:
for(int i=5;i>=1;i--)
{
for(int j=1;j<=i;j++)
[Link]("* ");
[Link]();
}
break;

default:
[Link]("Invalid Choice");
}
}
}

Question 17: Decimal to Binary and Binary to Decimal


import [Link].*;

class Number
{
void decimalToBinary(int n)
{
String bin="";

while(n>0)
{
bin=n%2+bin;
n=n/2;
}

[Link]("Binary = "+bin);
}

void binaryToDecimal(int n)
{
int dec=0,p=0;

while(n>0)
{
int d=n%10;
dec=dec+d*(int)[Link](2,p);
p++;
n=n/10;
}

[Link]("Decimal = "+dec);
}

public static void main(String args[])


{
Scanner sc=new Scanner([Link]);

Number obj=new Number();

[Link]("[Link] to Binary");
[Link]("[Link] to Decimal");

[Link]("Enter Choice: ");


int ch=[Link]();

if(ch==1)
{
[Link]("Enter Decimal Number: ");
int n=[Link]();
[Link](n);
}
else if(ch==2)
{
[Link]("Enter Binary Number: ");
int n=[Link]();
[Link](n);
}
else
[Link]("Invalid Choice");
}
}

Question 18: Sum of Even and Odd Numbers


import [Link].*;

class EvenOddArray
{
public static void main(String args[])
{
Scanner sc=new Scanner([Link]);

int a[]=new int[20];


int even=0,odd=0;
[Link]("Enter 20 Numbers:");

for(int i=0;i<20;i++)
a[i]=[Link]();

for(int i=0;i<20;i++)
{
if(a[i]%2==0)
even+=a[i];
else
odd+=a[i];
}

[Link]("Sum of Even Numbers = "+even);


[Link]("Sum of Odd Numbers = "+odd);
}
}

Question 19: Display Prime Numbers from Array


import [Link].*;

class PrimeArray
{
static boolean prime(int n)
{
if(n<2)
return false;

for(int i=2;i<=[Link](n);i++)
{
if(n%i==0)
return false;
}

return true;
}

public static void main(String args[])


{
Scanner sc=new Scanner([Link]);

int a[]=new int[20];

[Link]("Enter 20 Numbers:");

for(int i=0;i<20;i++)
a[i]=[Link]();

[Link]("Prime Numbers are:");

for(int i=0;i<20;i++)
{
if(prime(a[i]))
[Link](a[i]+" ");
}
}
}
Question 20: Student Result using Arrays
import [Link].*;

class StudentResult
{
public static void main(String args[])
{
Scanner sc=new Scanner([Link]);

int roll[]=new int[10];


String name[]=new String[10];
int marks[][]=new int[10][6];

double per;
char grade;

for(int i=0;i<10;i++)
{
[Link]("\nStudent "+(i+1));

[Link]("Roll No: ");


roll[i]=[Link]();

[Link]();

[Link]("Name: ");
name[i]=[Link]();

int total=0;

for(int j=0;j<6;j++)
{
[Link]("Subject "+(j+1)+" Marks: ");
marks[i][j]=[Link]();
total+=marks[i][j];
}

per=total/6.0;

if(per>=80)
grade='A';
else if(per>=60)
grade='B';
else if(per>=40)
grade='C';
else
grade='D';

[Link]("Percentage = "+per);
[Link]("Grade = "+grade);
}
}
}
Question 21: Ascending Order and Second Lowest Number
import [Link].*;

class Ascending
{
public static void main(String args[])
{
Scanner sc = new Scanner([Link]);

int a[] = new int[20];

[Link]("Enter 20 Numbers:");

for(int i = 0; i < 20; i++)


a[i] = [Link]();

for(int i = 0; i < 19; i++)


{
for(int j = i + 1; j < 20; j++)
{
if(a[i] > a[j])
{
int temp = a[i];
a[i] = a[j];
a[j] = temp;
}
}
}

[Link]("\nNumbers in Ascending Order:");

for(int i = 0; i < 20; i++)


[Link](a[i] + " ");

[Link]("\nSecond Lowest Number = " + a[1]);


}
}

Question 22: Linear Search using Function


import [Link].*;

class SearchArray
{
void Search(int m[], int ns)
{
boolean found = false;

for(int i = 0; i < [Link]; i++)


{
if(m[i] == ns)
{
found = true;
break;
}
}

if(found)
[Link]("Number is Present");
else
[Link]("Number is Not Present");
}

public static void main(String args[])


{
Scanner sc = new Scanner([Link]);

int a[] = new int[10];

[Link]("Enter 10 Numbers:");

for(int i = 0; i < 10; i++)


a[i] = [Link]();

[Link]("Enter Number to Search: ");


int n = [Link]();

SearchArray obj = new SearchArray();


[Link](a, n);
}
}

Question 23: 3×3 Matrix (Row Sum, Highest & Lowest)


import [Link].*;

class Matrix
{
public static void main(String args[])
{
Scanner sc = new Scanner([Link]);

int a[][] = new int[3][3];

int highest, lowest;

[Link]("Enter Matrix Elements:");

for(int i = 0; i < 3; i++)


{
for(int j = 0; j < 3; j++)
a[i][j] = [Link]();
}

highest = lowest = a[0][0];

[Link]("\nMatrix:");

for(int i = 0; i < 3; i++)


{
int sum = 0;

for(int j = 0; j < 3; j++)


{
[Link](a[i][j] + "\t");
sum += a[i][j];

if(a[i][j] > highest)


highest = a[i][j];

if(a[i][j] < lowest)


lowest = a[i][j];
}

[Link](" Sum = " + sum);


}

[Link]("\nHighest Number = " + highest);


[Link]("Lowest Number = " + lowest);
}
}

Question 24: Palindrome Word


import [Link].*;

class PalindromeWord
{
public static void main(String args[])
{
Scanner sc = new Scanner([Link]);

[Link]("Enter a Word: ");


String word = [Link]();

String rev = "";

for(int i = [Link]() - 1; i >= 0; i--)


rev += [Link](i);

if([Link](rev))
[Link]("Palindrome");
else
[Link]("Not Palindrome");
}
}

Question 25: Unique String


import [Link].*;

class UniqueString
{
public static void main(String args[])
{
Scanner sc = new Scanner([Link]);

[Link]("Enter a String: ");


String str = [Link]().toUpperCase();

boolean unique = true;


for(int i = 0; i < [Link](); i++)
{
for(int j = i + 1; j < [Link](); j++)
{
if([Link](i) == [Link](j))
{
unique = false;
break;
}
}

if(!unique)
break;
}

if(unique)
[Link]("Unique String");
else
[Link]("Not a Unique String");
}
}

You might also like