http://www.youtube.com/watch?v=O2I8lURCVO4

1  out of 1 found this valuable. Do you find this valuable? Do you?    

2  out of 2 found this valuable. Do you find this valuable? Do you?    

fork()
______

#include<stdio.h>
#include<unistd.h>
main()
{
printf("output\n");
printf("*****************\n");
printf("here comes the date");
fork();
execip("/bin/date","date",0);
printf("\n that was the date");
}

OUTPUT

sat oct 7 12:09:01 ist 2006

execip()
________

#include<stdio.h>
#include<unistd.h>
main()
{
printf("output\n");
printf("*****************\n");
execip("/bin/date","date",0);
printf("here comes the date");
abort();
}

OUTPUT

sat oct 7 12:09:01 ist 2006

3  out of 3 found this valuable. Do you find this valuable? Do you?    

ROUND ROBIN SCHEDULING
#include<stdio.h>
int main()
{
int
i,j,k,tbt=0,nop=0,ts=0,flag[20],rem[20],occ[20],to,from=0,
wt[20],tt[20],b[20];
float twt=0,ttt=0;
float awt,att;
printf("\n Enter the no. of processes: ");
scanf("%d", &nop);
printf("\n Enter the time slice: ");
scanf("%d", &ts);
for(i=0;i<nop;i++)
{
rem[i]=b[i]=wt[i]=tt[i]=occ[i]=0;
printf("\n Enter burst time for process
%d: ", i+1);
scanf("%d", &b[i]);
rem[i]=b[i];
tbt+=b[i];
flag[i]=0;
}
k=0;
from=0;
i=0;
printf("\n TIME \tPROCESS ID");
while(k<tbt)
{
if(!flag[i])
{
if(rem[i]<ts)
to=from+rem[i];
else
to=from+ts;
printf("\n%d - %d\t%d", from, to,
i+1);
rem[i]=rem[i]-(to-from);
if((rem[i]==0)&&(flag[i]==0))
{
flag[i]=1;
wt[i]=from-occ[i];
tt[i]=to;
}
occ[i]=occ[i]+(to-from);
k=k+(to-from);
from=to;
}
i++;
if(i==nop)
i=0;
}
twt=ttt=0;
for(k=0;k<nop;k++)
{
twt=twt+(float)wt[k];
ttt=ttt+(float)tt[k];
}
awt=twt/nop;
att=ttt/nop;
printf("\n PROCESS ID \t WAIT TIME \t TURN AROUND TIME
");
for(i=0;i<nop;i++)
printf("\n%d\t%d\t%d", i+1,wt[i],tt[i]);
printf("\n total wait time: %f", twt);
printf("\n total turn around time: %f", ttt);
printf("\n average wait time: %f", awt);
printf("\n average turn around time: %f", att);
}

2  out of 2 found this valuable. Do you find this valuable? Do you?    

PROGRAM FOR PRIORITY SCHEDULING:

#include<stdio.h>
main()
{
int n,i,j,avgfin=0,avgwait=0;
struct priority
{
int runtme,wttme,fintme,prty,pro_no;
}pri[10],temp;
printf("\n Enter the no of process:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("\nEnter the running time of process %d:",i+1);
scanf("%d",&pri[i].runtme);
printf("\nEnter the priority of process %d:",i+1);
scanf("%d",&pri[i].prty);
pri[i].pro_no=i+1;
}
for(i=0;i<n;i++)
{
for(j=0;j<n;j++)
{
if(pri[i].prty<pri[j].prty)
{
temp=pri[i];
pri[i]=pri[j];
pri[j]=temp;
}
}
}
printf("\nProcess_no\tPriority\tRunning\tWaiting\tFinishing");
for(i=0;i<n;i++)
{
if(i==0)
{
pri[i].wttme=0;
}
else
{
pri[i].wttme=pri[i-1].wttme+pri[i-1].runtme;
}
pri[i].fintme=pri[i].runtme+pri[i].wttme;
avgfin+=pri[i].fintme;
avgwait+=pri[i].wttme;
}
avgfin=avgfin/n;
avgwait=avgwait/n;
for(i=0;i<n;i++)
{
printf("\n%d\t\t%d\t\t%d\t%d\t%d",pri[i].pro_no,pri[i].prty,pri[i].runtme,pri[i].wttme,pri[i].fintme);
}
printf("\nAverage finishing time:%d",avgfin);
printf("\nAverage waiting time:%d",avgwait);
}

 out of  found this valuable. Do you find this valuable?    

PROGRAM FOR FCFS SCHEDULING
#include<stdio.h>
main()
{
int n,i,avgturn=0,avgwait=0;
struct fcfs
{
int arrtme,runtme,wttme,fintme,tatme;
}temp;
struct fcfs first[10];
printf("\n Enter the no of process:");
scanf("%d",&n);
for(i=0;i<n;i++)
{
printf("\nEnter the arrival time of process %d:",i+1);
scanf("%d",&first[i].arrtme);
printf("\nEnter the running time of process %d:",i+1);
scanf("%d",&first[i].runtme);
}
printf("\nArrival Time\tRunning Time\tWaiting Time\tFinishing Time\tTurnarond Time");
for(i=0;i<n;i++)
{
if(i==0)
{
first[i].wttme=0;
}
else
{
first[i].wttme=first[i-1].wttme+first[i-1].runtme;
}
first[i].fintme=first[i].runtme+first[i].wttme;
first[i].tatme=first[i].fintme-first[i].arrtme;
avgturn+=first[i].tatme;
avgwait+=first[i].wttme;
}
avgturn=avgturn/n;
avgwait=avgwait/n;
for(i=0;i<n;i++)
{
printf("\n%d\t\t%d\t\t%d\t\t%d\t\t%d",first[i].arrtme,first[i].runtme,first[i].wttme,first[i].fintme,first[i].tatme);
}
printf("\nAverage turnaround time:",avgturn);
printf("\nAverage waiting time:",avgwait);
}

 out of  found this valuable. Do you find this valuable?    

#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int pageaddr,pgno,off,phy_addr,temp,pageaddress[5],flag = 0,j,cnt = 0;
int n = 5;
//page table
int page[81][2] = {
{10,34},
{20,51},
{30,33},
{40,11},
{50,21}
};
cout<<"\nEnter the 4 digit address\n";
cin>>pageaddr;
for(int i = 4;i > 0;i--)//Splitting the user input address into page no. and offset.
{
temp = pageaddr%10;
pageaddr = pageaddr/10;
pageaddress[i-1] = temp;
}
pgno = pageaddress[0]*10+pageaddress[1];
off = pageaddress[2]*10+pageaddress[3];
for(i = 0;i<n;i++)//Finding if the page table contains the page no.
{
for(j=0;j<2;j++)
{
if(page[i][j] == pgno)
{
phy_addr = page[i][j+1];
cnt = 0;
break;
}
else
if(page[i][j]!=pgno)
{
cnt = 1;

}
}
if(cnt > 0)
{
flag++;
}
cout<<endl;
}
if(flag == n) //If it is not found then add it to page table and calculate the address.
{
page[n][0] = pgno;
page[n][1] = 70;
phy_addr = page[n][1] + off;
}
else
{
phy_addr = phy_addr+off;
}
cout<<"PHYSICAL ADDRESS IS"<<phy_addr<<endl;
getch();
}

 out of  found this valuable. Do you find this valuable?    

#include<stdio.h>
#include<conio.h>
void main()
{
int user_addr,segno,segaddress[10],temp,off,addr,phy_addr,flag = 0,cnt = 0,len = 0,i,j,n = 5;
//Segment Table
int segment[81][3]={
{1,45,50},
{2,30,50},
{3,67,80},
{4,56,70},
{5,36,45}
};

clrscr();
printf("\nEnter the 3 or 4 digit address\n");
scanf("%d",&user_addr);
addr=user_addr;
while(addr>0)//Finding out the length of the address( length may be 3 or 4)
{
temp = addr%10;
addr = addr/10;
len++;
}
addr = 0;
if(len==3)
{
for(i=3;i>0;i--)//Splitting user input address into segment no and offset for length 3.
{
temp = user_addr%10;
user_addr = user_addr/10;
segaddress[i-1] = temp;
}
segno = segaddress[0];
off = segaddress[1] * 10 +segaddress[2];
}
else
if(len == 4)
{
for(i=4;i>0;i--)//Splitting user input address into segment no and offset for length 3.
{
temp = user_addr%10;
user_addr = user_addr/10;
segaddress[i-1] = temp;
}
segno = segaddress[0] * 10 + segaddress[1];
off = segaddress[2] * 10 +segaddress[3];
}
for(i = 0;i<n;i++)//Finding if the segment table contains the segment no.
{
for(j=0;j<3;j++)
{
if((segment[i][j] == segno)&&(off<segment[i][j+2]))
{
addr = segment[i][j+1];
cnt = 0;
break;
}
if((segment[i][j] == segno)&&(off>segment[i][j+2]))
{
printf("\n OS TRAPPED!OFFSET EXCEEDS LIMIT\n");
printf("PROCESS TERMINATED....PRESS ANY KEY TO EXIT\n");
getch();
exit(0);
}
else
if(segment[i][j] != segno)
{
cnt = 1;
}

}
if(cnt > 0)
{
flag++;
}
printf("\n");
}

 out of  found this valuable. Do you find this valuable?    

#include<dos.h>
#include<conio.h>
#include<iostream.h>

void main()
{
int n,temp1,process[10],burst[10],j,i,temp[10];
int sum = 0;
temp[0] = 0;
cout<<"Enter the no of processes in the ready queue\n";
cin>>n;
cout<<"\nEnter The Corresponding Burst Times\n";
for(i = 0;i<n;i++)
{
cin>>burst[i];
process[i] = i+1;
}

for(i = 0;i<n;i++)
{
for(j=i+1;j<n;j++)
{
if(burst[i]>burst[j])
{
temp1 = burst[i];
burst[i] = burst[j];
burst[j] = temp1;
temp1 = process[i];
process[i] = process[j];
process[j] = temp1;
}
}
}
cout<<"The SJF Algorithm Gives The Following Order\n";
cout<<"Process"<<"\t"<<"Burst Time"<<endl;
temp[0] = 0;
for(i = 0;i<n;i++)
{
cout<<"P"<<process[i]<<"\t"<<burst[i]<<endl;
sum = sum+burst[i];
temp[i+1] =sum;
}
cout<<"process"<<"\t"<<"waiting time"<<endl;
for(i = 0;i<n;i++)
{
cout<<"P"<<process[i]<<"\t"<<temp[i]<<endl;
}

getch();
}

 out of  found this valuable. Do you find this valuable?    

create table aggr(emp_id int primary key,emp_na varchar(25),emp_company varchar(25),salary int)
insert into aggr values(1,'bala','tcs',46000)
insert into aggr values(2,'balaji','cts',40700)
insert into aggr values(3,'karthik','wipro',42500)
insert into aggr values(4,'das','hcl',45000)
insert into aggr values(5,'dinesh','hexaware',47500)
select * from aggr
select avg(salary)average_salary from aggr
select max(salary)maximum_salary from aggr
select min(salary)minimum_salary from aggr
select sum(salary)sum_salary from aggr
select count(emp_company)number_of_company from aggr
select sum(salary)sum_salary_group from aggr group by emp_na

1  out of 1 found this valuable. Do you find this valuable? Do you?