• Skip to primary navigation
  • Skip to main content
  • Skip to primary sidebar
  • Skip to footer
projectsgeek

ProjectsGeek

Download Mini projects with Source Code, Java projects with Source Codes

  • Home
  • Java Projects
  • C++ Projects
  • VB Projects
  • PHP projects
  • .Net Projects
  • NodeJs Projects
  • Android Projects
    • Project Ideas
      • Final Year Project Ideas
      • JSP Projects
  • Assignment Codes
    • Fundamentals of Programming Language
    • Software Design Laboratory
    • Data Structure and Files Lab
    • Computer Graphics Lab
    • Object Oriented Programming Lab
    • Assembly Codes
  • School Projects
  • Forum

CLP-II

Implement using Socket Programming (TCP/UDP) in Java

April 29, 2012 by ProjectsGeek Leave a Comment

Implement using Socket Programming (TCP/UDP) in Java

 

Aim : Implement using Socket Programming (TCP/UDP) in C / C++ / JAVA.
a) Addition of digits of a given Number.
b) Perform String Operations. (Length, Compare, Concatenation, Palindrome,  Substring)
c) Find the Factorial of a Number.
Source Code for Socket Programming :
 
Client Source Code :
 
package com.prac.prac;  
 import java.io.BufferedReader;  
 import java.io.InputStreamReader;  
 import java.io.PrintStream;  
 import java.net.ServerSocket;  
 import java.net.Socket;  
 public class client {  
      public static void main(String[] args) {  
           int port=5001;  
           try {  
                Socket clientSocket=new Socket("localhost",port);  
                System.out.println("Client Started");  
                InputStreamReader isr = new InputStreamReader(System.in);  
                BufferedReader br = new BufferedReader(isr);  
                PrintStream toServer=new PrintStream(clientSocket.getOutputStream());  
                BufferedReader fromServer=new BufferedReader(new InputStreamReader(clientSocket.getInputStream()));  
                String menu="SOCKET PROGRAMMING MENU\n1.FACTORIAL\n2.SUM OF DIGITS OF A NO\n3.String Operation\n4.EXIT\nENTER UR CHOICE";  
                int choice=-1;  
                do  
                {  
                     toServer.flush();  
                     System.out.println(menu);  
                     choice=Integer.parseInt(br.readLine());  
                     toServer.println(choice);  
                     toServer.flush();  
                     switch(choice)  
                     {  
                     case 1:  
                          System.out.println("ENTER A NO:");  
                          int no=Integer.parseInt(br.readLine());  
                          toServer.println(no);  
                          int result=Integer.parseInt(fromServer.readLine());  
                          System.out.println("FACTORIAL IS:"+result);  
                          break;  
                     case 2:  
                          System.out.println("ENTER A NO:");  
                          no=Integer.parseInt(br.readLine());  
                          toServer.println(no);  
                          result=Integer.parseInt(fromServer.readLine());  
                          System.out.println("SUM OF EACH DIGITS IS:"+result);  
                          break;  
                     case 3:  
                          String stringmenu="STRING OPERATION MENU\n1.LENGTH\n2.COMPARE\n3.CONCATENATE\n4.IS STRING IS PALINDROME\n5.SUBSTRING\n6.EXIT\nENTER UR CHOICE";  
                          int stringChoice;  
                          do  
                          {  
                               System.out.println(stringmenu);  
                               stringChoice=Integer.parseInt(br.readLine());  
                               toServer.println(stringChoice);  
                               toServer.flush();  
                               switch(stringChoice)  
                               {  
                               case 1:  
                                    System.out.println("ENTER A String:");  
                                    String str=br.readLine();  
                                    toServer.println(str);  
                                    result=Integer.parseInt(fromServer.readLine());  
                                    System.out.println("LENGTH IS:"+result);  
                                    break;  
                               case 2:  
                                    System.out.println("ENTER First String:");  
                                    String first_str=br.readLine();  
                                    toServer.println(first_str);  
                                    System.out.println("ENTER Second String:");  
                                    String second_str=br.readLine();  
                                    toServer.println(second_str);  
                                    String str_result=fromServer.readLine();  
                                    System.out.println(str_result);  
                                    break;  
                               case 3:  
                                    System.out.println("ENTER First String:");  
                                    first_str=br.readLine();  
                                    toServer.println(first_str);  
                                    System.out.println("ENTER Second String:");  
                                    second_str=br.readLine();  
                                    toServer.println(second_str);  
                                    str_result=fromServer.readLine();  
                                    System.out.println("CONCANATED STRING IS"+str_result);  
                                    break;  
                               case 4:  
                                    System.out.println("ENTER A String:");  
                                    str=br.readLine();  
                                    toServer.println(str);  
                                    str_result=fromServer.readLine();  
                                    System.out.println("PALINDROME RESULT:"+str_result);  
                                    break;  
                               case 5:  
                                    System.out.println("ENTER First String:");  
                                    first_str=br.readLine();  
                                    toServer.println(first_str);  
                                    System.out.println("ENTER Second(it is checkd as substring) String:");  
                                    second_str=br.readLine();  
                                    toServer.println(second_str);  
                                    str_result=fromServer.readLine();  
                                    System.out.println("Substring Result:"+str_result);  
                                    break;  
                               case 6:  
                                    break;  
                               }  
                          }while(stringChoice!=6);  
                          break;  
                     case 4:  
                          break;  
                     default:  
                          System.out.println("INVALID CHOICE");  
                     }  
                }while(choice!=4);  
           } catch (Exception e) {  
                // TODO Auto-generated catch block  
           }  
      }  
 }

 

Server Source Code :

package com.prac.prac;  
 import java.io.*;  
 import java.net.*;  
 public class server {  
      /**  
       * @param args  
       */  
      public static void main(String[] args) {  
           int port=5001;  
           try {  
                ServerSocket serverSocket=new ServerSocket(port);  
                System.out.println("SERVER WAITING");  
                Socket clientSocket=serverSocket.accept();  
                BufferedReader fromClient=new BufferedReader(new InputStreamReader(clientSocket.getInputStream()));  
                PrintStream toClient=new PrintStream(clientSocket.getOutputStream());  
                while(true)  
                {  
                     int choice=Integer.parseInt(fromClient.readLine());  
                     System.out.print(choice);  
                     switch(choice)  
                     {  
                     case 1:  
                          int no=Integer.parseInt(fromClient.readLine());  
                          int result=1;  
                          if (no!=0 && no!=1){  
                               for(int i=2;i<=no;i++)  
                                    result*=i;  
                          }  
                          toClient.flush();  
                          toClient.println(result);  
                          break;  
                     case 2:  
                          no=Integer.parseInt(fromClient.readLine());  
                          result=0;  
                          while(no!=0){  
                               result+=no%10;  
                               no/=10;  
                          }  
                          toClient.flush();  
                          toClient.println(result);  
                          break;  
                     case 3:  
                          int stringChoice;  
                          do{  
                               stringChoice=Integer.parseInt(fromClient.readLine());;  
                               switch(stringChoice){  
                               case 1:  
                                    String first_str=fromClient.readLine();  
                                    result=first_str.length();  
                                    toClient.flush();  
                                    toClient.println(result);  
                                    break;  
                               case 2:  
                                    first_str=fromClient.readLine();  
                                    String second_str=fromClient.readLine();  
                                    result=first_str.compareTo(second_str);  
                                    String str_result="";  
                                    if (result ==0)  
                                         str_result="Both are equal";  
                                    else if (result<0)  
                                         str_result=second_str+" is greater";  
                                    else   
                                         str_result=first_str+" is greater";  
                                    toClient.flush();  
                                    toClient.println(str_result);  
                                    break;  
                               case 3:  
                                    first_str=fromClient.readLine();  
                                    second_str=fromClient.readLine();  
                                    result=first_str.compareTo(second_str);  
                                    str_result=first_str+second_str;  
                                    toClient.flush();  
                                    toClient.println(str_result);  
                                    break;  
                               case 4:  
                                    first_str=fromClient.readLine();  
                                    int i,j;  
                                    for(i=0,j=first_str.length()-1;i<=j;i++,j--){  
                                         if(first_str.charAt(i)!=first_str.charAt(j))  
                                              break;  
                                    }  
                                    if (i<j) <br="">                                         str_result="NO";  
                                    else  
                                         str_result="YES";  
                                    toClient.flush();  
                                    toClient.println(str_result);  
                                    break;  
                               case 5:  
                                    first_str=fromClient.readLine();  
                                    second_str=fromClient.readLine();  
                                    result=first_str.indexOf(second_str);  
                                    if(result==-1)  
                                         str_result="NO";  
                                    else  
                                         str_result="YES";  
                                    toClient.flush();  
                                    toClient.println(str_result);  
                                    break;  
                               case 6:  
                                    break;  
                               }  
                          }while(stringChoice!=6);  
                          break;  
                     case 4:  
                          break;  
                     }  
                }  
           } catch (Exception e) {  
                // TODO Auto-generated catch block  
           }  
      }  
 }

 

Output of the Program Socket :

SERVER WAITING…..

Client Started
SOCKET PROGRAMMING MENU
1.FACTORIAL
2.SUM OF DIGITS OF A NO
3.String Operation
4.EXIT
ENTER UR CHOICE
1
ENTER A NO:
3
FACTORIAL IS:6
SOCKET PROGRAMMING MENU
1.FACTORIAL
2.SUM OF DIGITS OF A NO
3.String Operation
4.EXIT
ENTER UR CHOICE

Other Projects to Try:

  1. To Perform various String Operation in Java
  2. File Handling and IO Handling in Java Programming
  3. Socket programming in Java
  4. Implement Conflation Algorithm using File Handling in Java
  5. To Implement Web Crawler in Java BE(IT) CLP-II Pratical

Filed Under: CLP-II

Implement a Program for Feature Extraction in 2D Colour Images (any features like Colour, Texture etc.)

April 29, 2012 by ProjectsGeek Leave a Comment

Implement a Program for Feature Extraction in 2D Colour Images (
 features like Colour, Texture etc.)
Aim  : To implement Program for Feature Extraction in 2D Colour Images .
Objective : To study Program for Feature Extraction in 2D Colour Images  for features like ..Colour and Textures .
Given Feature Extraction  source code is implemented using Java language . The input to the program is image file that is to be modified using program by changing colour .
 Feature Extraction  source code :
 
 package com.prac.prac;  
 import java.awt.*;  
 import java.awt.image.BufferedImage;  
 import java.io.*;  
 import java.util.*;  
 import javax.imageio.ImageIO;  
 public class Exatraction {  
      private static BufferedImage orignal,answer;   
      public static void main(String[] args) throws IOException{  
           File orignal_f=new File("a.jpg");  
           orignal = ImageIO.read(orignal_f);  
            answer=imageHistogram(orignal);  
           writeImage("featureExtraction");  
      }  
      private static void writeImage(String output) throws IOException {  
     File file = new File(output+".jpg");  
     ImageIO.write(answer, "jpg", file);  
   }  
       private static int colorToRGB(int alpha, int red, int green, int blue) {  
          int newPixel = 0;  
          newPixel += alpha; newPixel = newPixel << 8;  
          newPixel += red; newPixel = newPixel << 8;  
          newPixel += green; newPixel = newPixel << 8;  
          newPixel += blue;  
          return newPixel;  
        }  
       public static BufferedImage imageHistogram(BufferedImage input) {  
                 BufferedImage redGraph = new BufferedImage(input.getWidth(),input.getHeight(),input.getType());  
          for(int i=0; i<input.getWidth(); i++)   
          {  
            for(int j=0; j<input.getHeight(); j++)   
            {  
                 int alpha =new Color(input.getRGB (i, j)).getAlpha();  
              int red = new Color(input.getRGB (i, j)).getRed();  
              int green = new Color(input.getRGB (i, j)).getGreen();  
              int blue = new Color(input.getRGB (i, j)).getBlue();  
              redGraph.setRGB(i, j, colorToRGB(alpha, 0,0,blue));  
            }  
          }  
          return redGraph;  
        }  
 }  

Input to the Program :

Implement a Program for Feature Extraction in 2D Colour Images (any features like Colour, Texture etc.) 1

Output from the Program :

Implement a Program for Feature Extraction in 2D Colour Images (any features like Colour, Texture etc.) 2

 

Other Projects to Try:

  1. Implementation of Single Pass Algorithm for Clustering
  2. To Implement Web Crawler in Java BE(IT) CLP-II Pratical
  3. Multiple Inheritance in java program
  4. To Implement a Program Retrieval of Documents using Inverted Files
  5. Covert Communication , Diigtal Images

Filed Under: CLP-II

Implementation of Single Pass Algorithm for Clustering

April 29, 2012 by ProjectsGeek 2 Comments

Implementation of Single Pass Algorithm for Clustering – BE(IT) CLP-II Practical

Aim  : To implement Single Pass Algorithm for Clustering  in Documents and Files . 
Objective : To study Clustering in files or Documents using single pass algorithm  

Given below is the Single Pass Algorithm for Clustering  with source code in Java Language . For this code to work you should have three files for sample input (Text Files ) .

Source Code for Single Pass Algorithm

 package com.prac.prac;  
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
public class singlepass {
public static void main(String[] args) throws IOException{
BufferedReader stdInpt = new BufferedReader(new InputStreamReader(System.in));
System.out.println("Enter the no of Tokens");
int noOfDocuments=Integer.parseInt(stdInpt.readLine());
System.out.println("Enter the no of Documents");
int noOfTokens=Integer.parseInt(stdInpt.readLine());
System.out.println("Enter the threshhold");
float threshhold=Float.parseFloat(stdInpt.readLine());
System.out.println("Enter the Document Token Matrix");
int [][]input= new int [noOfDocuments][noOfTokens];
for(int i=0;i {
for(int j=0;j {
System.out.println("Enter("+i+","+j+")");
input[i][j]=Integer.parseInt(stdInpt.readLine());
}
}
SinglePassAlgorithm(noOfDocuments, noOfTokens, threshhold, input);
}
private static void SinglePassAlgorithm(int noOfDocuments,int noOfTokens,float threshhold,int [][]input)
{
int [][] cluster = new int [noOfDocuments][noOfDocuments+1];
ArrayList clusterRepresentative = new ArrayList();
cluster [0][0]=1;
cluster [0][1]=0;
int noOfClusters=1;
Float []temp= new Float[noOfTokens];
temp=convertintArrToFloatArr(input[0]);
clusterRepresentative.add(temp);
for(int i=1;i {
float max=-1;
int clusterId=-1;
for(int j=0;j {
float similarity=calculateSimilarity(convertintArrToFloatArr(input[i]),clusterRepresentative.get(j) );
if(similarity>threshhold)
{
if(similarity>max)
{
max=similarity;
clusterId=j;
}
}
}
if(max==-1)
{
cluster[noOfClusters][0]=1;
cluster[noOfClusters][1]=i;
noOfClusters++;
clusterRepresentative.add(convertintArrToFloatArr(input[i]));
}
else
{
cluster[clusterId][0]+=1;
int index=cluster[clusterId][0];
cluster[clusterId][index]=i;
clusterRepresentative.set(clusterId,calculateClusterRepresentative(cluster[clusterId],input, noOfTokens));
}
}
for(int i=0;i {
System.out.print("\n"+i+"\t");
for(int j=1;j<=cluster[i][0];++j)
{
System.out.print(" "+cluster[i][j]);
}
}
}
private static Float[] convertintArrToFloatArr(int[] input)
{
int size=input.length;
Float[] answer = new Float[size];
for(int i=0;i {
answer[i]=(float)input[i];
}
return answer;
}
private static float calculateSimilarity(Float[] a,Float[] b)
{
float answer=0;
for(int i=0;i {
answer+=a[i]*b[i];
}
return answer;
}
private static Float[] calculateClusterRepresentative(int[] cluster,int [][] input,int noOFTokens)
{
Float[] answer= new Float[noOFTokens];
for(int i=0;i {
answer[i]=Float.parseFloat("0");
}
for(int i=1;i<=cluster[0];++i)
{
for(int j=0;j {
answer[j]+=input[cluster[i]][j];
}
}
for(int i=0;i {
answer[i]/=cluster[0];
}
return answer;
}
}

Output of Single Pass Algorithm

Enter the no of Tokens

5
Enter the no of Documents
5
Enter the threshhold
10
Enter the Document Token Matrix
Enter(0,0)
1
Enter(0,1)
3
Enter(0,2)
3
Enter(0,3)
2
Enter(0,4)
2
Enter(1,0)
2
Enter(1,1)
1
Enter(1,2)
0
Enter(1,3)
1
Enter(1,4)
2
Enter(2,0)
0
Enter(2,1)
2
Enter(2,2)
0
Enter(2,3)
0
Enter(2,4)
1
Enter(3,0)
0
Enter(3,1)
3
Enter(3,2)
1
Enter(3,3)
0
Enter(3,4)
5
Enter(4,0)
1
Enter(4,1)
0
Enter(4,2)
1
Enter(4,3)
0
Enter(4,4)
1

0 0 1 3
1 2
2 4

Other Projects to Try:

  1. To Implement a Program Retrieval of Documents using Inverted Files
  2. Implement using Socket Programming (TCP/UDP) in Java
  3. To Perform various String Operation in Java
  4. Database connectivity in Java with MYSQL
  5. Kruskal’s Algorithm , Prims Algorithm

Filed Under: CLP-II

To Implement a Program Retrieval of Documents using Inverted Files

April 29, 2012 by ProjectsGeek Leave a Comment

Retrieval of Documents using Inverted Files -BE(IT) CLP-II Practical

Aim  : To implement a program Retrieval of documents using inverted files. 
Objective : To study Indexing , Inverted Files and searching with the help of inverted file  in Java Language . Code written in Java to implement of the same with appropriate output. 

Input to the Program of Inverted Files :

File 1 Contents :  are you anil kumar

File 2 Contents : hello where are you.

Source Code for Inverted Files in Java Language :

package com.prac.prac;  
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;
public class invertedfile
{
public static void displayIndex(ArrayList invertedData,int[][] docno){
int i,j;
for(i=0;i System.out.print(invertedData.get(i)+"\t");
for(j=1;j<=docno[i][0];j++)
System.out.print(docno[i][j]+"\t");
System.out.print("\n");
}
}
public static void indexing(String fname,ArrayList invertedData,int[][] docno,int fileno)
{
BufferedReader br;
try
{
br = new BufferedReader(new FileReader(fname));
String data = "", line = br.readLine();
while(line!=null)
{
data+=line+" ";
line=br.readLine();
}
String[] st=data.split("[ ,.]");
String currenttoken=null;
int i=0;
while(i {
currenttoken=st[i];
int indx=invertedData.indexOf(currenttoken);
if (indx==-1)
{
invertedData.add(currenttoken);
indx=invertedData.indexOf(currenttoken);
docno[indx][0]=1;
docno[indx][1]=fileno;
}
else
{
docno[indx][docno[indx][0]+1]=fileno;
docno[indx][0]+=1;
}
i+=1;
}
} catch (Exception e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
public static void main(String[] args) throws NumberFormatException, IOException {
String fname="";
ArrayList invertedData=new ArrayList();
int docno[][]=new int[100][10];
InputStreamReader ins=new InputStreamReader(System.in);
BufferedReader br=new BufferedReader(ins);
System.out.println("\nENTER TOTAL NO OF FILES:");
int no=Integer.parseInt(br.readLine());
int i=1;
while(i-1!=no)
{
System.out.println("\nENTER FILE "+i+" NAME:");
fname=br.readLine();
indexing(fname,invertedData,docno,i);
i+=1;
}
displayIndex(invertedData,docno);
}
}

Output for the Inverted Files Program:



ENTER TOTAL NO OF FILES:
2


ENTER FILE 1 NAME:
c:\anil1.txt


ENTER FILE 2 NAME:
c:\anil2.txt


hello 1
where 1
are 1 2
you 1 2
anil 2
kumar 2

Other Projects to Try:

  1. Multiple Inheritance in java program
  2. Implementation of Single Pass Algorithm for Clustering
  3. Data Structure and Files Program Codes
  4. Implement a Program for Feature Extraction in 2D Colour Images (any features like Colour, Texture etc.)
  5. Implement using Socket Programming (TCP/UDP) in Java

Filed Under: CLP-II

Implement Conflation Algorithm using File Handling in Java

April 27, 2012 by ProjectsGeek Leave a Comment

Aim : To implement Conflation Algorithm using File Handling. 


package com.prac.prac;  
import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.StringTokenizer;
import java.util.regex.Matcher;
import java.util.regex.Pattern;
public class conflation {
/**
* @param args
*/
public static void main(String[] args) {
InputStreamReader st = new InputStreamReader(System.in);
BufferedReader buff = new BufferedReader(st);
String fname="";
System.out.println("Enter File Name :");
try {
fname = buff.readLine();
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
conflation(fname);
}
private static void conflation(String fname)
{
BufferedReader buff;
try {
buff = new BufferedReader(new FileReader(fname));
String line="", data="" ;
line = buff.readLine();
while(line!=null)
{
data+=line ;
System.out.println(line);
line=buff.readLine();
}
Pattern pattern= Pattern.compile("(ed,ing)|\\b(this |is |a |and |are |an |the)",Pattern.CASE_INSENSITIVE);
Matcher matcher = pattern.matcher(data);
String clean = matcher.replaceAll("");
StringTokenizer st = new StringTokenizer(clean);
String currenttoken = "" ;
ArrayList token = new ArrayList() ;
ArrayList count = new ArrayList() ;
while(st.hasMoreTokens())
{
currenttoken = st.nextToken() ;
int index = token.indexOf(currenttoken);
if(index!=-1)
{
count.set(index,count.get(index+1 )); }
else
{
token.add(currenttoken);
count.add(1);
}
}
System.out.println("OUTPUT IS:\nTOKENS\tNO OF OCCURENCES");
for(int i=0;i System.out.println(token.get(i)+"\t"+count.get(i));
}
} catch (IOException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
}

Other Projects to Try:

  1. To Implement a Program Retrieval of Documents using Inverted Files
  2. File Handling and IO Handling in Java Programming
  3. To Perform File Handling in Java
  4. File Handling program using Java
  5. Implement using Socket Programming (TCP/UDP) in Java

Filed Under: CLP-II

To Implement Web Crawler in Java BE(IT) CLP-II Pratical

April 27, 2012 by ProjectsGeek Leave a Comment

To Implement Web Crawler in Java BE(IT) CLP-II Pratical

Aim  : To implement Web Crawler in Java Language .


Web crawler is the program of piece of code that search engine uses to index Web pages across the web. It crawls the HTML Page to find the keywords on that page for search engine indexing of the pages .


Below code Web crawler in Java crawls the “google.com” and finds out the total links to other pages . 

 import java.net.*;  
import java.io.*;
import java.util.regex.*;
public class crawler {
public static void main(String[] args) {
String source_url="https://google.com";
try
{
URL url = new URL(source_url);
URLConnection yc = url.openConnection();
String data=null;
BufferedReader in = new BufferedReader(new InputStreamReader(yc.getInputStream()));
String inputLine;
while ((inputLine = in.readLine()) != null)
data=data+inputLine ;
in.close();
Integer i=0;
Pattern pattern = Pattern.compile("]*href=\"[^>]*>(.*?)");
Matcher matcher = pattern.matcher(data);
while (matcher.find())
{
System.out.println((i+1)+ matcher.group());
i=i+1;
}
System.out.println("TOTAL LINKS:"+i);
}
catch(Exception e)
{
System.out.println(e);
}
}
}

Other Projects to Try:

  1. Implement Conflation Algorithm using File Handling in Java
  2. Implement using Socket Programming (TCP/UDP) in Java
  3. To Implement a Program Retrieval of Documents using Inverted Files
  4. Wiki Page Ranking With Hadoop Project
  5. Search Engine project in Java

Filed Under: CLP-II

Primary Sidebar

Tags

.Net Projects Download Android Project Ideas Android Projects Angular 2 Assembly Codes C # Projects C & C++ Projects C++ Projects Class Diagrams Computer Graphics Database Project Data Mining Projects DataScience Projects Datastructure Assignments Download Visual Basic Projects Electronics project Hadoop Projects Installation Guides Internet of Things Project IOS Projects Java Java Interview Questions Java Projects JavaScript JavaScript Projects java tutorial JSON JSP Projects Mechanical Projects Mongodb Networking Projects Node JS Projects OS Problems php Projects Placement Papers Project Ideas Python Projects seminar and presentation Struts

Search this Website


Footer

Download Java Project
Download Visual Basic Projects
Download .Net Projects
Download VB Projects
Download C++ Projects
Download NodeJs Projects
Download School Projects
Download School Projects
Ask Questions - Forum
Latest Projects Ideas
Assembly Codes
Datastructure Assignments
Computer Graphics Lab
Operating system Lab
australia-and-India-flag
  • Home
  • About me
  • Contact Form
  • Submit Your Work
  • Site Map
  • Privacy Policy