Scribd
Upload
10 views

12TH It Project

Uploaded by

ngak1214
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
10 views

12TH It Project

Uploaded by

ngak1214
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
You are on page 1/ 6

Q.1. Write a program for displaying whether a given letter is consonant or vowel.

Using switch
command.

ANS: CODE--

package com.mycompany.mavenproject1;

import java.util.Scanner;

public class LetterClassifier {

public static void main(String[] args) {

Scanner scanner = new Scanner(System.in);

System.out.print("Enter a letter: ");

String input = scanner.next(); // Get input as a string

if (input.length() == 1) {

char letter = input.charAt(0);

classifyLetter(letter);

} else {

System.out.println("Please enter a single letter.");

scanner.close();

public static void classifyLetter(char letter) {

letter = Character.toLowerCase(letter);

switch (letter) {

case 'a':

case 'e':

case 'i':

case 'o':

case 'u':

System.out.println(letter + " is a vowel.");

break;

case 'b':

case 'c':

case 'd':
case 'f':

case 'g':

case 'h':

case 'j':

case 'k':

case 'l':

case 'm':

case 'n':

case 'p':

case 'q':

case 'r':

case 's':

case 't':

case 'v':

case 'w':

case 'x':

case 'y':

case 'z':

System.out.println(letter + " is a consonant.");

break;

default:

System.out.println(letter + " is not a valid letter.");

break;

OUTPUT—
Q.2.Write a program to find a factorial of given number.

ANS:CODE—import java.util.Scanner;

public class LetterClassifier{

public static long factorialIterative(int n) {

long result = 1;

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

result *= i;

return result;

// Recursive method to calculate factorial

public static long factorialRecursive(int n) {

if (n == 0) {

return 1;

} else {
return n * factorialRecursive(n - 1);

public static void main(String[] args) {

Scanner scanner = new Scanner(System.in);

System.out.print("Enter a positive integer: ");

int number = scanner.nextInt();

if (number < 0) {

System.out.println("Factorial is not defined for negative numbers.");

} else {

// Using iterative method

System.out.println("Factorial (Iterative) of " + number + " is " + factorialIterative(number));

// Using recursive method

System.out.println("Factorial (Recursive) of " + number + " is " + factorialRecursive(number));

scanner.close();

}
Q3 Create a class to calculate total marks of 5 subjects and display percentage.

ANS CODE—

ublic class Student {

private final int subject1;

private final int subject2;

private final int subject3;

private final int subject4;

private final int subject5;

// Constructor to initialize marks

public Student(int subject1, int subject2, int subject3, int subject4, int subject5) {

this.subject1 = subject1;

this.subject2 = subject2;

this.subject3 = subject3;

this.subject4 = subject4;

this.subject5 = subject5;

// Method to calculate total marks

public int getTotalMarks() {

return subject1 + subject2 + subject3 + subject4 + subject5;

// Method to calculate percentage

public double getPercentage() {

int totalMarks = getTotalMarks();

return (totalMarks / 5.0);

}
// Method to display total marks and percentage

public void displayResults() {

System.out.println("Total Marks: " + getTotalMarks());

System.out.println("Percentage: " + getPercentage() + "%");

public static void main(String[] args) {

// Create a Student object with marks for 5 subjects

Student student = new Student(85, 90, 78, 92, 88);

// Display the results

student.displayResults();

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