Addition of two numbers on Server sent from Client [TCP] using C
/* tcpClient.c */ #include <sys/types.h> #include <sys/socket.h> #include <netinet/in.h> #include <arpa/inet.h> #include <…
Showing posts with the label C - ProgrammingShow all
![Addition of two numbers on Server sent from Client [TCP] using C](http://1.bp.blogspot.com/-NOweUxjJDdk/VUW5sETg8OI/AAAAAAAAB7E/87jdBGjTkQo/w320-h320-p-k-no-nu/c-programming-tutorial.jpg)
![Concatenation of two strings sent from Client on the Server - [ TCP ] using C](http://2.bp.blogspot.com/-NOweUxjJDdk/VUW5sETg8OI/AAAAAAAAB7I/ocjLNeNB95Y/w320-h320-p-k-no-nu/c-programming-tutorial.jpg)
Concatenation of two strings sent from Client on the Server - [ TCP ] using C
/* tcpClient.c */ #include <sys/types.h> #include <sys/socket.h> #include <netinet/in.h> #include <arpa/inet.h> #include <…
UDP Client-Server Program (Command Line) using C
/* udpClient.c */ #include <sys/types.h> #include <sys/socket.h> #include <netinet/in.h> #include <arpa/inet.h> #include <…
UDP Client-Server Program using C
/* udpClient.c */ #include <sys/types.h> #include <sys/socket.h> #include <netinet/in.h> #include <arpa/inet.h> #include <…
TCP Echo Server - Echo Client Program using C
/* tcpechoServer.c */ #include <sys/types.h> #include <sys/socket.h> #include <netinet/in.h> #include <arpa/inet.h> #include …
Binary Search in C using Recursion
#include<stdio.h> void bins ( int lb , int ub , int item , int a []); void main () { int i , n , item , a [ 20 ]; printf ( &quo…
Solve All-Pairs Shortest Path Problem using Floyd–Warshall Algorithm
Program: #include<stdio.h> #include<conio.h> #define inf 999 void main () { int i , j , k , n , w [ 20 ][ 20 ]; clrscr (); printf ( …
Insertion Sort
Write a C program to implement Insertion Sort Algorithm Algorithm: for (c = 1 to n - 1) { d <= c; while ( d > 0 AND array[d] < a…
Prim's Algorithm
Write a C Program to Implement Prim’s Algorithm and find the Minimum Spanning Tree (MST) for the following Graph. Algorithm: visit[1] <- 1; while(…
C Program to Implement Heap Sort
Algorithm: hs( a[], n) { heap(a,n); for (i = n to 1) { temp<-a[1]; a[1]<-a[i]; a[i]<-temp; downheap(a,1,i-1); } …
