வானம்-எக்ஸ்க்ளூசிவ் படங்கள்!

தெலுங்கில் ஹிட்டடித்த வேதம் படத்தை தமிழில் ரீமேக் செய்கிறார்கள். இந்த படத்திற்கு வானம் என்று பெயரிட்டுள்ளனர். இந்த படத்தில் சிம்பு, பரத், பிரகாஷ்ராஜ், அனுஷ்கா, வேகா, சினேகா உல்லால் அகியோர் நடிக்கின்றனர். க்ரிஷ் இந்த படத்தை இயக்குகிறார். வானம் படத்தின் படப்பிடிப்பு தற்போது இறுதிக்கட்டத்திலுள்ளது. வானம் படத்திலிருந்து : Vaanam Movie GalleryCast: Silambarasan, Bharath, Anushka, Sneha Ullal, Vega, Prakash Raj, Sonia Agarwal, SaranyaDirection: KrishProduction: VTV GaneshMusic: Yuvan Shankar RajaRelated Keywords :Anushka, Barath, Prakash Raj, Simbu, Sneha Ullal, Vaanam Movie Stills, Vega, அனுஷ்கா, சினேகா உல்லால், சிம்பு, பரத், பிரகாஷ்ராஜ், வானம்,...

Read more »

அட... திருந்துங்கப்பா...!!!

இன்னும் எத்தனை காலத்திற்குத்தான் கிழவியை கட்டிபிடித்து ஊரை ஏமாற்றுவார்களோ தெரியவில்லை...???உங்களோட கமென்ட் என்னவாக இருந்தாலும் அத மறக்காம சொல்லிட்டு போங்க...{ கெட்டவார்த்தை வேண்டாம் பாஸ் .....}...

Read more »

CIET(Coimbatore Institute of Engineering and Information Technology) Name Now Changed as CIET (Coimbatore Insititute of Engineering and Technology )

Hello Friends,Our College CIET(Coimbatore Institute of Engineering and Information Technology) Name, Now Changed as CIET (Coimbatore Insititute of Engineering and Technology ).And Our College websites are moved to the New Server Platforms,Latest CIET , CIMAT , KKCAS website links are given below,(Coimbatore Institute of Engineering and Technology ) CIET New Website(Coimbatore Institute of Management and Technology) CIMAT New website(Kovai Kalaimagal college of Arts Science) KKCAS New websiteRelated Keywords :CIET college name changed,Kovai Kalaimagal college of Arts Science,KKCAS new website,CIET new website name changed,Coimbatore Institute...

Read more »

KNAPSACK Algorithm Implementation Program in C

IMPLEMENTATION OF KNAPSACK ALGORITHM PROGRAM: #include #include #include int w[]={18,15,10}; int p[]={25,24,15}; int m=20; int n=3; int weight[10]; void main() { int i,u,a[10]; float t1,t2,t,wp[10],max; float profit[]={0.0,0.0,0.0},tp=0.0,tpl=0.0,x[4]; clrscr(); cout<<"\n\t\t knapsack problem using greedy method"; cout<<"\n\t\t..........."; for(i=0;in;i++) wp[i]=(float)p[i]/w[i]; for(i=0;in;i++) { for(int j=i+1;jn;j++) { if(wp[i]wp[j]) { t1=p[i]; p[i]=p[j]; p[j]=t1; t2=w[i]; w[i]=w[j]; w[j]=t2; t=wp[i]; wp[i]=wp[j]; wp[j]=t; } } } u=m; for(i=0;in;i++) { profit[i]=0.0; x[i]=0.0; } for(i=0;in;i++) { if(w[i]>u) break; x[i]=1.0; u=u-w[i]; profit[i]=p[i]; tp=tp+profit[i]; } if(in) { x[i]=(float)u/w[i]; profit[i]=x[i]*p[i]; tp=tp+profit[i]; } cout<<"\n object \t domain...

Read more »

PRIM'S Algorithm Implementation Program

IMPLEMENTATION OF PRIMS ALGORITHM PROGRAM: #include #include #define size 20 #define INFINITY 32767 void prim(int g[][10],int nodes) { int tree[size],i,j,k; int min_dist,v1,v2,total=0; for(i=0;inodes;i++) tree[i]=0; printf("\nthe minimum spanning tree is"); tree[0]=1; for(k=1;k<=nodes-1;k++) { min_dist=INFINITY; for(i=0;inodes;i++) { for(j=0;jnodes;j++) { if(g[i][j]&&((tree[i]&&!tree[j])||(!tree[i]&&tree[j]))) { if(g[i][j]min_dist) { min_dist=g[i][j]; v1=i; v2=j; } } } } printf("\n edge(%d%d)and weight=%d",v1,v2,min_dist); tree[v1]=tree[v2]=1; total=total+min_dist; } printf("\ntotal path length is =%d",total); } void main() { int g[size][size],nodes; int v1,v2,length,i,j,n; clrscr(); printf("\nprims algorithm"); printf("\nenter the no of nodes"); scanf("%d",&nodes); printf("\nenter...

Read more »

KRUSKAL's Algorithm Implementation Program

IMPLEMENTATION OF KRUSKALS ALGORITHM PROGRAM: #include #include #define INFINITY 999 typedef struct graph { int v1; int v2,cost; }GR; GR g[20]; int tot_edges,tot_nodes; void create(); void spanning_tree(); int minimum(int); void main() { clrscr(); printf("\n Graph creation by adjacency matrix"); create(); spanning_tree(); getch(); } void create() { int k; printf("\n Enter the total no., of nodes"); scanf("%d",&tot_nodes); printf("\n Enter the total no0., of edges"); scanf("%d",&tot_edges); for(k=0;ktot_edges;k++) { printf("\n Enter the edges in(v1,v2) from"); scanf("%d%d",&g[k].v1,&g[k].v2); printf("\n Enter the corresponding cost"); scanf("%d",&g[k].cost); } } void spanning_tree() { int count,k,v1,v2,i,j,tree[10][10],pos,parent[10]; int sum; int find(int...

Read more »

IMPLEMENTATION OF NON RECURSIVE BINARY SEARCH TREE PROGRAM

IMPLEMENTATION OF NON RECURSIVE BINARY SEARCH TREE PROGRAM: #include #include #define size 10 int n; void main() { int a[size],key,i,flag; int binsearch(int a[size],int key); clrscr(); printf("\n How many elements for an array"); scanf("%d",&n); printf("Enter the Elements"); for(i=0;in;i++) scanf("%d",&a[i]); printf("\n Enter the no which is to be searched"); scanf("%d",&key); flag=binsearch(a,key); if(flag==-1) printf("\nThe element is not Present"); else printf("\n The element is a[%d] localtion",flag); getch(); } int binsearch(int a[size],int key) { int low,high,m ; low=0; high=n-1; while(low<=high) { m=(low+high)/2; if(key==a[m]) return m; else if(keya[m]) high=m-1; else low=m+1; } return -1; } OUTPUT: How many elements for an array 5 Enter the Elements 1 2 3 4 5 ...

Read more »

IMPLEMENTATION OF RECURSIVE BINARY SEARCH TREE PROGRAM

IMPLEMENTATION OF RECURSIVE BINARY SEARCH TREE PROGRAM: #include #include #define size 10 int n; void main() { int a[size],flag,i,key,low,high; int binsearch(int a[size],int key,int low,int high); clrscr(); printf("\n How many are there in array"); scanf("%d",&n); printf("\n Enter the Element"); for(i=0;in;i++) scanf("%d",&a[i]); printf("\n Enter the Element which is to be searched"); scanf("%d",&key); low=0; high=n-1; flag=binsearch(a,key,low,high); printf("\n Element a[%d] location",flag); getch(); } int binsearch(int a[size],int key,int low,int high) { int m; m=(low+high)/2; if(key==a[m]) return m; else if(keya[m]) binsearch(a,key,low,m-1); else binsearch(a,key,m+1,high); } OUTPUT: How many are there in array 5 Enter the Element 1 2 3 4 5 Enter the Element...

Read more »

IMPLEMENTATION OF HEAP SORT Programs

IMPLEMENTATION OF HEAP SORT PROGRAM: #include #include #include #define MAX 10 void main() { int i,n; int arr[MAX]; void makeheap(int arr[MAX],int n); void heapsort(int arr[MAX],int n); void display(int arr[MAX],int n); clrscr(); for(i=0;imax;i++) arr[i]=0; printf("\n How many elements you want to sort"); scanf("%d",&n); printf("Enter the elements"); for(i=0;in;i++) scanf("%d",&arr[i]); printf("\n The elements are...."); display(arr,n); makeheap(arr,n); printf("\n Heapified"); display(arr,n); heapsort(arr,n); printf("\n Elements sorted by heapsort"); display(arr,n); getch(); } void makeheap(int arr[MAX],int n) { int i,val,j,father; for(i=1;in;i++) { val=arr[i]; j=i; father=(j-1)/2; while(j>0&&arr[father]val) { arr[j]=arr[father]; j=father; father=(j-1)/2; } arr[j]=val; } } void...

Read more »

IMPLEMENTATION OF SELECTION SORT PROGRAMs

IMPLEMENTATION OF SELECTION SORT PROGRAM: #include #include int n; void main() { int a[10],i,j; void selection(int a[10]); clrscr(); printf("\n\t\tSelection Sort"); printf("\nHow many Elements are there"); scanf("%d",&n); printf("\nEnter the element"); for(i=0;in;i++) scanf("%d",&a[i]); selection(a); getch(); } void selection(int a[10]) { int i,j,min,temp; for(i=0;i<=n-2;i++) { min=i; for(j=i+1;j<=n-1;j++) { if(a[j]a[min]) min=j; } temp=a[i]; a[i]=a[min]; a[min]=temp; } printf("\n Sorted List is\n"); for(i=0;in;i++) printf("\n%d",a[i]); } OUTPUT: Selection Sort How many Elements are there 5 Enter the element 5 4 3 2 1 Sorted List is 1 2 3 4 5 CIET college Programs,LAB Programs for Engineering Students,DAA LAB Programs,DSA LAB Programs,Remoboys,karthik,Remokn,Student3k,programs...

Read more »

IMPLEMENTATION OF QUICK SORT PROGRAM

IMPLEMENTATION OF QUICK SORT PROGRAM: #include #include #define size 10 void quick(int a[size],int,int); int partition(int a[size],int,int); void swap(int a[size],int *,int*); int n; void main() { int i; int a[size]; clrscr(); printf("\n Quick Sort"); printf("\n Enter the no of sort"); scanf("%d",&n); for(i=0;in;i++) { printf("\nEnter the %d st number",i+1); scanf("\n%d",&a[i]); } quick(a,0,n-1); printf("\nSorted Array"); for(i=0;in;i++) printf("%d",a[i]); getch(); } void quick(int a[size],int low,int high) { int m,i; if(lowhigh) { m=partition(a,low,high); quick(a,low,m-1); quick(a,m+1,high); } } int partition(int a[size],int low,int high) { int pivot=a[low],i=low,j=high; while(i<=j) { while(a[i]<=pivot) i++; while(a[j]>pivot) j--; if(ij) swap(a,&i,&j); } swap(a,&low,&j); return...

Read more »

IMPLEMENTATION OF MERGE SORT

IMPLEMENTATION OF MERGE SORT PROGRAM: #include #include #include int n; void main() { int i,low,high; int a[20]; void mergesort(int a[10],int low,int high); void display(int a[10]); clrscr(); printf("\n\tMerge Sort"); printf("\n Enter the size of elements"); scanf("%d",&n); printf("\n Enter the list element"); for(i=0;in;i++) scanf("%d",&a[i]); low=0; high=n-1; mergesort(a,low,high); display(a); getch(); } void mergesort(int a[10],int low,int high) { int mid; void combine(int a[10],int low,int mid,int high); if(lowhigh) { mid=(low+high)/2; mergesort(a,low,mid); mergesort(a,mid+1,high); combine(a,low,mid,high); } } void combine(int a[10],int low,int mid,int high) { int i,j,k; int temp[10]; k=low; i=low; j=mid+1; while(i<=mid&&j<=high) { if(a[i]<=a[j]) { temp[k]=a[i]; i++; k++; } else { temp[k]=a[j]; j++; k++; } } while(i<=mid) { temp[k]=a[i]; i++; k++; } while(j<=high) { temp[k]=a[j]; j++; k++; } for(k=low;k<=high;k++) a[k]=temp[k]; } void...

Read more »

SHORTEST Path Finding Algorithm Implementation Program

IMPLEMENTATION OF SHORTEST PATH ALGORITHM PROGRAM: #include #include #include class path { int a[10][10],c[10][10],key[10][10],num,min,i,j,k; public: void findpath(); void read(); void output(int,int); void out(int i,int j); }; void path::read() { cout<<"Number of rows:"; cin>>num; for(i=1;i<=num;i++) for(j=1;j<=num;j++) { if(i==j) a[i][j]=0; else { cout<<"The cost for["<i","j"]"; cin>>a[i][j]; } c[i][j]=a[i][j]; key[i][j]=0; } } void path::findpath() { int t1,t2,t3; for(k=1;k<=num;k++) for(i=1;i<=num;i++) for(j=1;j<=num;j++) { t1=c[i][k]; t2=c[k][j]; t3=c[i][j]; if(t1!=0&&t2!=0&&(t3==0||t1+t2t3)) { c[i][j]=t1+t2; key[i][j]=k; } } } void path::output(int i,int j) { min=0; if(c[i][j]==0) { cout<<"No path exist"; return; } else { cout<<"The...

Read more »

IMPLEMENTATION OF SLIDING WINDOW PROTOCOL

IMPLEMENTATION OF SLIDING WINDOW PROTOCOL PROGRAM: #include #include void main() { int a[20],b[20],i=0,j=0,k=0,l=0,n; clrscr(); printf("\nEnter the size of window:"); scanf("%d",&n); printf("\nenter the values:\n"); for(i=n-1;i>=0;i--) scanf("%d",&a[i]); printf("\nValues of sender and receiver:\n"); for(i=0;in;i++) printf("%d\t",a[i]); for(j=0;jn;j++) printf("%d\t",b[i]); for(i=n-1,j=0;i>=0;i--,j++) { b[j]=a[i]; a[i]=0; printf("\nSENDER\n"); for(k=0;kn;k++) printf("%d\t",a[k]); printf("\nRECEIVER\n"); for(l=0;ln;l++) printf("%d\t",b[l]); printf("\nDATA RECEIVED\n"); } for(k=0;kn;k++) { b[k]=0; } printf("\nDATA RECEIVED SUCCESSFULLY\n"); getch(); } OUTPUT: Enter the size of window:4 enter the values: 1 5 7 4 Values of sender and receiver: 4 7 5 1...

Read more »

IMPLEMENTATION OF UDP ( Universal Datagram Protocol ) Programs

IMPLEMENTATION OF UDP PROGRAM: CLIENT: #include #include #include #include #include #include #include #include #include #define REMOTE_SERVER_PORT 1896s #define MAX_MSG 100 int main(int argc,char*argv[]) { int sd,rc,i; struct sockaddr_in cliaddr,remoteservaddr; struct hostent *h; if(argc<3) { printf("Usage:%s..\n",argv[0]); exit(1); } h=gethostbyname(argv[1]); if(h==NULL) { printf("%s:unknown host%s\n",argv[0],argv[1]); exit(1); } printf("%s:sending data to '%s'(IP:%s)\n",argv[0],h->h_name,inet_ntoa(*(struct i n_addr*)h->h_addr_list[0])); remoteservaddr.sin_family=h->h_addrtype; memcpy((char*)&remoteservaddr.sin_addr.s_addr,h->h_addr_list[0],h->h_length); remoteservaddr.sin_port=htons(REMOTE_SERVER_PORT); sd=socket(AF_INET,SOCK_DGRAM,0); if(sd<0) { printf("%s:cannot...

Read more »

IMPLEMENTATION OF TCP (Transmission Control Protocol) Source Code in C Language

PROGRAM: CLIENT ( Type This cilent Program in The Editor ): #include #include #include #include #include #include #include int main(int argc,char **argv) { struct sockaddr_in saddr; struct hostent *server; int n,i,ssid,csid,pid; char buffer[1024]; if(argc<2) fprintf(stderr,"port # not specified\n"); csid=socket(AF_INET,SOCK_STREAM,0); if(csid<0) perror("socket failed error"); bzero((char*)&saddr,sizeof(saddr)); server=gethostbyname(argv[1]); saddr.sin_family=AF_INET; saddr.sin_port=htons(atoi(argv[2])); bcopy((char*)server->h_addr,(char*)&saddr.sin_addr.s_addr,server->h_length); ssid=connect(csid,(struct sockaddr*)&saddr,sizeof(saddr)); if(ssid<0) perror("socket connect error"); bzero(buffer,1024); printf("Type msg to server"); fgets(buffer,1024,stdin); n=write(csid,buffer,sizeof(buffer)); if(n==0) perror("Socket...

Read more »

Aamir khan wallpapers free

Aamir khan wallpapers free Aamir khan wallpapers freeBollywood actor Aamir khan in Mangal PandeyAamir khan wallpapers freeBollywood Actor Aamir khan in Movie MannAamir khan wallpapers freeBollywood Actor Aamir khan in Movie Rang De BasantiAamir khan wallpapers freeBollywood Actor Aamir khan in Movie GulamAamir khan wallpapers freeBollywood Actor Aamir khan in Movie GajiniHigh quality wallpapers of High resolution of sizes 1600 x 1200 , 1024 x 768 and 800 x 600 . New Wallpapers of Latest Movies , Actors , Actress , festivals are uploaded regularly. We will try our best to Provide you best wallpapers...

Read more »

Ajay devgan wallpaper photo image pictures Stills

ajay devgan wallpaper photo image pics Download Free Ajay devgan wallpaper photo image picImage : Dark Background , Actor Ajaydevgan from the Movie QayamatDownload Free Ajay devgan wallpaper photo image picImage : Colourful background , Bollywood Actor Ajay DevganDownload Free Ajay devgan wallpaper photo image picImage : Actor Ajay Devgan in White Clothes , Red Carpet , HomeDownload Free Ajay devgan wallpaper photo image picImage : Actor Ajay Devgan in Black Clothes , GUN in Hand , CAR BackgroundHigh quality wallpapers of High resolution of sizes 1600 x 1200 , 1024 x 768 and 800 x 600 . New Wallpapers...

Read more »

Tamil actress asin wallpapers download

tamil actress asin wallpapers download Download Free wallpapers of Tamil Actress Asinimage : Bollywood / Tamil actress Asin in center , blue backgroundText : AsinDownload Free wallpapers of Tamil Actress Asinimage : Bollywood / Tamil actress Asin in black teeDownload Free wallpapers of Tamil Actress Asinimage : Bollywood / Tamil actress Asin in black tshirt , white backgroundDownload Free wallpapers of Tamil Actress AsinImage : Bollywood / Tamil actress Asin giving nice pose , brown backgroundDownload Free wallpapers of Tamil Actress AsinImage : Bollywood / Tamil actress Asin in saree looking typical Indian...

Read more »

Wwe John Cena Wallpapers free image photo pictures stills Posters

Wwe John Cena Wallpapers free image photo pic Download john cena wallpapers FreeImage / Photo / pic : Wwe champ John Cena , digital backgroundDownload wwe john cena wallpapers FreeImage / Photo / pic : wwe wrestler John cena double images , red backgroundDownload wwe john cena wallpapers FreeImage / Photo / pic : wwe wrestler John cena , black backgroundDownload wwe john cena wallpapers FreeImage / Photo / pic : wwe wrestler John cena in action , dark backgroundDownload wwe john cena wallpapers FreeImage / Photo / pic : wwe wrestler John cena pose...

Read more »

Free download John Cena wallpapers

...

Read more »