Question

Please use Java

Design a class called supportTicket that handles information about reported IT support issues. A ticket includes an id number, the location of the equipment (e.g., building and room number), a short description of the issue, and a priority level. A valid priority level is a positive integer value with 0 being the highest priority level Tickets are serviced based on their priority level, from highest to lowest. Assume each ticket is assigned a unique priority level. When a ticket is serviced, it is removed from the list.

1) Define an array-based heap class (or an ArrayList -based heap )

2) Use class Heap defined above to store the service tickets described above

3) Create a menu-driven interface that allows the user to (1) add a support ticket, (2) service a ticket (remove it from list), and (3) list active tickets in order of their service priority. Your menu-driven interface continuously gives the user the option to perform one of the above operations until the user choose exit the program.

Answer 1

******start of code for SupportTicket.java*********

public class SupportTicket implements Comparable<SupportTicket> {

   private int idnumber;
   private String location;
   private int priorityLevel ;
   private String sortDescription;
   public int getIdnumber() {
       return idnumber;
   }
   public void setIdnumber(int idnumber) {
       this.idnumber = idnumber;
   }
   public String getLocation() {
       return location;
   }
   public void setLocation(String location) {
       this.location = location;
   }
   public int getPriorityLevel() {
       return priorityLevel;
   }
   public void setPriorityLevel(int priorityLevel) {
       this.priorityLevel = priorityLevel;
   }
   public String getSortDescription() {
       return sortDescription;
   }
   public void setSortDescription(String sortDescription) {
       this.sortDescription = sortDescription;
   }
   @Override
   public int compareTo(SupportTicket o) {
       return (this.getPriorityLevel() < o.getPriorityLevel() ? -1 :
   (this.getPriorityLevel() == o.getPriorityLevel() ? 0 : 1));
   }
  
}

******End of code for SupportTicket.java*********

Explanation of SupportTicket.java Class

In this class 4 instance variable and setter and getter method and we have implemented Comparable interface and override the compareTo() method (this is because we have to sort the object of this class by priority of ticket).

***********Start of code for SupportTicketMenu********

import java.util.ArrayList;
import java.util.Iterator;
import java.util.Scanner;
public class SupportTicketMenu {
public static void main(String[] args) {
   ArrayList<SupportTicket> al1 =new ArrayList<SupportTicket>();
while (true) {
   Scanner CC = new Scanner(System.in);
   SupportTicket t1=new SupportTicket();
System.out.println("\nMENU");
System.out.println("1 - add a support ticket");
System.out.println("2 - service a ticket ");
System.out.println("3 - list active tickets in order of their service priority");
System.out.println("q - Quit\n");
System.out.println("Choose an option:");
char option = CC.next().charAt(0);
if (option == '1') {
   System.out.println("Enter id number");
   int id = CC.nextInt();
   System.out.println("Enter location");
   String loc=CC.next();
   System.out.println("priotity level");
   int pl = CC.nextInt();
   System.out.println("sort description");
   String sd=CC.next();
   //System.out.println(al1.size());
/*   SupportTicket t1=new SupportTicket(id,loc,pl,sd);*/
   t1.setIdnumber(id);
   t1.setLocation(loc);
   t1.setPriorityLevel(pl);
   t1.setSortDescription(sd);
   al1.add(t1);
   //System.out.println("al1.size();"+al1.size());
}
if (option == '2') {
System.out.print("service a ticket");
System.out.println("Enter id number");
int id = CC.nextInt();
//System.out.println("size before deletion "+al1.size());
Iterator iter = al1.iterator();
while (iter.hasNext()) {
   SupportTicket t2=(SupportTicket) iter.next();
if(t2.getIdnumber()==id)
{
   al1.remove(t2);
}
}
//System.out.println("size after deletion "+al1.size());
}
if (option == '3') {
System.out.println("list active tickets in order of their service priority");
SupportTicketSorterByPriotity jobCandidateSorter = new SupportTicketSorterByPriotity(al1);   
ArrayList<SupportTicket> sortedSupportticket = jobCandidateSorter.getSortedSupportTicketByPriority();
Iterator iter = sortedSupportticket.iterator();
while (iter.hasNext()) {
   SupportTicket t2=(SupportTicket) iter.next();
System.out.print(" ticket number"+t2.getIdnumber()+" ");
System.out.print("priotity "+t2.getPriorityLevel());
System.out.println();
}
}
if (option == 'q') {
System.exit(0);
}
}
}
}

***********End of code for SupportTicketMenu********

Explanation of SupportTicketMenu:- this is menu-driven interface where end has to perform the operation and test the result .end user will select the one of the option and perform there operation.

"MENU"
1 - add a support ticket"
2 - service a ticket
3 - list active tickets in order of their service priority
q - Quit

************Start of code SupportTicketSortedByPriority*******

import java.util.ArrayList;
import java.util.Collections;

public class SupportTicketSorterByPriotity {

   ArrayList<SupportTicket> st = new ArrayList<SupportTicket>();
  
   public SupportTicketSorterByPriotity(ArrayList<SupportTicket> st) {
       super();
       this.st = st;
   }

   public ArrayList<SupportTicket> getSortedSupportTicketByPriority() {   
   Collections.sort(st);   
   return st;
   }
}

************End of code SupportTicketSortedByPriority*******

Explanation of SupportTicketSortedByPriority: I have created this class to sort the Array List object(SuportTicket) according to priority.

Screen shot of output