0832CS071103

Generation of Random Numbers

import java.util.*;
import java.io.*;
public class GenerateRandomNumber
{
public static void main(String[] args) throws
Exception
{
System.out.println("How many Random Numbers You
want to generate");
BufferedReader br=new BufferedReader(new
InputStreamReader (System.in));
String s=br.readLine();
int x=Integer.parseInt(s);
Random rand = new Random();
for(int i=0;i<x;i++)
{
int num = rand.nextInt(x);
System.out.println("Generated Random Number
between 0 to "+x+" is : " + num);
}
}
}

Output

10
 0832CS071103

First Come First Serve algorithm

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;

public class FCFS

{
static int num;
public static void main(String [] args)throws
Exception
{
System.out.println("Enter Number of processes");
BufferedReader br=new BufferedReader(new
InputStreamReader (System.in));
String n=br.readLine();
num=Integer.parseInt(n);
int p[]=new int[num];
for(int i=0;i<num;i++)
{
System.out.println("Enter time");
String x=br.readLine();
int t=Integer.parseInt(x);
insert(p,t,i);
}
}
static void insert(int p[],int t,int i)
{
p[i]=t;
if(i==num-1)
{
System.out.println("Order of execution of
FCFS Algorithm is:");
for(int g=0;g<num;g++)
{
System.out.println("Process with Burst
Time "+p[g]);
}
}
}
}

11
 0832CS071103

Output

12
 0832CS071103

Shortest Job First algorithm

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;
public class SJF {
static int num;
public static void main(String [ ] args)throws
Exception
{
System.out.println("Enter Number of processes");
BufferedReader br=new BufferedReader(new
InputStreamReader (System.in));
String n=br.readLine();
num=Integer.parseInt(n);
int p[]=new int[num];
for(int i=0;i<num;i++)
{
System.out.println("Enter time");
String x=br.readLine();
int t=Integer.parseInt(x);
insert(p,t,i);
}
}
static void insert(int p[ ],int t,int i)
{ p[i]=t;
if(i==num-1)
{
Arrays.sort(p);
display(p);
}
}
static void display(int p[ ])
{
if(p.length==num)
{
System.out.println("Order of execution of SJF
Algorithm is:");
for(int i=0;i<num;i++)
{
System.out.println("Process with Burst Time
"+p[i]);
}
}
}
}

13
 0832CS071103

Output

14
 0832CS071103

Priority Scheduling Algorithm

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.*;

public class priority

{
static int num;
public static void main(String [] args) throws
Exception
{
System.out.println("Enter Number of processes");
BufferedReader br=new BufferedReader(new
InputStreamReader (System.in));
String n=br.readLine();
num=Integer.parseInt(n);
int p[]=new int[num];
int t[]=new int[num];
for(int i=0;i<=num-1;i++)
{
System.out.println("Enter Burst time of
Process No. "+(i+1));
String bt=br.readLine();
int b=Integer.parseInt(bt);
System.out.println("Enter priority of
Process No. "+(i+1));
String pt=br.readLine();
int Pt=Integer.parseInt(pt);
insert(p,t,Pt,b,i);
}
}
static int pos;
static void insert(int p[],int t[],int Pt,int b,int i)
{
p[i]=Pt;
t[i]=b;
if(i==num-1)
{
int c[]=new int[num];
for(int x=0;x<num;x++)
{
c[x]=p[x];
}
Arrays.sort(c);
pos=c.length;
System.out.println("Order of execution of
Processes is");

for(int x=c.length-1;x>=0;x--)
{

15
 0832CS071103

for(int y=c.length-1;y>=0;y--)
{
if(c[x]==p[y])
{
System.out.println("Process
with Burst Time "+t[y]);
System.out.println("Process
with Priority "+p[y]);
}
}
}
}
}
}

Output

16