Zero Exception

Write a program to implement following UNIX commands mv <source file> <target file> it moves file into target file. cp <source file> <target file> it copies file into target file. rm <target file> it deletes the file. Program: #include <stdio.h> #include <stdlib.h> #include <string.h> void main(){ setbuf(stdout,NULL); FILE *fp1, *fp2; char s[50], cm[20], path1[20], path2[20], ch; while(1){ printf("\nAP:>"); gets(s); if(strcmp(s,"exit")==0){ exit(0); }else{ sscanf(s,"%s%s%s",&cm,&path1,&path2); if(strcmp(cm,"rm")==0){ if(remove(path1)==0){ printf("File Deleted."); }else{ printf("File not deleted."); } }else if(strcmp(cm,"mv")==0){ fp1 = fopen(path1,"r"); fp2 = fopen(path2,"w"); while(!feof(fp1)){ ch = fgetc(fp1); fputc(ch,fp2); } remove(path1); }

Write a Java program which will create two child threads by implementing Runnable interface. One thread will print even numbers from 1 to 50 and other display vowels. Program: import java.io.*; import java.util.*; public class EvenNumberVowel implements Runnable { String name; Thread t; EvenNumberVowel(String str) { name = str; t = new Thread(this, name); t.start(); } public void run() { name = Thread.currentThread().getName(); if(name.equals("First")) { for(int i=1;i<=50;i++){ try { if(i%2==0) { System.out.println("First:"+i); t.sleep(500); } } catch(InterruptedException ie) { System.out.println(ie); } } } else if(name.equals("Second")) { char vowels[] = {'A','E','I'

Write the simulation program for non-preemptive scheduling algorithm using SJF. The arrival time and first CPU bursts of different jobs should be input to the system. The output should give the Gantt chart and Turnaround time for each process and average time. Program: #include <stdio.h> #include <stdlib.h> void main(){ setbuf(stdout,NULL); int f,max[10][10]={0,0},al[10][10]={0,0},need[10][10]={0,0},av[10]={0},i,j,m,n,cp[10]={0},sf[10]; printf("\nEnter the number of processes:"); scanf("%d",&m); printf("\nEnter the number of resources:"); scanf("%d",&n); printf("\nEnter Max matrix:"); for(i=0;i<n;i++){ for(j=0;j<m;j++){ scanf("%d",&max[i][j]); } } printf("Enter the allocation matrix:"); for(i=0;i<n;i++){ for(j=0;j<m;j++){ scanf("%d",&al[i][j]); } } printf("Enter available matrix:"); for(i=0;i<n;i++){ scanf("%d&

Write a Java program to accept number from user and Calculate factorial of given number and Also check whether given number is prime or not. (Use Thread) Program: import java.io.*; import java.lang.*; class FactPrime extends Thread { String str; int num1, num2, fact=1, flag=1, i; FactPrime(String s, int n) { num1 = n; str = s; setName(str); start(); } public void run() { if(str.equals("First")) { try { for(i=1; i<=num1; i++) { fact = fact*i; sleep(500); } System.out.println("Factorial: "+fact); } catch (InterruptedException e) { System.out.println(e); } } else if(str.equals("Second")) { try { for(i=2;i<num1;i++) { if(num1%i==0){ flag = 0; bre

Write a program to implement ls command of UNIX with following options on DOS. ls -l to display long listing of files rowwise. ls -Q to display the filename in double quotes. ls -c to sort the files on last modification time of the files Program: #include <stdio.h> #include <stdlib.h> #include <dirent.h> #include <string.h> void main(){ setbuf(stdout,NULL); DIR *dir; struct dirent *ent; char s[80], c[5], f[50], ar[2], ch[2]; while(1){ printf("\nAP:>"); gets(s); if(strcmp(s,"exit")==0){ exit(0); } sscanf(s,"%s %s %s",&c,&ch,&f); if(strcmp(c,"ls")!=0){ printf("Invalid Command"); }else if(strcmp(ch,"-l")==0){ if((dir = opendir(f))==NULL){ perror("Unable to open directory."); exit(1); } while((ent=readdir(dir))!=NULL){ printf("\n%s",ent->d_name); } if(closedir(dir)!=0){ perror("Unable to close dir

Write a Java Program to insert the details of Actor(ano, name, movie) into database and display result in Uppercase. Program: import java.sql.*; import java.io.*; class Actor { public static void main(String args[]) throws SQLException, ClassNotFoundException, IOException { String name, movie; int ano; char ch; BufferedReader br; Class.forName("sun.jdbc.odbc.JdbcOdbcDriver"); COnnection con = DriverManager.getConnection("jdbc:odbc:actorDSN"); do { PreparedStatement stmt = con.prepareStatement("insert into actor values(?,?,?)"); br = new BufferedReader(new InputStreamReader(System.in)); System.out.println("Enter Actor No:"); ano = Integer.parseInt(br.readLine()); System.out.println("Enter Name:"); name = br.readLine(); System.out.println("Enter Movie Name:"); m

Write a simulation program for disk scheduling using FCFS algorithm. Accept total number of disk blocks, disk request string, direction of head movement and current head position from the user. Display the list of request order in which it is served. Also display the total number of head movements. Program: #include <stdio.h> #include <stdlib.h> void main(){ setbuf(stdout,NULL); int ap[50],i,th,n,cp; printf("\nEnter the number of memory blocks:"); scanf("%d",&n); printf("\nEnter the current position:"); scanf("%d",&cp); printf("\nEnter request string:"); for(i=0;i<n;i++){ scanf("%d",&ap[i]); } th=0; for(i=0;i<n;i++){ if(cp>ap[i]){ th+=cp-ap[i]; cp=ap[i]; } else{ th+=ap[i]-cp; cp=ap[i]; } printf(" %d",ap[i]); } printf("\nTotal head movements:%d",th); }

Write a Java program to accept the details of Teacher(tno, name, salary) from the user and store into the database table and update the salary of techer yo entered salary amount and tno. Program: import java.io.*; import java.sql.*; class Teacher { public static void main(String args[]) throws SQLException, ClassNotFoundException, IOException { int tno, salary, choice, r; String name; Statement s; ResultSet rs; BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); Class.forName("sun.jdbc.odbc.JdbcOdbcDriver"); Connection con = DriverManager.getConnection("jdbc:odbc:teacherDSN"); do { System.out.println("Menu"); System.out.println("\n 1. Add Teacher \n 2. Update Teacher Salary"); switch(choice) { case 1: PreparedStatement ps = con.prepareStatement("insert into Teacher values(

System with m process and n resource types. Accept number of instances for every resource type. For each process accept the allocation and maximum requirement matrices. Write a program to check if given request of process can be granted immediately or not. Program: #include <stdio.h> #include <stdlib.h> void main(){ setbuf(stdout,NULL); int m,n,i,j,al[10][10],av[10],rq[10],tr[10],temp; printf("\nEnter the number of processes:"); scanf("%d",&m); printf("\nEnter the number of resources:"); scanf("%d",&n); printf("\nEnter the allocation matrix:"); for(i=0;i<m;i++){ for(j=0;j<n;j++){ scanf("%d",&al[i][j]); } } printf("\nEnter Total resources array:"); for(i=0;i<n;i++){ scanf("%d",&tr[i]); } printf("\nEnter the request array:"); for(i=0;i<n;i++){ scanf("%d",&rq[i]); } for(i=0;i<n;i++){ temp=0; for(j=0;j<m;

Write a Java program to display the record of Student(rollNo, name, marks) on the screen by selecting rollno from the choice component. Program: import java.awt.*; import java.awt.event.*; import java.sql.*; import java.io.*; public class Student extends Frame implements ActionListener { Choice rollNo; Connection con; Statement stmt; ResultSet rs; String sql; public Student() throws SQLException, ClassNotFoundException { Class.forName("sun.jdbc.odbc.JdbcOdbcDriver"); con = DriverManager.getConnection("jdbc:odbc:patientDSN"); stmt = con.createStatement(); rs.executeQuery("Select * from student"); setSize(300,200); setVisible(true); setLayout(new FlowLayout()); addWindowListener(new WClose()); rollNo.ItemListener(this); while(rs.next()){ rollNo.addItem(String.valueOf(rs.getInt(1))); } add(rollNo); } stmt.close()

Write the simulation program for preemptive scheduling algorithm using SJF. The arrival time and first CPU bursts of different jobs should be input to the system. The output should give the Gantt chart and waiting time for each process and average times. Program: #include <stdio.h> #include <stdlib.h> struct sch{ int wt,at,ft,bt,st; }pr[50],temp[50]; int rq[50],x,n,timer; void addp(){ int i; for(i=0;i<n;i++){ if(pr[i].at==timer){ rq[++x]=i; } } } int selectp(){ int pp,i; if(x<0){ return(-1); }else{ pp=rq[0]; for(i=1;i<=x;i++){ if(temp[pp].bt>temp[i].bt){ pp=i; } } for(i=pp;i<x;i++){ rq[i]=rq[i+1]; } x--; return(pp); } } void main(){ setbuf(stdout,NULL); int i,t,p; float awt; timer=0; x=-1; printf("Enter the Number of processes:"); scanf("%d",&n); for(i=0;i<n;i++){ printf("\nEnter arrival time:"); scanf("%d",&pr[i].at); printf("\nEnter burs

Write a Java program to accept the details of patient(pno, pname) from user and insert it into the database, display it and delete the record of entered pno from the table Program: import java.io.*; import java.sql.*; import java.awt.*; import java.awt.event.*; public class Patient extends Frame implements ActionListener { Label labelPNo, labelPName; TextField textPNo, textPName; Button btnAdd, btnDelete; String sql; Statement stmt; Connection con; public Patient() throws SQLException, ClassNotFoundException { Class.forName("sun.jdbc.odbc.JdbcOdbcDriver"); con = DriverManager.getConnection("jdbc:odbc:patientDSN"); setLayout(new FlowLayout()); setSize(300,200); labelPNo = new Label("Patient No:"); labelPName = new Label("Patient Name:"); textPNo = new TextField(20); textPName = new TextField(20); btnAdd = new Button("Add");

Write a simulation program for disk scheduling using LOOK algorithm. Accept total number of disk blocks, disk request string, direction of head movement and current head position from the user. Display the list of request in order in which it is served. Also display the total number of head movements. Program: #include <stdio.h> #include <stdlib.h> void main(){ setbuf(stdout,NULL); int rst[50],cp,th,max,min,tt,n,i,temp; char d; printf("Enter how many blocks:"); scanf("%d",&n); printf("\nEnter current positon of head:"); scanf("%d",&cp); printf("\nEnter total number of tracks:"); scanf("%d",&tt); printf("\nEnter the direction:"); scanf(" %c",&d); printf("\nEnter Request string:"); for(i=0;i<n;i++){ scanf("%d",&rst[i]); } max=rst[0]; min=rst[0]; for(i=0;i<n;i++){ if(min>rst[i]){ min=rst[i]; } if(max<rst[i]){ m