You are on page 1of 11

import java.util.

*; public class FCFS { public static void main(String args[]) { int id[]=new int[20]; int btime[]=new int[20]; int wtime[]=new int[20]; int total=0; float avg; Scanner sn = new Scanner(System.in); System.out.print("\nEnter the number of processes : "); int n = sn.nextInt(); for (int i=0;i<n ;i++ ) { System.out.println(); System.out.print("Enter the process ID of process "+(i+1)+" : "); id[i]=sn.nextInt(); System.out.print("Enter the burst time of process "+(i+1)+" : "); btime[i]=sn.nextInt(); } wtime[0]=0; for (int i=1;i<n ;i++ ) { wtime[i]=wtime[i-1]+btime[i-1]; total=total+wtime[i]; } avg=(float)total/n; System.out.println("\nProcess_ID\tBurst_time\tWait_time"); for(int i=0;i<n;i++) { System.out.println(id[i]+"\t\t"+btime[i]+"\t\t"+wtime[i]); } System.out.println("\nTotal wait time: "+total+"\nAverage wait time: "+avg);

} }

public static void main(String[] args) { Scanner sc = new Scanner(System.in); int sa,sb,sz,k=0; int a[] = new int[10]; int b[] = new int[10]; int z[] = new int[10]; System.out.println("Enter the no. of elements in A:" ); sa = sc.nextInt(); System.out.println("Enter the elements in A:" ); for (int i =0 ; i<sa;i++) a[i] = sc.nextInt(); System.out.println("Enter the no. of elements in B:" ); sb = sc.nextInt(); System.out.println("Enter the elements in B:" ); for (int i =0 ; i<sb;i++) b[i] = sc.nextInt(); for(int i=0;i<sb;i++) for(int j=0;j<sa;j++) { if(a[i] == b[j]) { z[k++] = a[i]; } } //code to remove common elements for(int i=0; i<k; i++) { for(int j=i+1; j<k; j++) { while(z[i]==z[j]) { for(int A=j; A<k-1; A++) z[A]=z[A+1]; k--; } } } if(k==0) System.out.println("Intersection array is Empty"); else { System.out.println("Intersection:"); for(int i=0; i<k-1; i++) System.out.print(z[i]+" , "); System.out.print(z[k-1]); } } }

package p1; import java.util.Scanner; public class Palin { public static void main(String[] args) { String original, reverse=""; Scanner in = new Scanner(System.in); System.out.println("Enter a string to check if it is a palindrome"); original = in.nextLine(); int length = original.length(); for ( int i = length - 1 ; i >= 0 ; i-- ) reverse = reverse + original.charAt(i); if (original.equals(reverse)) System.out.println("Entered string is a palindrome."); else System.out.println("Entered string is not a palindrome.");

} }

package p1; import java.util.Scanner; public class Pat1 { public static void main(String[] args) { int n; System.out.println("Enter the no of rows"); Scanner sc = new Scanner(System.in); n = sc.nextInt(); int sum = 0; for(int i =0;i<n;i++) { for(int j=0;j<=i;j++) { System.out.print(sum +"\t"); sum = sum+1; } System.out.println(); }

} }

package p1; import java.util.Scanner; public class Pat2 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int n; System.out.println("Enter the no. of rows:"); n = sc.nextInt(); for(int i=0;i<n;i++) { for(int j=0;j<=i;j++) System.out.print((i+j)%2 +"\t"); System.out.println(); } } }

package p1; import java.util.Scanner; public class Pat3 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int no , no1,no2,i,j,k; System.out.println("Enter the no. of rows odd:"); no = sc.nextInt(); no1 = no/2 +1; no2 = no/2; for(i=0;i<no1;i++) { for(j=0;j<no1-i;j++) System.out.print(" "); for(k=0;k<=i;k++) System.out.print("* "); System.out.println(); } for(i=0;i<no2;i++) { for(j=-1;j<=i;j++) System.out.print(" "); for(k=0;k<no2-i;k++) System.out.print("* "); System.out.println(); } } import java.util.Scanner; public class Reverse { public static void main(String[] args) { String original, reverse = ""; Scanner in = new Scanner(System.in); System.out.println("Enter a string to reverse"); original = in.nextLine(); int length = original.length(); for ( int i = length - 1 ; i >= 0 ; i-- ) reverse = reverse + original.charAt(i); System.out.println("Reverse of entered string is: "+reverse); }

public class Revwords { public static void main(String[] args) { Scanner sc = new Scanner(System.in); System.out.println("Enter the string:"); String s = new String(); s = sc.nextLine(); int strLeng = s.length()-1; String reverse = "", temp = ""; for(int i = 0; i <= strLeng; i++) { temp += s.charAt(i); if((s.charAt(i) == ' ') || (i == strLeng)) { for(int j = temp.length()-1; j >= 0; j--) { reverse += temp.charAt(j); if((j == 0) && (i != strLeng)) reverse += " "; } temp = ""; } } System.out.println(reverse);

} }

package p1; import java.util.Scanner; public class REvWr { public static void main(String[] args) { Scanner sc = new Scanner(System.in); String s = new String(); System.out.println("Enter the string:"); s = sc.nextLine(); String temp ="", reverse = ""; int strlen = s.length() - 1; for (int i = strlen;i>=0;i--) { temp += s.charAt(i); if((s.charAt(i)==' ') || (i==0)) { for(int j = temp.length()-1;j>=0;j--) { reverse += temp.charAt(j); if((j==0)) reverse += " "; } temp = " "; } } System.out.println(reverse); } }

package p1; import java.util.Scanner; public class SJF { public static void main(String[] args) { int process[] = new int[10]; int ptime[] = new int[10]; int wtime[] = new int[10]; int temp, n, total=0; float avg=0; Scanner get = new Scanner(System.in); System.out.println("Enter Number of Processes:"); n = get.nextInt(); for(int i=0;i<n;i++) { System.out.println("Enter Process "+(i+1)+" ID: "); process[i] = get.nextInt(); System.out.println("Enter Process "+(i+1)+" Burst Time: "); ptime[i] = get.nextInt(); } for(int i=0;i<n-1;i++) { for(int j=i+1;j<n;j++) { { temp = ptime[i]; ptime[i] = ptime[j]; ptime[j] = temp; temp = process[i]; process[i] = process[j]; process[j] = temp; } } }

if(ptime[i]>ptime[j])

wtime[0] = 0; for(int i=1;i<n;i++) { wtime[i] = wtime[i-1]+ptime[i-1]; total = total + wtime[i]; } avg = (float)total/n; System.out.println("P_ID P_TIME W_TIME"); for(int i=0;i<n;i++) { System.out.println(process[i]+"\t"+ptime[i]+"\t"+wtime[i]); } System.out.println("Total Waiting Time: "+total); System.out.println("Average Waiting Time: "+avg); } }

package p1; import java.util.Scanner; public class Trans { public static void main(String[] args) { int i,j,m; Scanner sc = new Scanner(System.in); System.out.println("Enter the order of matrix:"); m = sc.nextInt(); int a[][] = new int [m][m]; System.out.println("Enter the elements"); for(i = 0;i<m;i++) for(j = 0;j<m;j++) a[i][j] = sc.nextInt(); System.out.println(); System.out.println("Adjacency Matrix"); for(i = 0;i<m;i++) { for(j = 0;j<m;j++) System.out.print(a[i][j]+" "); System.out.println(); } System.out.println(); System.out.println(); for(int k = 0;k<m;k++) for(i = 0;i<m;i++) for(j = 0;j<m;j++) { if(a[i][k]==1 && a[k][j]==1) a[i][j] = 1; } System.out.println("Transitive Matrix"); for(i = 0;i<m;i++) { for(j = 0;j<m;j++) System.out.print(a[i][j]+" "); System.out.println(); } } }

package p1; import java.util.Scanner; public class Union { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int sa,sb,sz,k=0; int a[] = new int[10]; int b[] = new int[10]; System.out.println("Enter the no. of elements in A:" ); sa = sc.nextInt(); System.out.println("Enter the elements in A:" ); for (int i =0 ; i<sa;i++) a[i] = sc.nextInt(); System.out.println("Enter the no. of elements in B:" ); sb = sc.nextInt(); System.out.println("Enter the elements in B:" ); for (int i =0 ; i<sb;i++) b[i] = sc.nextInt(); int z[] = new int[sa+sb]; for(int i = 0;i<(sa+sb);i++) { for(int j = 0;j<sa;j++) z[j] = a[j]; for(int m = 0;m<sb;m++) z[sa+m] = b[m]; } k = sa+sb; //code to remove common elements for(int i=0; i<k; i++) { for(int j=i+1; j<k; j++) { while(z[i]==z[j]) { for(int A=j; A<k-1; A++) z[A]=z[A+1]; k--; } } } System.out.println("Union:"); for(int i=0; i<k-1; i++) System.out.print(z[i]+" , "); System.out.print(z[k-1]); }

You might also like