Joined: Tue Mar 27, 2007 10:55 pm Posts: 2277 Location: Earth Has thanked: 39 time Have thanks: 61 time
* Project Name:
SHORTEST JOB FIRST * Programmer:PEMMASANI HARI KRISHAN * Type:Java Swing * Technology:Java * IDE:Any * Description:THIS IS A SCHEDULING ALGORITHAM OF TYPE NON-PREEMPTIVE.SJF MEANS SHORTEST JOB FIRST.THAT MEANS THE PROCESS HAVING SHORTEST SERVICE TIME WILL BE PROCESSED NEXT.THIS PROGRAM WILL BE HELP FULL TO STUDY THE PROCESS HANDLING IN THE CPU.
public void actionPerformed(ActionEvent ae) { int FT[] = new int[k]; int WT[] = new int[k]; int TAT[] = new int[k]; float NTAT[] = new float[k]; float sum=0; float avg; JPanel main = new JPanel(); main.setLayout(new BorderLayout()); jp = new JPanel(); jp1 = new JPanel(); jp.setLayout(new GridLayout(k+1,7)); jp1.setLayout(new FlowLayout());
public static void main(String[] args) { fcfs window = new fcfs(); window.setSize(400,300); window.setVisible(true); window.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); }//end main }//end class