Saturday, 18 August 2012

pattern


#include<iostream>
#include<conio.h>
using namespace std;
void main()
{
int i,j,n;
for(i=1;i<=5;i++)
{
for(j=1;j<=i;j++)
{
cout<<i;
}
cout<<"\n";
}
getch();
}

OUTPUT
55555
 4444
  333
   22
    1

1 comment:

  1. #include

    struct proc
    {
    int id;
    int arrival;
    int burst;
    int rem;
    int wait;
    int finish;
    int ti;
    int turnaround;
    float ratio;
    }process[10];

    int no,k;
    int chkprocess(int);

    main()
    {
    int i, j,t,time = 0,n;
    struct proc temp;

    int nextprocess(int);

    printf("\n \n ---ROUND ROBIN SCHEDULING---\n \n ");
    printf("\n \n Enter the number of processes: ");
    scanf("%d", &n);
    printf("\n \n Enter the time slice of the CPU:");
    scanf("%d", &t);

    for(i = 1; i <= n; i++)
    {
    process[i].id = i;

    printf("\n\nEnter the arrival time for process %d: ", i);
    scanf("%d", &(process[i].arrival));

    printf("\n Enter the burst time for process %d: ", i);
    scanf("%d", &(process[i].burst));

    process[i].rem = process[i].burst;
    process[i].ti=0;
    process[i].wait=0;
    process[i].finish=0;

    }

    for(i = 1; i <= n; i++)
    {
    for(j = i + 1; j <= n; j++)
    {
    if(process[i].arrival > process[j].arrival)
    {
    temp = process[i];
    process[i] = process[j];
    process[j] = temp;
    }
    }
    }

    no = 0;
    j = 1;

    while(chkprocess(n) == 1)
    {

    if(process[no + 1].arrival == time)
    no++;

    if((process[j].ti<=t)&&(process[j].rem !=0))
    {
    process[j].rem--;
    process[j].ti++;

    for(i = 1; i <= no; i++)
    {
    if((i!=j) && (process[i].rem != 0))
    process[i].wait++;
    }
    }


    if(process[j].rem==0)
    process[j].finish=time;

    if((process[j].ti >= t)||(process[j].rem==0))
    {

    process[j].ti = 0;
    j=nextprocess(j);
    }
    time++;

    }
    process[n].finish = time;

    printf("\n\n\t\t\t---ROUND ROBIN SCHEDULING---");
    printf("\n\n Process Arrival Burst Waiting Finishing turnaround Tr/Tb \n");
    printf("%5s %9s %7s %10s %8s %9s\n\n", "id", "time", "time", "time", "time", "time");


    for(i = 1; i <= n; i++)
    {

    process[i].turnaround = (process[i].wait-1) + process[i].burst;
    process[i].ratio = (float)process[i].turnaround / (float)process[i].burst;

    printf("%5d %8d %7d %8d %10d %9d %10.1f ", process[i].id, process[i].arrival,
    process[i].burst,
    process[i].wait - 1, process[i].finish,
    process[i].turnaround, process[i].ratio);

    printf("\n\n");
    }
    }


    int chkprocess(int s)
    {
    int i;
    for(i = 1; i <= s; i++)
    {
    if(process[i].rem != 0)
    return 1;
    }
    return 0;
    }

    int nextprocess(int k)
    {
    int i;

    i=k+1;

    while(chkprocess(i) && i!=k)

    {
    if(process[i].rem != 0)

    return(i);
    else
    i=(i+1)%no;
    }
    }

    ReplyDelete