Student databse system (PHP project) free download

This is a simple php project (student database system) in php. The code is easy to understand and implement.
Please read the 'readme.txt' file in the folder. Download the file " student.zip " from the download box. 

PHP project free download

This is a simple php project (airline database system) project in php. The code is easy to understand and implement.
Actually this is a small tutorial which will help you understand how to create a simple front-end and its back-end in php-mysql.
Please read the 'readme.txt' file in the folder.
The folder for this project 'student.zip' and 'Airline.zip'  files can be downloaded from the Download Box in the blog.

Airline Database System (php project) free download

This is a simple airline database system project in php. The code is easy to understand and implement.
Actually this is a small tutorial which will help you understand how to create a simple front-end and its back-end in php-mysql.
Please read the 'readme.txt' file in the folder.
The folder for this project 'Airline.zip' file can be downloaded from the Download Box in the blog.

UDP protocol:Socket programming(Java Code)

Use Download Box to download file "UDP protocol.zip"

Sliding Window Protocol:Go Back N (Java code)

Use Download Box to download the program.

Sliding Window Protocol:Stop & Wait(Java Code)

Use Download Box to download the program.

Assembly level programming

Use Download Box to download the program.

Socket programming for CN

Use Download Box to download the program.

Sem 4 & Sem 7 (AOAD & RAI) subjects : Java Code / Program for Prim's algorithm for Minimum spanning tree

Given Below is the Java Code for Prim's algorithm for minimum spanning tree.

//Aim:To implement Prim's algorithm. //Program: import java.util.*; class Prim { static int v,e,cost; static int G[][]; static int T[][]; static int visited[]; static void cal_tree() { int temp1; int temp2=0,temp3=0; int flag=1; visited[1]=1; temp1=9999; //do for(int k=1;k<v;++k) { temp1=9999; for(int i=1;i<=v;++i) { for(int j=1;j<=v;++j) { if(G[i][j]<temp1 && ((visited[i]==1 && visited[j]!=1) ||(visited[i]!=1 && visited[j]==1)) ) { temp1=G[i][j]; temp2=i; temp3=j; } }// end of inner loop } System.out.println(temp2+"----"+temp3+" = "+G[temp2][temp3]); cost+=G[temp2][temp3]; visited[temp2]=1; visited[temp3]=1; T[temp2][temp3]=T[temp3][temp2]=1; flag=check(); } } static int check() { for(int i=1;i<=v;++i) if(visited[i]==-1) return 1; return 0; } public static void main(String args[]) { Scanner scr=new Scanner(System.in); System.out.println("Enter the number of vertices. "); v=scr.nextInt(); G=new int[v+1][v+1]; T=new int[v+1][v+1]; visited=new int[v+1]; /****Initialize to large value*****/ for(int i=1;i<=v;++i) { visited[i]=-1; for(int j=1;j<=v;++j) { G[i][j]=9999; T[i][j]=-1; } } System.out.println("Enter the number of edges. "); e=scr.nextInt(); System.out.println("\nPlease enter your graph as follows(v1 v2 e)where e is cost of edge between v1 & v2.\n"); int temp1,temp2; for(int i=0;i<e;++i) { System.out.print("\nEnter (v1 v2 e) "); temp1=scr.nextInt(); temp2=scr.nextInt(); G[temp1][temp2]=G[temp2][temp1]=scr.nextInt(); } System.out.println("\nThe minimum spanning tree is as follows.\n"); cal_tree(); System.out.println("\nThe cost of minimum spanning tree is "+cost+"."); } } /*OUTPUT Enter the number of vertices. 7 Enter the number of edges. 9 Please enter your graph as follows(v1 v2 e)where e is cost of edge between v1 & v2. Enter (v1 v2 e) 1 2 25 Enter (v1 v2 e) 2 3 14 Enter (v1 v2 e) 3 4 11 Enter (v1 v2 e) 4 5 20 Enter (v1 v2 e) 5 6 23 Enter (v1 v2 e) 6 1 10 Enter (v1 v2 e) 7 2 12 Enter (v1 v2 e) 7 5 22 Enter (v1 v2 e) 7 4 17 The minimum spanning tree is as follows. 1----6 = 10 5----6 = 23 4----5 = 20 3----4 = 11 2----3 = 14 2----7 = 12 The cost of minimum spanning tree is 90. */

Checksum Error detection (java program)

Use Download Box in the blog to download this program.

CRC: Cyclic Redundancy Code (java code)

Use Download Box in the blog to download this program.

Easy solution for SEM 5 pracs

Use the DOWNLOAD BOX in the blog to download.