tag:blogger.com,1999:blog-67786123847485168152024-02-20T13:40:16.267-08:00MCA (SS) 2015-18 (CEG)Anonymoushttp://www.blogger.com/profile/17500490344132420321noreply@blogger.comBlogger14125tag:blogger.com,1999:blog-6778612384748516815.post-46785747985280839142016-04-22T23:27:00.001-07:002016-04-22T23:27:34.028-07:00Banker Algorithms<div dir="ltr" style="text-align: left;" trbidi="on">
#include<stdio.h><br />
#include<conio.h><br />
int main()<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int a[10][10],b[10][10],c[10][10],e[10],i,j,k,l,total[10],s=0,f[10],p[10],count=0,po=1,count1=0,n1,n2;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>printf("Number of Process:-");<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>scanf("%d",&n1);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>printf("Number of Resource:-");<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>scanf("%d",&n2);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(i=0;i<n2;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>printf("Resource %d:-",i+1);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>scanf("%d",&total[i]);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>printf("Maximum:-\n");<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(i=0;i<n1;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(j=0;j<n2;j++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>scanf("%d",&a[i][j]);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>p[i]=i;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>printf("Allocation:-\n");<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(i=0;i<n1;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(j=0;j<n2;j++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>scanf("%d",&b[i][j]);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>printf("Need:-\n");<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(i=0;i<n1;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(j=0;j<n2;j++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>c[i][j]=a[i][j]-b[i][j];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>printf("%d ",c[i][j]);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>printf("\n");<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(i=0;i<n2;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(j=0;j<n1;j++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>s=s+b[j][i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>e[i]=s;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>s=0;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
for(i=0;i<n2;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>f[i]=total[i]-e[i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>i=0;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>kl:<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>po=1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(j=0;j<n2&&p[i]!=900;j++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(c[i][j]<=f[j])<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>count++;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>else<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>break;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(count==n2)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(k=0;k<n2;k++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>f[k]+=b[i][k];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>printf("Sequence-%d\n",p[i]);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>p[i]=900;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>po=0;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>count=0;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(po==0)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>i=0;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>else<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>i++;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(i!=n1)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>goto kl;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(i=0;i<n1;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(p[i]==900)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>count1++;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(count1==n1)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>printf("\n\nSafe State\n");<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>else<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>printf("Unsafe State\n");<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>getch();<br />
}<br />
<br /></div>
Anonymoushttp://www.blogger.com/profile/17500490344132420321noreply@blogger.com0tag:blogger.com,1999:blog-6778612384748516815.post-26982727639082238142016-04-15T03:10:00.001-07:002016-04-15T03:10:11.150-07:00HEAP SORT C++ IMPLEMENTATION<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />
using namespace std;<br />
<br />
class sort<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int a[10],n,i,j,size;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>public:<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>void val();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>void buildmax();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>void maxheapify(int);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>void heapsort();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>void print();<br />
};<br />
void sort::val()<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<"Enter element Size : ";<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cin>>n;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(i=1;i<=n;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<"elem "<<i<<" : " ;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cin>>a[i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>i=1,j=n;<br />
<br />
}<br />
void sort::heapsort()<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int temp;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>buildmax();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(i=n;i>=2 ;i--)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> temp=a[i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> a[i]=a[1];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> a[1]=temp;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> size=size-1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> maxheapify(1);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
}<br />
<br />
<br />
void sort::buildmax()<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>size=n;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(i=n/2;i>=1;i--)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>maxheapify(i);<br />
}<br />
void sort::maxheapify(int i)<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int lar;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int l=i*2;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int r=i*2+1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(l<=size&&a[l]>a[i])<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>lar=l;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>else<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>lar=i;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(r<=size&&a[r]>a[lar])<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>lar=r;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(i!=lar)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int temp=a[i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[i]=a[lar];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[lar]=temp;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>maxheapify(lar);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<br />
}<br />
<br />
void sort::print()<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<"\n\theap Sort\n";<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(i=1;i<=n;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<"\t"<<a[i];<br />
}<br />
int main()<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>sort obj;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>obj.val();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>obj.heapsort();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>obj.print();<br />
}<br />
<br /></div>
Anonymoushttp://www.blogger.com/profile/17500490344132420321noreply@blogger.com0tag:blogger.com,1999:blog-6778612384748516815.post-48342316253546988312016-04-15T03:03:00.001-07:002016-04-15T03:03:42.600-07:00Quick sort c++ implementation<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />
using namespace std;<br />
class sorting<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int a[10],n;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>public:<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>sorting()<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<"Number of Element:-";<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cin>>n;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<"Unsorted Element:-";<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(int i=1;i<=n;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cin>>a[i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int p=1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int r=n;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>quick(p,r);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int operation(int p,int r)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int x=a[r];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int i=p-1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(int j=p;j<r;j++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(a[j]<=x)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>i++;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int t=a[i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[i]=a[j];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[j]=t;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int t1=a[i+1];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[i+1]=a[r];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[r]=t1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>return i+1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>void quick(int p,int r)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(p<r)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int q=operation(p,r);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>quick(p,q-1);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>quick(q+1,r);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>void disp()<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<"Sorted Element:-";<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(int i=1;i<=n;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<a[i]<<endl;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
};<br />
int main()<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>sorting x;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>x.disp();<br />
}</div>
Anonymoushttp://www.blogger.com/profile/17500490344132420321noreply@blogger.com0tag:blogger.com,1999:blog-6778612384748516815.post-73996175694717129812016-04-15T02:53:00.002-07:002016-04-15T02:53:51.000-07:00merge sort c++ implementation<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />
using namespace std;<br />
class sorting<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int a[10],n;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>public:<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>sorting()<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<"Number of Element:-";<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cin>>n;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<"Unsorted Element:-";<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(int i=1;i<=n;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cin>>a[i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int p=1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int r=n;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>merge(p,r);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>void operation(int p,int q,int r)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int n1=-p+1+q;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int n2=r-q;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int L[10];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int R[10];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>L[n1+1]=9999;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>R[n2+1]=9999;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(int i=1;i<=n1;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>L[i]=a[p+i-1];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(int i=1;i<=n1;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>R[i]=a[q+i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int i=1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int j=1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(int k=p;k<=r;k++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(L[i]<R[j])<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[k]=L[i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>i++;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>else<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[k]=R[j];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>j++;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>void merge(int p,int r)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(p<r)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int q=(p+r)/2;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>merge(p,q);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>merge(q+1,r);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>operation(p,q,r);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>void disp()<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<"Sorted Element:-";<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(int i=1;i<=n;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<a[i]<<endl;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
};<br />
int main()<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>sorting x;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>x.disp();<br />
}</div>
Anonymoushttp://www.blogger.com/profile/17500490344132420321noreply@blogger.com0tag:blogger.com,1999:blog-6778612384748516815.post-64435342163867734002016-04-15T02:44:00.001-07:002016-04-15T02:44:06.453-07:00INSERTION SORT..........<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />
using namespace std;<br />
class sorting<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int a[10],i,n;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>public:<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>sorting()<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<"Number of Element:-";<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cin>>n;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<"Unsorted Element:-";<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(i=1;i<=n;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cin>>a[i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>void insertion()<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(int j=2;j<=n;j++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>i=j-1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int key=a[j];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>while(i>0&&a[i]>key)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[i+1]=a[i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>i--;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[i+1]=key;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span><br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>void disp()<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<"Sorted Element:-";<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(i=1;i<=n;i++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cout<<a[i]<<endl;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
};<br />
int main()<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>sorting x;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>x.insertion();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>x.disp();<br />
}</div>
Anonymoushttp://www.blogger.com/profile/17500490344132420321noreply@blogger.com0tag:blogger.com,1999:blog-6778612384748516815.post-74849734439082846052016-04-06T08:00:00.000-07:002016-04-06T08:00:27.808-07:00FIRST COME FIRST SERVE IN C<div dir="ltr" style="text-align: left;" trbidi="on">
#include<stdio.h><br />int main()<br />{<br /> int n,at[10],bt[10],ct[10],wt[10],tot[10],i,s=0;<br /> printf("No of Process:-");<br /> scanf("%d",&n);<br /> for(i=0;i<n;i++)<br /> {<br /> printf("Arrival Time For p[%d]=",i+1);<br /> scanf("%d",&at[i]);<br /> printf("Burst Time For p[%d]=",i+1);<br /> scanf("%d",&bt[i]);<br /> }<br /> for(i=0;i<n;i++)<br /> {<br /> ct[i]=s+bt[i];<br /> s=ct[i];<br /> }<br /> for(i=0;i<n;i++)<br /> {<br /> tot[i]=ct[i]-at[i];<br /> wt[i]=tot[i]-bt[i];<br /> }<br /> for(i=0;i<n;i++)<br /> {<br /> printf("%d\t%d\t%d\t%d\n",at[i],bt[i],wt[i],tot[i]);<br /> }<br />}</div>
Anonymoushttp://www.blogger.com/profile/17500490344132420321noreply@blogger.com0tag:blogger.com,1999:blog-6778612384748516815.post-79394560393692120252016-04-01T11:36:00.003-07:002016-04-01T11:36:56.247-07:00MERGE SORT C++ IMPLEMENTATION (COREMAN)<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream.h><br />#include<conio.h><br /><br />class sort<br />{<br /> int a[10],n,i,j;<br /> public:<br /> void val();<br /> void mergesort(int,int);<br /> void merge(int,int,int);<br /> void print();<br />};<br />void sort::val()<br />{<br /> cout<<"Enter element Size : ";<br /> cin>>n;<br /> for(i=1;i<=n;i++)<br /> {<br /> cout<<"elem "<<i<<" : " ;<br /> cin>>a[i];<br /> }<br /> i=1,j=n;<br /> mergesort(i,j);<br />}<br />void sort::mergesort(int p,int r)<br />{<br /> if(p<r)<br /> {<br /> int q=(p+r)/2;<br /> mergesort(p,q);<br /> mergesort(q+1,r);<br /> merge(p,q,r);<br /> }<br />}<br />void sort::merge(int p,int q,int r)<br />{<br /> int n1,n2;<br /> int l[10],ri[10];<br /> n1=q-p+1;<br /> n2=r-q;<br /> for(i=1;i<=n1;i++)<br /> l[i]=a[p+i-1];<br /> for(j=1;j<=n2;j++)<br /> ri[j]=a[q+j];<br /><br /> l[i]=3000;<br /> ri[j]=4000;<br /> i=j=1;<br /> for(int k=p;k<=r;k++)<br /> {<br /> if(l[i]<=ri[j])<br /> a[k]=l[i++];<br /> else<br /> a[k]=ri[j++];<br /> }<br />}<br />void sort::print()<br />{<br /> cout<<"\n\tMerge Sort\n";<br /> for(i=1;i<=n;i++)<br /> cout<<"\t"<<a[i];<br />}<br />void main()<br />{<br /> clrscr();<br /> sort obj;<br /> obj.val();<br /> obj.print();<br /> getch();<br />}</div>
Anonymoushttp://www.blogger.com/profile/17500490344132420321noreply@blogger.com0tag:blogger.com,1999:blog-6778612384748516815.post-40704672150928620362016-04-01T07:40:00.002-07:002016-04-01T07:40:49.986-07:00QUICKSORT IMPLEMENTATION IN C++ (COREMAN)<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream.h><br />
#include<conio.h><br />
class xyz<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int a[10],n;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>public:<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>xyz();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>void QUICKSORT(int [],int ,int );<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int PARTITION1(int [],int,int );<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>void disp();<br />
};<br />
xyz::xyz()<br />
{<br />
cout<<"Enter the size of the array"<<endl;<br />
cin>>n;<br />
cout<<"Enter the elements in the array"<<endl;<br />
for(int i=1;i<=n;i++)<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>cin>>a[i];<br />
}<br />
// cout<<"sorting using quick sort"<<endl;<br />
int p=1,r=n;<br />
QUICKSORT(a,p,r);<br />
}<br />
void xyz::disp()<br />
{<br />
cout<<"sorted form"<<endl;<br />
for(int i=1;i<=n;i++)<br />
{<br />
cout<<"\t"<<a[i];<br />
}<br />
}<br />
void xyz::QUICKSORT(int a[],int p,int r)<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int q;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>if(p<r)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> q=PARTITION1(a,p,r);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> QUICKSORT(a,p,q-1);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> QUICKSORT(a,q+1,r);<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
}<br />
<br />
int xyz::PARTITION1(int a[],int p,int r)<br />
{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int temp,temp1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int x=a[r];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>int i=p-1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>for(int j=p;j<=r-1;j++)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>{<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> if(a[j]<=x)<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> {<br />
<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>i=i+1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>temp=a[i];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[i]=a[j];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[j]=temp;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span> }<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>}<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>temp1=a[i+1];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[i+1]=a[r];<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>a[r]=temp1;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>return (i+1);<br />
}<br />
void main()<br />
{ clrscr();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>xyz x;<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>x.disp();<br />
<span class="Apple-tab-span" style="white-space: pre;"> </span>getch();<br />
}<br />
<div>
<br /></div>
</div>
Anonymoushttp://www.blogger.com/profile/17500490344132420321noreply@blogger.com0tag:blogger.com,1999:blog-6778612384748516815.post-32045588434022525882016-04-01T04:14:00.004-07:002016-04-01T04:14:48.417-07:00INSERTION SORT C++<div dir="ltr" style="text-align: left;" trbidi="on">
#include<iostream><br />using namespace std;<br />class xyz<br />{<br /> int a[10],n;<br /> public:<br /> xyz();<br /> void sort();<br /> void disp();<br />};<br />xyz::xyz()<br />{<br /> cout<<"Enter no of Element:-";<br /> cin>>n;<br /> cout<<"Enter Unsorted Number....";<br /> for(int i=0;i<n;i++)<br /> {<br /> cin>>a[i];<br /> }<br />}<br />void xyz::sort()<br />{<br /> for(int j=1;j<n;j++)<br /> {<br /> int i=j-1;<br /> int key=a[j];<br /> while(i>=0&&a[i]>key)<br /> {<br /> a[i+1]=a[i];<br /> i--;<br /> }<br /> a[i+1]=key;<br /> }<br />}<br />void xyz::disp()<br />{<br /> for(int i=0;i<n;i++)<br /> {<br /> cout<<a[i];<br /> }<br />}<br />int main()<br />{<br /> xyz x;<br /> x.sort();<br /> x.disp(); <br />}<br /><br /> <br /> <br /></div>
Anonymoushttp://www.blogger.com/profile/17500490344132420321noreply@blogger.com0tag:blogger.com,1999:blog-6778612384748516815.post-66334769851863713852016-03-30T01:18:00.002-07:002016-03-30T01:18:34.108-07:00TCP ECHO PROGRAM<div dir="ltr" style="text-align: left;" trbidi="on">
***************************************SERVER*******************************<br />
<br />
#include<stdio.h><br />#include<netinet/in.h><br />#include<netdb.h><br />#define SERV_TCP_PORT 5035<br />int main(int argc,char**argv)<br />{<br /> int clen,sockfd,clientfd;<br /> char buffer[4096];<br /> struct sockaddr_in server1,client1;<br /> sockfd=socket(AF_INET,SOCK_STREAM,0);<br /> if(sockfd==-1)<br /> printf("Socket Creation Failed....\n");<br /> else<br /> printf("Socket Created.....\n");<br /> server1.sin_family=AF_INET;<br /> server1.sin_port=htons(SERV_TCP_PORT);<br /> server1.sin_addr.s_addr=INADDR_ANY;<br /> bind(sockfd,(struct sockaddr *)&server1,sizeof(server1));<br /> printf("Binding......\n");<br /> listen(sockfd,5);<br /> printf("Listening.....\n");<br /> clen=sizeof(client1);<br /> clientfd=accept(sockfd,(struct sockaddr *)&client1,&clen);<br /> printf("Accepted....\n");<br /> read(clientfd,buffer,4096);<br /> printf("CLIENT:-%s",buffer);<br /> write(clientfd,buffer,4096);<br /> close(sockfd);<br />} <br /> <br /> <br />
******************************************CLIENT********************************<br />
<br />
<br />
#include<stdio.h><br />#include<sys/types.h><br />#include<sys/socket.h><br />#include<netinet/in.h><br />#include<netdb.h><br />#define SERV_TCP_PORT 5035<br />int main(int argc,char**argv)<br />{<br /> int sockfd;<br /> struct sockaddr_in server1;<br /> struct hostent *server;<br /> char buffer[4096];<br /> sockfd=socket(AF_INET,SOCK_STREAM,0);<br /> server1.sin_family=AF_INET;<br /> server1.sin_port=htons(SERV_TCP_PORT);<br /> server1.sin_addr.s_addr=inet_addr("127.0.0.1");;<br /> connect(sockfd,(struct sockaddr*)&server1,sizeof(server1));<br /> printf("enter Message..");<br /> fgets(buffer,4096,stdin);<br /> write(sockfd,buffer,4096);<br /> printf("%s",buffer);<br /> close(sockfd);<br /> return 0;<br /> <br /> <br /><br />}<br /> <br /> </div>
Anonymoushttp://www.blogger.com/profile/17500490344132420321noreply@blogger.com0tag:blogger.com,1999:blog-6778612384748516815.post-83733578275250679342016-03-30T01:16:00.000-07:002016-03-30T01:16:50.978-07:00TCP CHAT PROGRAM<div dir="ltr" style="text-align: left;" trbidi="on">
**********************************SERVER***************************************<br />
<br />
#include <sys/types.h> <br />#include <sys/socket.h><br />#include<stdio.h><br />#include <unistd.h><br />#include<netinet/in.h><br />#include<string.h><br />#define SERV_TCP_PORT 5035<br /><br />int main(int argc,char**argv)<br />{<br /> int sockfd,clientfd,len;<br /> char tubelight[100];<br /> struct sockaddr_in server1,client1;<br /> sockfd=socket(AF_INET,SOCK_STREAM,0);<br /> if(sockfd==-1)<br /> {<br /> printf("Socket Creation Fail\n");<br /> }<br /> else<br /> printf("Socet Created....\n");<br /> server1.sin_family=AF_INET;<br /> server1.sin_port=htons(SERV_TCP_PORT);<br /> server1.sin_addr.s_addr=INADDR_ANY;<br /> bind(sockfd,(struct sockaddr*)&server1,sizeof(server1));<br /> <br /> printf("Binding......\n");<br /> listen(sockfd,5);<br /> printf("Listening.........\n");<br /> len=sizeof(client1);<br /> <br /> clientfd=accept(sockfd,(struct sockaddr*)&client1,&len);<br /> printf("Accepted......\n");<br /> while(1)<br /> {<br /> read(clientfd,tubelight,100);<br /> printf("TUBELIGHT=%s",tubelight);<br /> bzero(tubelight,sizeof(tubelight));<br /> printf("SUMIT:-");<br /> fgets(tubelight,100,stdin);<br /> write(clientfd,tubelight,100);<br /> <br /> <br /> }<br /> close(sockfd);<br />}<br /> <br />
<br />
*****************************************CLIENT**********************************<br />
<br />
#include<stdio.h><br />#include <sys/types.h> <br />#include <sys/socket.h><br />#include<netinet/in.h><br />#include<string.h><br />#define SERV_TCP_PORT 5035<br />int main(int argc,char **argv)<br />{<br /> int sockfd;<br /> char tubelight[100];<br /> struct sockaddr_in server1;<br /> struct hostent *server;<br /> sockfd=socket(AF_INET,SOCK_STREAM,0);<br /> if(sockfd==-1)<br /> printf("Error in Creation.....\n");<br /> server1.sin_family=AF_INET;<br /> server1.sin_port=htons(SERV_TCP_PORT);<br /> server1.sin_addr.s_addr=inet_addr("127.0.0.1");<br /> connect(sockfd,(struct sockaddr*)&server1,sizeof(server1));<br /> while(1)<br /> {<br /> //bzero(tubelight,sizeof(tubelight));<br /> printf("TUBELIGHT:-");<br /> fgets(tubelight,100,stdin);<br /> write(sockfd,tubelight,100);<br /> bzero(tubelight,sizeof(tubelight));<br /> read(sockfd,tubelight,100);<br /> printf("server=%s",tubelight);<br /> }<br /> close(sockfd);<br />}</div>
Anonymoushttp://www.blogger.com/profile/17500490344132420321noreply@blogger.com0tag:blogger.com,1999:blog-6778612384748516815.post-43730453671929991432016-03-30T01:11:00.003-07:002016-03-30T01:11:41.617-07:00UDP ECHO PROGRAM<div dir="ltr" style="text-align: left;" trbidi="on">
<br />
*************************************SERVER*********************************<br />
<br />
#include <sys/types.h> <br />#include <sys/socket.h><br />#include<stdio.h><br />#include <unistd.h><br />#include<netinet/in.h><br />#include<string.h><br />#define SERV_TCP_PORT 5035<br /><br />int main(int argc,char**argv)<br />{<br /> int sockfd,clientfd,len;<br /> char tubelight[100];<br /> struct sockaddr_in server1,client1;<br /> sockfd=socket(AF_INET,SOCK_DGRAM,0);<br /> if(sockfd==-1)<br /> {<br /> printf("Socket Creation Fail\n");<br /> }<br /> else<br /> printf("Socet Created....\n");<br /> server1.sin_family=AF_INET;<br /> server1.sin_port=htons(SERV_TCP_PORT);<br /> server1.sin_addr.s_addr=INADDR_ANY;<br /> bind(sockfd,(struct sockaddr*)&server1,sizeof(server1));<br /> <br /> printf("Binding......\n");<br /> listen(sockfd,5);<br /> printf("Listening.........\n");<br /> len=sizeof(client1);<br /> printf("Accepted......\n\n\n");<br /> recvfrom(sockfd,tubelight,100,0,(struct sockaddr*)&client1,&len);<br /> printf("TUBELIGHT=%s",tubelight);<br /> sendto(sockfd,tubelight,100,0,(struct sockaddr*)&client1,len);<br /> close(sockfd);<br />}<br /> <br />
<br />
***************************************CLIENT*********************************<br />
<br />
<br />
#include<stdio.h><br />#include <sys/types.h> <br />#include <sys/socket.h><br />#include<netinet/in.h><br />#include<string.h><br />#define SERV_TCP_PORT 5035<br />int main(int argc,char **argv)<br />{<br /> int sockfd,len;<br /> char tubelight[100];<br /> struct sockaddr_in server1;<br /> struct hostent *server;<br /> sockfd=socket(AF_INET,SOCK_DGRAM,0);<br /> if(sockfd==-1)<br /> printf("Error in Creation.....\n");<br /> server1.sin_family=AF_INET;<br /> server1.sin_port=htons(SERV_TCP_PORT);<br /> server1.sin_addr.s_addr=inet_addr("127.0.0.1");<br /> connect(sockfd,(struct sockaddr*)&server1,sizeof(server1)) ;<br /> len=sizeof(server1);<br /> printf("TUBELIGHT:-");<br /> fgets(tubelight,100,stdin);<br /> sendto(sockfd,tubelight,100,0,(struct sockaddr*)&server1,len);<br /> bzero(tubelight,sizeof(tubelight));<br /> recvfrom(sockfd,tubelight,100,0,(struct sockaddr*)&server1,&len);<br /> printf("server=%s",tubelight);<br /> close(sockfd);<br />}</div>
Anonymoushttp://www.blogger.com/profile/17500490344132420321noreply@blogger.com0tag:blogger.com,1999:blog-6778612384748516815.post-1671196460234793062016-03-30T00:56:00.001-07:002016-04-01T11:26:04.446-07:00UDP CHAT PROGRAM<div dir="ltr" style="text-align: left;" trbidi="on">
*******************************************SERVER************************************<br />
<br />
<br />
#include <sys/types.h> <br />#include <sys/socket.h><br />#include<stdio.h><br />#include <unistd.h><br />#include<netinet/in.h><br />#include<string.h><br />#define SERV_TCP_PORT 5035<br /><br />int main(int argc,char**argv)<br />{<br /> int sockfd,len;<br /> char tubelight[100];<br /> struct sockaddr_in server1,client1;<br /> sockfd=socket(AF_INET,SOCK_DGRAM,0);<br /> if(sockfd==-1)<br /> {<br /> printf("Socket Creation Fail\n");<br /> }<br /> else<br /> printf("Socet Created....\n");<br /> server1.sin_family=AF_INET;<br /> server1.sin_port=htons(SERV_TCP_PORT);<br /> server1.sin_addr.s_addr=INADDR_ANY;<br /> bind(sockfd,(struct sockaddr*)&server1,sizeof(server1));<br /> <br /> printf("Binding......\n");<br /> len=sizeof(client1);<br /> recvfrom(sockfd,tubelight,100,0,(struct sockaddr*)&client1,&len);<br /> <br /> printf("TUBELIGHT=%s\n",tubelight);<br /> bzero(tubelight,sizeof(tubelight));<br /> printf("SUMIT:-");<br /> sendto(sockfd,tubelight,sizeof(tubelight),0,(struct sockaddr*)&client1,&len);<br /> close(sockfd);<br />}<br /> <br />
<br />
<br />
***************************************************CLIENT*********************************************<br />
<br />
<br />
#include<stdio.h><br />#include <sys/types.h> <br />#include <sys/socket.h><br />#include<netinet/in.h><br />#include<string.h><br />#define SERV_TCP_PORT 5035<br />int main(int argc,char **argv)<br />{<br /> int sockfd,x;<br /> char tubelight[100];<br /> struct sockaddr_in server1;<br /> struct hostent *server;<br /> sockfd=socket(AF_INET,SOCK_STREAM,0);<br /> if(sockfd==-1)<br /> printf("Error in Creation.....\n");<br /> server1.sin_family=AF_INET;<br /> server1.sin_port=htons(SERV_TCP_PORT);<br /> server1.sin_addr.s_addr=inet_addr("127.0.0.1");<br /> connect(sockfd,(struct sockaddr*)&server1,sizeof(server1));<br /> x=sizeof(server1);<br /> while(1)<br /> {<br /> printf("TUBELIGHT:-");<br /> fgets(tubelight,100,stdin);<br /> sendto(sockfd,tubelight,100,0,(struct sockaddr*)&server1,sizeof(server1));<br /> bzero(tubelight,sizeof(tubelight));<br /> recvfrom(sockfd,tubelight,100,0,(struct sockaddr *)&server1,&x);<br /> printf("server=%s",tubelight);<br /> }<br /> close(sockfd);<br />}<br />
<br /></div>
Anonymoushttp://www.blogger.com/profile/17500490344132420321noreply@blogger.com0tag:blogger.com,1999:blog-6778612384748516815.post-44844505094239264782016-03-30T00:50:00.004-07:002016-03-30T00:50:44.694-07:00TCP FILE TRANSFER<div dir="ltr" style="text-align: left;" trbidi="on">
*********************************SERVER************************************<br />
<br />
#include<stdio.h><br />#include<netinet/in.h><br />#include<netdb.h><br />#define SERV_TCP_PORT 5035<br />int main(int argc,char**argv)<br />{<br /> int sockfd,newsockfd,clength;<br /> FILE *ptr;<br /> struct sockaddr_in serv_addr,cli_addr;<br /> char buffer[4096];<br /> sockfd=socket(AF_INET,SOCK_STREAM,0);<br /> serv_addr.sin_family=AF_INET;<br /> serv_addr.sin_addr.s_addr=INADDR_ANY;<br /> serv_addr.sin_port=htons(SERV_TCP_PORT);<br /> printf("\nStart");<br /> bind(sockfd,(struct sockaddr*)&serv_addr,sizeof(serv_addr));<br /> printf("\nListening...");<br /> printf("\n");<br /> listen(sockfd,5);<br /> clength=sizeof(cli_addr);<br /> newsockfd=accept(sockfd,(struct sockaddr*)&cli_addr,&clength);<br /> printf("\nAccepted");<br /> printf("\n");<br /> ptr=fopen("sumit1.txt","w");<br /> <br /> read(newsockfd,buffer,4096);<br /> fprintf(ptr,"%s",buffer);<br /> printf("\nClient message:%s",buffer);<br /> write(newsockfd,buffer,4096);<br /> printf("\n");<br /> close(sockfd);<br /> return 0;<br />}<br />
<br />
<br />
<br />
<br />
*******************************CLIENT****************************************<br />
#include<stdio.h><br />#include<sys/types.h><br />#include<sys/socket.h><br />#include<netinet/in.h><br />#include<netdb.h><br />#define SERV_TCP_PORT 5035<br />int main(int argc,char*argv[])<br />{<br /> int sockfd;<br /> FILE *ptr;<br /> ptr=fopen("sumit.txt","r");<br /> struct sockaddr_in serv_addr;<br /> struct hostent *server;<br /> char buffer[4096];<br /> sockfd=socket(AF_INET,SOCK_STREAM,0);<br /> serv_addr.sin_family=AF_INET;<br /> serv_addr.sin_addr.s_addr=inet_addr("127.0.0.1");<br /> serv_addr.sin_port=htons(SERV_TCP_PORT);<br /> printf("\nReady for sending...");<br /> connect(sockfd,(struct sockaddr*)&serv_addr,sizeof(serv_addr));<br /> fscanf(ptr,"%s",buffer);<br /> // printf("\nEnter the message to send\n");<br /> // printf("\nClient: ");<br /> // fgets(buffer,4096,stdin);<br /> write(sockfd,buffer,4096);<br /> //printf("Serverecho:%s",buffer);<br /> printf("File Transfer SuccessFull....\n");<br /> printf("\n");<br /> close(sockfd);<br /> return 0;<br />}<br /></div>
Anonymoushttp://www.blogger.com/profile/17500490344132420321noreply@blogger.com0