Java Arrays Level 2 Lab Practice

The document contains multiple Java programs that perform various tasks, including calculating employee bonuses, comparing friends' ages and heights, analyzing digits of a number, reversing a number, calculating Body Mass Index (BMI), and computing student grades based on marks. Each program includes user input handling, calculations, and output formatting. The programs demonstrate basic programming concepts such as arrays, loops, conditionals, and methodical input validation.

Uploaded by

thorodinsan82

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

3 views

Java Arrays Level 2 Lab Practice

Uploaded by

thorodinsan82

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 14

Level 2 Practice Programs

1. Create a program to find the bonus of 10 employees based on their years of service and
the total bonus amount the company Zara has to pay, along with the old and new salary.
Code:

import java.util.Scanner;

public class EmployeeBonus {
public static void main(String[] args) {
final int NUM_EMPLOYEES = 10;
double[] salary = new double[NUM_EMPLOYEES];
double[] yearsOfService = new double[NUM_EMPLOYEES];
double[] bonus = new double[NUM_EMPLOYEES];
double[] newSalary = new double[NUM_EMPLOYEES];
double totalBonus = 0, totalOldSalary = 0, totalNewSalary = 0;

Scanner scanner = new Scanner(System.in);

// Input salaries and years of service
for (int i = 0; i < NUM_EMPLOYEES; i++) {
while (true) {
System.out.print("Enter salary for employee " + (i + 1)
+ ": ");
salary[i] = scanner.nextDouble();
if (salary[i] > 0) break;
System.out.println("Invalid salary. Please enter
again.");
}

while (true) {
System.out.print("Enter years of service for employee "
+ (i + 1) + ": ");
yearsOfService[i] = scanner.nextDouble();
if (yearsOfService[i] >= 0) break;
System.out.println("Invalid years of service. Please
enter again.");
}
}

// Calculate bonus, new salary and total amounts
for (int i = 0; i < NUM_EMPLOYEES; i++) {
if (yearsOfService[i] > 5) {
bonus[i] = salary[i] * 0.05; // 5% bonus
} else {
bonus[i] = salary[i] * 0.02; // 2% bonus
}

newSalary[i] = salary[i] + bonus[i];
totalBonus += bonus[i];
totalOldSalary += salary[i];
totalNewSalary += newSalary[i];
}

// Display results
System.out.println("\nEmployee Details:");

System.out.println("-------------------------------------------------");
System.out.println("Emp# Salary Years Bonus New
Salary");

System.out.println("-------------------------------------------------");
for (int i = 0; i < NUM_EMPLOYEES; i++) {
System.out.printf("%d\t%.2f\t%.2f\t%.2f\t%.2f\n", (i + 1),
salary[i], yearsOfService[i], bonus[i], newSalary[i]);
}

System.out.println("-------------------------------------------------");
System.out.printf("Total Old Salary: %.2f\n", totalOldSalary);
System.out.printf("Total Bonus Payout: %.2f\n", totalBonus);
System.out.printf("Total New Salary: %.2f\n", totalNewSalary);
scanner.close();
}
}
2. Create a program to find the youngest friends among 3 Amar, Akbar, and Anthony
based on their ages and the tallest among the friends based on their heights
Code:

import java.util.Scanner;
public class FriendComparison {
public static void main(String[] args) {
String[] friends = {"Amar", "Akbar", "Anthony"};
int[] ages = new int[3];
double[] heights = new double[3];
Scanner scanner = new Scanner(System.in);
for (int i = 0; i < 3; i++) {
System.out.print("Enter age of " + friends[i] + ": ");
ages[i] = scanner.nextInt();
System.out.print("Enter height (in cm) of " + friends[i] +
": ");
heights[i] = scanner.nextDouble();
}
// Finding the youngest friend
int minAgeIndex = 0;
for (int i = 1; i < 3; i++) {
if (ages[i] < ages[minAgeIndex]) {
minAgeIndex = i;
}
}
// Finding the tallest friend
int maxHeightIndex = 0;
for (int i = 1; i < 3; i++) {
if (heights[i] > heights[maxHeightIndex]) {
maxHeightIndex = i;
}
}
System.out.println("\nThe youngest friend is " +
friends[minAgeIndex] + " with age " + ages[minAgeIndex] + ".");
System.out.println("The tallest friend is " +
friends[maxHeightIndex] + " with height " + heights[maxHeightIndex] + "
cm.");
scanner.close();
}
}
3. Create a program to store the digits of the number in an array and find the largest
and second largest element of the array.
Code:

import java.util.Scanner;
public class DigitAnalysis {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int number = scanner.nextInt();
final int maxDigit = 10;
int[] digits = new int[maxDigit];
int index = 0;
// Extract digits and store them in the array
while (number != 0 && index < maxDigit) {
digits[index++] = number % 10;
number /= 10;
}
// Initialize largest and second largest
int largest = -1, secondLargest = -1;
// Find the largest and second largest digits
for (int i = 0; i < index; i++) {
if (digits[i] > largest) {
secondLargest = largest;
largest = digits[i];
} else if (digits[i] > secondLargest && digits[i] !=
largest) {
secondLargest = digits[i];
}
}
System.out.println("Largest digit: " + largest);
System.out.println("Second largest digit: " + (secondLargest ==
-1 ? "Not available" : secondLargest));

scanner.close();
}
}
4. Rework the program 2, especially the Hint f where if index equals maxDigit, we break
from the loop. Here we want to modify to Increase the size of the array i,e maxDigit
by 10 if the index is equal to maxDigit. This is done to consider all digits to find the
largest and second-largest number
Code:

import java.util.Scanner;
public class DigitAnalysis2 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int number = scanner.nextInt();
int maxDigit = 10;
int[] digits = new int[maxDigit];
int index = 0;
// Extract digits and store them in the array, dynamically
increasing size if needed
while (number != 0) {
if (index == maxDigit) {
maxDigit += 10; // Increase size by 10
int[] temp = new int[maxDigit];
System.arraycopy(digits, 0, temp, 0, digits.length);
digits = temp;
}
digits[index++] = number % 10;
number /= 10;
}
// Initialize largest and second largest
int largest = -1, secondLargest = -1;
// Find the largest and second largest digits
for (int i = 0; i < index; i++) {
if (digits[i] > largest) {
secondLargest = largest;
largest = digits[i];
} else if (digits[i] > secondLargest && digits[i] !=
largest) {
secondLargest = digits[i];
}
}
// Display results
System.out.println("Largest digit: " + largest);
System.out.println("Second largest digit: " + (secondLargest ==
-1 ? "Not available" : secondLargest));
scanner.close();
}
}
5. Create a program to take a number as input and reverse the number. To do this,
store the digits of the number in an array and display the array in reverse order
Code:

import java.util.Scanner;
public class ReverseNumber {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int number = scanner.nextInt();
int temp = number;
int digitCount = 0;
// Count the number of digits
while (temp != 0) {
digitCount++;
temp /= 10;
}
int[] digits = new int[digitCount];
// Store digits in an array
temp = number;
for (int i = 0; i < digitCount; i++) {
digits[i] = temp % 10;
temp /= 10;
}
// Display digits in reverse order
System.out.print("Reversed number: ");
for (int i = 0; i < digitCount; i++) {
System.out.print(digits[i]);
}
System.out.println();
scanner.close();
}
}
6. An organization took up an exercise to find the Body Mass Index (BMI) of all the
persons in the team. For this create a program to find the BMI and display the height,
weight, BMI and status of each individual
Code:

import java.util.Scanner;
public class BMICalculator {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of persons: ");
int numPersons = scanner.nextInt();
double[] heights = new double[numPersons];
double[] weights = new double[numPersons];
double[] bmiValues = new double[numPersons];
String[] weightStatus = new String[numPersons];
for (int i = 0; i < numPersons; i++) {
System.out.print("Enter height (in meters) for person " + (i
+ 1) + ": ");
heights[i] = scanner.nextDouble();
System.out.print("Enter weight (in kg) for person " + (i +
1) + ": ");
weights[i] = scanner.nextDouble();
bmiValues[i] = weights[i] / (heights[i] * heights[i]);
if (bmiValues[i] < 18.5) {
weightStatus[i] = "Underweight";
} else if (bmiValues[i] < 24.9) {
weightStatus[i] = "Normal weight";
} else if (bmiValues[i] < 29.9) {
weightStatus[i] = "Overweight";
} else {
weightStatus[i] = "Obese";
}
}
System.out.println("\nPerson Height(m) Weight(kg) BMI
Status");

System.out.println("------------------------------------------------");
for (int i = 0; i < numPersons; i++) {
System.out.printf("%d %.2f %.2f %.2f
%s\n",
(i + 1), heights[i], weights[i],
bmiValues[i], weightStatus[i]);
}
scanner.close();
}
}
7. Rewrite the above program using multi-dimensional array to store height, weight, and
BMI in 2D array for all the persons
Code:

import java.util.Scanner;
public class BMICalculator2 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of persons: ");
int numPersons = scanner.nextInt();
double[][] personData = new double[numPersons][3]; // [height, weight, BMI]
String[] weightStatus = new String[numPersons];
// Input height and weight
for (int i = 0; i < numPersons; i++) {
do {
System.out.print("Enter height (in meters) for person " + (i + 1) + ": ");
personData[i][0] = scanner.nextDouble();
if (personData[i][0] <= 0) {
System.out.println("Height must be a positive value. Please enter again.");
}
} while (personData[i][0] <= 0);

do {
System.out.print("Enter weight (in kg) for person " + (i + 1) + ": ");
personData[i][1] = scanner.nextDouble();
if (personData[i][1] <= 0) {
System.out.println("Weight must be a positive value. Please enter again.");
}
} while (personData[i][1] <= 0);

// Calculate BMI
personData[i][2] = personData[i][1] / (personData[i][0] * personData[i][0]);

// Determine weight status
if (personData[i][2] < 18.5) {
weightStatus[i] = "Underweight";
} else if (personData[i][2] < 24.9) {
weightStatus[i] = "Normal weight";
} else if (personData[i][2] < 29.9) {
weightStatus[i] = "Overweight";
} else {
weightStatus[i] = "Obese";
}
}

// Display results
System.out.println("\nPerson Height(m) Weight(kg) BMI Status");
System.out.println("------------------------------------------------");
for (int i = 0; i < numPersons; i++) {
System.out.printf("%d %.2f %.2f %.2f %s\n",
(i + 1), personData[i][0], personData[i][1], personData[i][2],
weightStatus[i]);
}

scanner.close();
}
}
8. Create a program to take input marks of students in 3 subjects physics, chemistry,
and maths. Compute the percentage and then calculate the grade as per the
following guidelines
Code:

import java.util.Scanner;
public class StudentGradesCalculator {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of students: ");
int numStudents = scanner.nextInt();
double[][] marks = new double[numStudents][3]; // [physics, chemistry,
maths]
double[] percentages = new double[numStudents];
String[] grades = new String[numStudents];

// Input marks for students
for (int i = 0; i < numStudents; i++) {
System.out.println("\nEnter marks for Student " + (i + 1) + ":");
for (int j = 0; j < 3; j++) {
String subject = (j == 0) ? "Physics" : (j == 1) ? "Chemistry" :
"Maths";
do {
System.out.print(subject + ": ");
marks[i][j] = scanner.nextDouble();
if (marks[i][j] < 0) {
System.out.println("Marks cannot be negative. Please enter
again.");
}
} while (marks[i][j] < 0);
}
percentages[i] = (marks[i][0] + marks[i][1] + marks[i][2]) / 3;
if (percentages[i] >= 90) {
grades[i] = "A+";
} else if (percentages[i] >= 80) {
grades[i] = "A";
} else if (percentages[i] >= 70) {
grades[i] = "B";
} else if (percentages[i] >= 60) {
grades[i] = "C";
} else if (percentages[i] >= 50) {
grades[i] = "D";
} else {
grades[i] = "F";
}
}
System.out.println("\nStudent Physics Chemistry Maths Percentage
Grade");

System.out.println("----------------------------------------------------------");
for (int i = 0; i < numStudents; i++) {
System.out.printf("%d %.2f %.2f %.2f %.2f%%
%s\n",
(i + 1), marks[i][0], marks[i][1], marks[i][2],
percentages[i], grades[i]);
}

scanner.close();
}
}
9. Rewrite the above program to store the marks of the students in physics, chemistry,
and maths in a 2D array and then compute the percentage and grade
Code:

import java.util.Scanner;
public class StudentGradesCalculator2 {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter the number of students: ");
int numStudents = scanner.nextInt();
double[][] marks = new double[numStudents][3]; // [physics, chemistry,
maths]
double[] percentages = new double[numStudents];
String[] grades = new String[numStudents];
for (int i = 0; i < numStudents; i++) {
System.out.println("\nEnter marks for Student " + (i + 1) + ":");
for (int j = 0; j < 3; j++) {
String subject = (j == 0) ? "Physics" : (j == 1) ? "Chemistry" :
"Maths";
do {
System.out.print(subject + ": ");
marks[i][j] = scanner.nextDouble();
if (marks[i][j] < 0) {
System.out.println("Marks cannot be negative. Please enter
again.");
}
} while (marks[i][j] < 0);
}
percentages[i] = (marks[i][0] + marks[i][1] + marks[i][2]) / 3;
if (percentages[i] >= 90) {
grades[i] = "A+";
} else if (percentages[i] >= 80) {
grades[i] = "A";
} else if (percentages[i] >= 70) {
grades[i] = "B";
} else if (percentages[i] >= 60) {
grades[i] = "C";
} else if (percentages[i] >= 50) {
grades[i] = "D";
} else {
grades[i] = "F";
}
}
System.out.println("\nStudent Physics Chemistry Maths Percentage
Grade");
System.out.println("----------------------------------------------------------");
for (int i = 0; i < numStudents; i++) {
System.out.printf("%d %.2f %.2f %.2f %.2f%%
%s\n",
(i + 1), marks[i][0], marks[i][1], marks[i][2],
percentages[i], grades[i]);
}

scanner.close();
}
}
10.Create a program to take a number as input find the frequency of each digit in the
number using an array and display the frequency of each digit
Code:

import java.util.Scanner;
public class DigitFrequency {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter a number: ");
int number = scanner.nextInt();
int[] frequency = new int[10]; // Array to store frequency of
digits 0-9
int tempNumber = Math.abs(number); // Take absolute value to
handle negative numbers
// Count frequency of each digit
while (tempNumber > 0) {
int digit = tempNumber % 10; // Extract last digit
frequency[digit]++;
tempNumber /= 10; // Remove last digit
}
System.out.println("Digit Frequency in the given number:");
for (int i = 0; i < 10; i++) {
if (frequency[i] > 0) {
System.out.println("Digit " + i + ": " + frequency[i] +
" times");
}
}
scanner.close();
}
}

Nanigans - European Facebook Advertising Benchmark Report
No ratings yet
Nanigans - European Facebook Advertising Benchmark Report
12 pages
CAPP - Computer Aided Process Planning Overview: (Author: N. Mohan Raj, Chennai)
No ratings yet
CAPP - Computer Aided Process Planning Overview: (Author: N. Mohan Raj, Chennai)
31 pages
Olivetti 520 TPS PDF
No ratings yet
Olivetti 520 TPS PDF
57 pages
Array Programs 01
No ratings yet
Array Programs 01
15 pages
Week 1 Level 1 Array
No ratings yet
Week 1 Level 1 Array
11 pages
Tarea 12
No ratings yet
Tarea 12
9 pages
S.aneesh Week 1-Level-1 Arrays
No ratings yet
S.aneesh Week 1-Level-1 Arrays
13 pages
QB Array Program Answers
No ratings yet
QB Array Program Answers
15 pages
Revision 2 Important Programs
No ratings yet
Revision 2 Important Programs
15 pages
javajournel (1)_merged (1)
No ratings yet
javajournel (1)_merged (1)
74 pages
Programs
No ratings yet
Programs
16 pages
Basic Arithmetic Operations
No ratings yet
Basic Arithmetic Operations
23 pages
Week2 - Levels 2.Docx
No ratings yet
Week2 - Levels 2.Docx
15 pages
javaexercise
No ratings yet
javaexercise
4 pages
Assignment 1 Task 2 Shafil Ahmed 2231927042
No ratings yet
Assignment 1 Task 2 Shafil Ahmed 2231927042
1 page
Program_Project
No ratings yet
Program_Project
30 pages
Java Practicals
No ratings yet
Java Practicals
43 pages
Java Assignmant #4
No ratings yet
Java Assignmant #4
9 pages
Assignment
No ratings yet
Assignment
19 pages
Oop lab work
No ratings yet
Oop lab work
11 pages
sodapdf-converted-6
No ratings yet
sodapdf-converted-6
31 pages
Computer Project
No ratings yet
Computer Project
42 pages
Java Record Programs
No ratings yet
Java Record Programs
57 pages
Ex (1b)
No ratings yet
Ex (1b)
9 pages
Blue J Solutions Class 9
No ratings yet
Blue J Solutions Class 9
32 pages
Nawaz Shahid 3rd Assigments
No ratings yet
Nawaz Shahid 3rd Assigments
41 pages
ANCHELO COMPUTER PROJECT
No ratings yet
ANCHELO COMPUTER PROJECT
24 pages
Import Java
No ratings yet
Import Java
10 pages
Java Handsom
No ratings yet
Java Handsom
47 pages
Java Level3 Programs.docx
No ratings yet
Java Level3 Programs.docx
6 pages
Computer Assignmen1
No ratings yet
Computer Assignmen1
32 pages
java assignment
No ratings yet
java assignment
19 pages
Remedials Assignments Sandip Das
No ratings yet
Remedials Assignments Sandip Das
8 pages
STD X Chapter 3 Arrays.20231219122052
No ratings yet
STD X Chapter 3 Arrays.20231219122052
48 pages
TP_Sem11
No ratings yet
TP_Sem11
4 pages
Murali (SU5124)
No ratings yet
Murali (SU5124)
15 pages
Java Arrays Level 1 Lab Practice
No ratings yet
Java Arrays Level 1 Lab Practice
19 pages
Java Lab Experiments
No ratings yet
Java Lab Experiments
20 pages
Array Practice Programs
No ratings yet
Array Practice Programs
10 pages
import java
No ratings yet
import java
6 pages
OOP-I Programs
No ratings yet
OOP-I Programs
29 pages
Sorting
No ratings yet
Sorting
11 pages
Final Project - Yuldoshov - Shakhzod
No ratings yet
Final Project - Yuldoshov - Shakhzod
4 pages
K-Means Program
No ratings yet
K-Means Program
8 pages
Hard
No ratings yet
Hard
17 pages
Untitled Document
No ratings yet
Untitled Document
7 pages
extraLAB
No ratings yet
extraLAB
60 pages
TYBCS Java Slips Solution 2022
No ratings yet
TYBCS Java Slips Solution 2022
82 pages
Computer Assignment But Word
No ratings yet
Computer Assignment But Word
27 pages
All Programming Codding Solution Fo
No ratings yet
All Programming Codding Solution Fo
9 pages
JAVA
No ratings yet
JAVA
9 pages
Java Bharat
No ratings yet
Java Bharat
30 pages
Expeiment 1
No ratings yet
Expeiment 1
5 pages
22bce033 Prac 3 Oops
No ratings yet
22bce033 Prac 3 Oops
11 pages
Lab 03
No ratings yet
Lab 03
17 pages
Java Assignment: Name:Vaishnavi Rajesh Nagarkar PRN:10303320181124510060
No ratings yet
Java Assignment: Name:Vaishnavi Rajesh Nagarkar PRN:10303320181124510060
19 pages
Class2 2 Shakhzod Yuldoshov
No ratings yet
Class2 2 Shakhzod Yuldoshov
11 pages
COMPUTER_PROGRAM_SANJAY_MOHANAN[1]
No ratings yet
COMPUTER_PROGRAM_SANJAY_MOHANAN[1]
25 pages
Java pgm 10-18
No ratings yet
Java pgm 10-18
24 pages
Assignment2 22201465 Johra-E-Jannat Oishy
No ratings yet
Assignment2 22201465 Johra-E-Jannat Oishy
8 pages
Unsolved Programs
No ratings yet
Unsolved Programs
16 pages
New
No ratings yet
New
7 pages
Amazing Java: Learn Java Quickly
From Everand
Amazing Java: Learn Java Quickly
Andrei Besedin
No ratings yet
Week 2 - Level 3 - 11 Practice Problems
No ratings yet
Week 2 - Level 3 - 11 Practice Problems
18 pages
The Palace of Illusions Professional PPT
No ratings yet
The Palace of Illusions Professional PPT
10 pages
The Palace of Illusions Beautified PPT
No ratings yet
The Palace of Illusions Beautified PPT
10 pages
State Government
No ratings yet
State Government
12 pages
Presentation
No ratings yet
Presentation
11 pages
Matlab
No ratings yet
Matlab
6 pages
Balanceo Dinamico de Rotores en Voladizo
100% (1)
Balanceo Dinamico de Rotores en Voladizo
2 pages
Advanced Java Programming
No ratings yet
Advanced Java Programming
11 pages
Packet Transport Network Equipment Commissioning Guide
No ratings yet
Packet Transport Network Equipment Commissioning Guide
57 pages
RA No 8792
No ratings yet
RA No 8792
10 pages
PMP
No ratings yet
PMP
23 pages
2005 - 10 An Overview of Operational Modal Analysis Major Development and Issues
No ratings yet
2005 - 10 An Overview of Operational Modal Analysis Major Development and Issues
12 pages
1 2 7 P Understandingdigitaldesign RNG (Finished)
100% (2)
1 2 7 P Understandingdigitaldesign RNG (Finished)
7 pages
Media and Information Literacy (MIL)
No ratings yet
Media and Information Literacy (MIL)
2 pages
Search and Sort Algorithm
No ratings yet
Search and Sort Algorithm
37 pages
Instruction For AVIC F-Series In-Dash 2.008 Firmware Update
No ratings yet
Instruction For AVIC F-Series In-Dash 2.008 Firmware Update
4 pages
8b/10b Encoder/Decoder: April 2011 Reference Design RD1012
No ratings yet
8b/10b Encoder/Decoder: April 2011 Reference Design RD1012
10 pages
Department of Electronics Engineering: (Autonomous College Affiliated To University of Mumbai)
No ratings yet
Department of Electronics Engineering: (Autonomous College Affiliated To University of Mumbai)
4 pages
Big Data Analytics
No ratings yet
Big Data Analytics
5 pages
HEC 4 UsersManual (CPD 4)
No ratings yet
HEC 4 UsersManual (CPD 4)
104 pages
Introduction To Algorithm Analysis: Ms. Andleeb Yousaf Khan FALL 2019
No ratings yet
Introduction To Algorithm Analysis: Ms. Andleeb Yousaf Khan FALL 2019
29 pages
Autodyn: Explicit Software For Nonlinear Dynamics
No ratings yet
Autodyn: Explicit Software For Nonlinear Dynamics
67 pages
Internship Title - Business Development, HR Manager, Sales Manager & Office Assistant
No ratings yet
Internship Title - Business Development, HR Manager, Sales Manager & Office Assistant
2 pages
PROGRAMMING-EXERCISE-GROUP-8-2
No ratings yet
PROGRAMMING-EXERCISE-GROUP-8-2
11 pages
Ieee 1115-00
100% (1)
Ieee 1115-00
26 pages
SQL Quick Reference
No ratings yet
SQL Quick Reference
8 pages
The User Datagram Protocol
No ratings yet
The User Datagram Protocol
10 pages
Veeam Backup 9 5 User Guide Vsphere PDF
No ratings yet
Veeam Backup 9 5 User Guide Vsphere PDF
1,040 pages
Software Engineering
No ratings yet
Software Engineering
35 pages
Emp-168 Analizador Bioquimico PDF
No ratings yet
Emp-168 Analizador Bioquimico PDF
2 pages
Fault Diagnosis of Power Transformer Based On Multi-Layer SMV Classifier
No ratings yet
Fault Diagnosis of Power Transformer Based On Multi-Layer SMV Classifier
7 pages