Question 1

+25−0

An organization maintains employee records with two attributes: currentExp (experience in the current company) and totalExp (overall work experience). Write a Java program that accepts currentExp and totalExp for 4 Employee objects, stores them in a TreeSet, and prints them in sorted order.

Employees are sorted by currentExp in ascending order. If the currentExp values are the same, they are sorted by totalExp in ascending order.

Requirements:

Define the compareTo method comparing currentExp first, then totalExp.
Return a negative number if this employee comes before the other, a positive number if it comes after, and 0 if they are equal.
A TreeSet automatically removes duplicates.

Input: 4 lines, each with two integers: the employee's experience in the current company and the total work experience. For each employee, totalExp >= currentExp.

Output: all Employee records stored in the TreeSet, in sorted order, one per line, in the format CurrentExp:<currentExp> TotalExp:<totalExp>.

Java

Not submitted

import java.util.*;

class Employee implements Comparable<Employee> {
    private int currentExp;
    private int totalExp;

    public Employee(int c, int t) {
        currentExp = c;
        totalExp = t;
    }

    public String toString() {
        return "CurrentExp:" + currentExp + " TotalExp:" + totalExp;
    }

    // Define compareTo method here
}

public class EmployeeSort {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        Set<Employee> eset = new TreeSet<Employee>();
        for (int i = 0; i < 4; i++) {
            int c = sc.nextInt();
            int t = sc.nextInt();
            eset.add(new Employee(c, t));
        }
        for (Employee e : eset) {
            System.out.println(e);
        }
    }
}

Question 1

Submit this paper?

Instructions