Hardik is computer engineer in rajkot,india.

PHP developer.

R.K.University

contact me:8000 49953

1. fiexd charge per month.
3. send your Ads. to above e-mail or contact to my no.

How To Write Source Code For Polygon Clipping

#include<stdio.h>
#include<conio.h>
#include<graphics.h>

#define OUT2IN  1
#define IN      2
#define IN2OUT  3
#define OUT     4
#define INVALID 5

int poly[100];
int tempPoly[100];
int sides;

int xmin,ymin,xmax,ymax;

int clipLeft(int x,int x1,int x2)
{
if(x1<x && x2>=x)
return OUT2IN;
else if(x1>=x && x2>=x)
return IN;
else if(x1>=x && x2<x)
return IN2OUT;
else if(x1<x && x2<x)
return OUT;
else
return INVALID;
}

int clipBottom(int y,int y1,int y2)
{
if(y1<y && y2>=y)
return OUT2IN;
else if(y1>=y && y2>=y)
return IN;
else if(y1>=y && y2<y)
return IN2OUT;
else if(y1<y && y2<y)
return OUT;
else
return INVALID;
}
int clipRight(int x,int x1,int x2)
{
if(x1>x && x2<=x)
return OUT2IN;
else if(x1<=x && x2<=x)
return IN;
else if(x1<=x && x2>x)
return IN2OUT;
else if(x1>x && x2>x)
return OUT;
else
return INVALID;
}

int clipTop(int y,int y1,int y2)
{
if(y1>y && y2<=y)
return OUT2IN;
else if(y1<=y && y2<=y)
return IN;
else if(y1<=y && y2>y)
return IN2OUT;
else if(y1>y && y2>y)
return OUT;
else
return INVALID;
}

void leftClipper()
{
int orientation;
int incrside = 0;
int j=0;
int cx,cy;
int x1,y1,x2,y2;
int i;

for(i=0;i<sides*2;i=i+2)
{
x1 = poly[i];
y1 = poly[i+1];

x2 = poly[i+2];
y2 = poly[i+3];

orientation = clipLeft(xmin,x1,x2);

switch(orientation)
{
case OUT2IN:
cx = xmin;
cy = y1 + (float)(y2 - y1) * (float)(xmin - x1)/(float)(x2 - x1);

tempPoly[j]   = cx;
tempPoly[j+1] = cy;
j = j+2;

tempPoly[j]   = x2;
tempPoly[j+1] = y2;
j = j+2;

incrside++;
break;
case IN:
tempPoly[j]   = x2;
tempPoly[j+1] = y2;
j = j+2;
break;
case IN2OUT:
cx = xmin;
cy = y1 + (float)(y2 - y1) * (xmin - x1)/(float)(x2 - x1);

tempPoly[j]   = cx;
tempPoly[j+1] = cy;
j = j+2;

break;
case OUT:
incrside--;
break;
}
}

sides = sides + incrside;

for(i=0;i<sides*2;i=i+2)
{
poly[i] = tempPoly[i];
poly[i+1] = tempPoly[i+1];
}

poly[i]   = poly[0];
poly[i+1] = poly[1];
}

void bottomClipper()
{
int orientation;
int incrside = 0;
int j=0;
int cx,cy;
int x1,y1,x2,y2;
int i;

for(i=0;i<sides*2;i=i+2)
{
x1 = poly[i];
y1 = poly[i+1];
x2 = poly[i+2];
y2 = poly[i+3];

orientation = clipBottom(ymin,y1,y2);

switch(orientation)
{
case OUT2IN:
cx = x1 + (float)(ymin - y1) * (x2 - x1) / (y2 - y1);
cy = ymin;
tempPoly[j]   = cx;
tempPoly[j+1] = cy;
j = j+2;

tempPoly[j]   = x2;
tempPoly[j+1] = y2;
j = j+2;

incrside++;
break;
case IN:
tempPoly[j]   = x2;
tempPoly[j+1] = y2;
j = j+2;
break;
case IN2OUT:
cx = x1 + (float)(ymin - y1) * (x2 - x1) / (y2 - y1);
cy = ymin;

tempPoly[j]   = cx;
tempPoly[j+1] = cy;
j = j+2;

break;
case OUT:
incrside--;
break;
}
}

sides = sides + incrside;

for(i=0;i<sides*2;i=i+2)
{
poly[i] = tempPoly[i];
poly[i+1] = tempPoly[i+1];
}

poly[i]   = poly[0];
poly[i+1] = poly[1];
}

void rightClipper()
{
int orientation;
int incrside = 0;
int j=0;
int cx,cy;
int x1,y1,x2,y2;
int i;

for(i=0;i<sides*2;i=i+2)
{
x1 = poly[i];
y1 = poly[i+1];
x2 = poly[i+2];
y2 = poly[i+3];

orientation = clipRight(xmax,x1,x2);

switch(orientation)
{
case OUT2IN:
cx = xmax;
cy = y1 + (float)(y2 - y1) * (float)(xmax - x1)/(float)(x2 - x1);
tempPoly[j]   = cx;
tempPoly[j+1] = cy;
j = j+2;

tempPoly[j]   = x2;
tempPoly[j+1] = y2;
j = j+2;

incrside++;
break;
case IN:
tempPoly[j]   = x2;
tempPoly[j+1] = y2;
j = j+2;
break;
case IN2OUT:
cx = xmax;
cy = y1 + (float)(y2 - y1) * (xmax - x1)/(float)(x2 - x1);

tempPoly[j]   = cx;
tempPoly[j+1] = cy;
j = j+2;

break;
case OUT:
incrside--;
break;
}
}

sides = sides + incrside;

for(i=0;i<sides*2;i=i+2)
{
poly[i] = tempPoly[i];
poly[i+1] = tempPoly[i+1];
}

poly[i]   = poly[0];
poly[i+1] = poly[1];
}

void topClipper()
{
int orientation;
int incrside = 0;
int j=0;
int cx,cy;
int x1,y1,x2,y2;
int i;

for(i=0;i<sides*2;i=i+2)
{
x1 = poly[i];
y1 = poly[i+1];
x2 = poly[i+2];
y2 = poly[i+3];

orientation = clipTop(ymax,y1,y2);

switch(orientation)
{
case OUT2IN:
cx = x1 + (float)(ymax - y1) * (x2 - x1) / (y2 - y1);
cy = ymax;
tempPoly[j]   = cx;
tempPoly[j+1] = cy;
j = j+2;

tempPoly[j]   = x2;
tempPoly[j+1] = y2;
j = j+2;

incrside++;
break;
case IN:
tempPoly[j]   = x2;
tempPoly[j+1] = y2;
j = j+2;
break;
case IN2OUT:
cx = x1 + (float)(ymax - y1) * (x2 - x1) / (y2 - y1);
cy = ymax;

tempPoly[j]   = cx;
tempPoly[j+1] = cy;
j = j+2;

break;
case OUT:
incrside--;
break;
}
}

sides = sides + incrside;

for(i=0;i<sides*2;i=i+2)
{
poly[i] = tempPoly[i];
poly[i+1] = tempPoly[i+1];
}

poly[i]   = poly[0];
poly[i+1] = poly[1];
}

void main()
{
int gdriver = DETECT,gmode;
int i,j=0;
int xx,yy;

initgraph(&gdriver,&gmode,"c:\\tc\\bgi");

cleardevice();

printf("\nEnter no of sides : ");
scanf("%d",&sides);

for(i=0;i<sides;i++)
{
printf("\nEnter x , y : ");
scanf("%d",&poly[j++]);
scanf("%d",&poly[j++]);
}
poly[j++] = poly[0];
poly[j] = poly[1];

printf("\nEnter Clipwindow (Xmin,Ymin) - (Xmax,Ymax) : ");
scanf("%d%d%d%d",&xmin,&ymin,&xmax,&ymax);

cleardevice();

setcolor(GREEN);
drawpoly(sides+1,poly);

rectangle(xmin,ymin,xmax,ymax);

getch();

leftClipper();
rightClipper();
bottomClipper();
topClipper();

setcolor(YELLOW);
drawpoly(sides+1,poly);

getch();
}

SAP based Online Promotion Examination IT Project

This is a good MCA project report on "SAP based online promotion examination". This project is develop to minimize the financial implications and streamlining the process the requirement of the online promotion examination was generated. Its mission is to offer a quick and easy way to appear the exam and it also provide the result immediately after the exam. This exam consist many procedure as if you are employee of ONGC then you have to login for exam or enter your CPF number.

Automated Testing of CGFC CPU Modules

This is a good electronics project report on "automated testing of CGFC CPU modules". In this project, we have only tested the functioning of NVRAM (Non-volatile RAM), Real Time Clock (RTC) chip, CPLD (Complex Programmable Logic Device), Serial Port used in the CGFC. This can be extended to testing of I/O Rack, USB & Ethernet ports (if used) in time-being.

ASP Project on Automatic Share Transaction

Automatic Share Transaction is a good Computer science ASP.net project for final year students. This is a Web based application whose aim is to automate the process of Buying and Selling of Shares over internet. In general we should approach the Share Brokers for these transactions and they are going to charge some minimal amount for each transaction. To avoid this payment to the Brokers the users can register to the portal directly and can do their own transaction without any other Brokers interaction.
This web application is accessible for registered users only can do their own transactions over internet. For the transactions they need not to pay any amount to any Brokers. Above image shows a Use case diagram for login. This report contains UML diagrams, flow charts, Test case, screenshot etc. Use it for your reference and study work.

Generic SQL Explorer CSE Project Report

This is a good Computer science final year project report on "generic SQL explorer" submitted in partial fulfillment of the requirements for the award of the degree of Computer science & engineering. This project is being developed to fulfill the basic needs of a student who wishes to learn basics of databases and also the needs of a non DBA software engineer. This SQL Explorer is a powerful, yet easy-to-use graphical tool for all database developers. It allows you to connect any ODBC complaint databases present in the local machine or anywhere within the network, such as Oracle, DB2, SQL Server, etc. and edit SQL scripts and queries with syntax highlighting.

VB Project on Automobile Utilization

This is a good CSE final year project on automobile utilization based on visual basic and Oracle. This is a software which can be used by a automobile center for keeping the records of items which is to be transacted for purchase and sell. It helps to keep a record of all the transactions and a password login is created for security. Automobile system deals with the purchase and sales of the good and maintains the stock.

This is a good MCA thesis project report on "workload management system". In this project a database system is to be created to track current and projected workload as well as to fit an engineer's expertise and preferences to existing projects. Furthermore, the engineers’ information of skill and experience will be stored in the database which can be queried so that the additional hiring can be determined.

Author:-Ralph E. McGregor, Peng Li and Jenny J. Zhang

Weekly Automatic College Timetable Generation CSE Project

This is a good computer science final year project report on "rich internet application for weekly automatic college timetable generation". This project is submitted in partial fulfillment for the degree of bachelor of Engineering in Computer Science and Engineering. This project introduces a practical timetabling algorithm capable of taking care of both strong and weak constraints effectively, used in an automated timetabling system. This project reduces the overhead on server of rendering client’s UI components and makes room for processing time of Timetable Generator Algorithm.

Timetabling Algorithm is main component of this project which produces the HTML based weekly timetable sheet as the output. Our project takes various inputs from the user such as Teacher List, Course List, Semester List, Room List, Day List and Timeslot as well as various rules, facts and constraints using web based forms, which are stored in XML based knowledge base. This is AJAX based project and report contains working, source coding, diagram of the project. Use it for your reference and study work.

Author:-Ajinkya Kulkarni, Ajay Chate, Mandar Kavishwar, Shailesh Thakre, Prafulla Ingle & Gaurav Bhuyar

Portable Media Player M.Tech Project

This is good Master level project on "Portable Media Player (POMP)which was submitted for the partial fulfillment of 3rd Year of Master of Technology. Aim of this project are to learn interaction between a desktop and a Bluetooth enabled mobile device, to provide a virtual command prompt on mobile device to perform various tasks remotely, to provide new user experience for music freaks so that they can take advantage of their giant music library (that’s on PC) from anywhere within range of class B Bluetooth (30 feet), to learn about all the technical restrictions that a developer can face while learning mobile development using JAVA.

Peer to Peer (P2P) Online Communities CSE Project Mar

This is a computer science mini project report on "Peer-to-peer (P2P) online communities" which is submitted for partial fulfillment for the award of the degree of Master of Engineering in Computer Science and Engineering. This paper presents PeerTrust—a reputation-based trust supporting framework, which includes a coherent adaptive trust model for quantifying and comparing the trustworthiness of peers based on a transaction-based feedback system, and a decentralized implementation of such a model over a structured P2P network.

Device Switching Using PC’s Parallel Port CSE Project

This is a good Computer Science engineering minor project report on "Device switching using PC’s Parallel Port " which is submitted for the partial fulfilment for requirements for the award of degree of B.Tech in Computer Science. This project aims at controlling different devices at home/industry by using a single PC and could be used to control the printer power, loads & other household electrical appliances. The circuit comprises decoder, inverter, latch & relay driver sections.

Cold Boot Attack CSE Seminar Report

This is a good computer science project report on "Cold Boot Attack". This project is a Proof of Concept(POC) for capturing memory dumps from Intel x86-64 based PC system. RAM persistence can be exploited using both hardware and software mechanisms. In cryptography, a cold boot attack is a type of side channel attack in which an attacker with physical access to a computer is able to retrieve user's specific sensitive information from a running operating system after using a cold reboot to restart the machine from a completely "off" state.

Bank Management System Project Report

This is a good final year Computer science engineering project report on "Bank Management system" which is based on the powerful tool – Visual Basic 6.0 (Front end) with sql server 7.0 (Backend). This project gives a idea regarding automated bank system. The purpose of this project is to automate the process of day to day activities like New Account Opening, Daily Transactions, and Modification.

Design of Optical Switch Router

This is a good Electronics and Telecommunication networks project report on "design of optical switch router". This paper deals with the design of optical switching router. The paper talks about the concepts of all-optical network, dense wavelength division multiplexing and generalized multi-protocol label switching, optical switching technology. Optical fiber has significant advantages compared with the electrical transmission line.

Android OS based Search Engine CSE Project Report

This is a good final year Computer & IT engineering project report on "Android Operating system at mobile based search engine and submitted in partial fulfillment of the requirement for the award of BTECH. By this project, a unique search engine was presented for effective searching Of information through mobile interface. The engine adopts three methods for retrieval: two autonomousand one combinational.

Accelerating Ranking System Using Webgraph

This is a Master of Science project report on "accelerating ranking system using webgraph" which is submitted to department of Computer Science. Search Engine is a tool to find the information on any topic in the Web. The basic components of a Search Engine are Web Crawler, Parser, Page-Rank System, Repository and a Front-End. In Web graph the Web pages are represented as nodes and the hyperlinks between the Web pages are represented as directed links from one node to other node..
The entire process of generating page-rank using algorithm namely Cluster Rank, Source Rank and Truncated PageRank was automated. The current implementation uses the URL table that contains more than 4 Million URLs. Thanks to author of the project and use this report only for your study and reference work.

WAP to Implement One Time Pad Algorithm

#include<stdio.h>
#include<conio.h>
#include<string.h>
int main()
{
char pt[50],key[50],ct[50];
int i,n;
printf("Enter Plain Text\n");
gets(pt);
printf("Enter Key\n");
gets(key);
if(strlen(pt)==strlen(key))
{

for(i=0;i<strlen(pt);i++)
{
pt[i]=pt[i]-96;
key[i]=key[i]-96;
ct[i]=pt[i]+key[i];

while(ct[i] > 25)
{
ct[i]=ct[i]-26;
}
}

for(i=0;i<strlen(pt);i++)
{
ct[i]+=96;
printf("%c",ct[i]);
}
}
else
{
printf("\nPlain Text and Key Have No Same Length");
}
getch();
return 0;
}

WAP to Implement Diffi-Helman Algorithm

#include<stdio.h>
#include<conio.h>
#include<string.h>
#include<MATH.H>
void main()
{
int  a,xa,xb,b,c,d,e;
clrscr();
int ya,yb,k1,k2,q;
printf("enter prime no q:=");
scanf("%d",&q);
printf("Enter prime no a where a is primitive root of q:=");
scanf("%d",&a);
printf("enter secret key xa:=");
scanf("%d",&xa);
printf("enter secret key xb:=");
scanf("%d",&xb);

b=pow(a,xa);
ya=b%q;
c=pow(a,xb);
yb=c%q;
printf("value of public key ya:=%d\n",ya);
printf("value of public key yb:=%d\n",yb);

d=pow(yb,xa);
k1=d%q;
e=pow(ya,xb);
k2=e%q ;
printf("value of k1:=%d\n", k1);
printf("value of k2:=%d\n",k2);
printf("here we get k1=k2 so keys are exchanged");
getch();
}

WAP to Implement RSA Algorithm

#include< stdio.h>
#include< conio.h>

int phi,M,n,e,d,C,FLAG;

int check()
{
int i;
for(i=3;e%i==0 && phi%i==0;i+2)
{
FLAG = 1;
return;
}
FLAG = 0;
}

void encrypt()
{
int i;
C = 1;
for(i=0;i< e;i++)
C=C*M%n;
C = C%n;

}
printf("\n\tEncrypted keyword : %d",C);

void decrypt()
{
int i;
M = 1;
for(i=0;i< d;i++)
M=M*C%n;
M = M%n;
printf("\n\tDecrypted keyword : %d",M);
}
printf("\n\tDecrypted keyword : %d",M);
void main()
{
int p,q,s;
clrscr();
printf("Enter Two Relatively Prime Numbers\t: ");
scanf("%d%d",&p,&q);
n = p*q;
phi=(p-1)*(q-1);
printf("\n\tF(n)\t= %d",phi);
do
{
printf("\n\nEnter e\t: ");
scanf("%d",&e);
check();
}while(FLAG==1);
d = 1;
do
{
s = (d*e)%phi;
d++;
}while(s!=1);
d = d-1;
printf("\n\tPublic Key\t: {%d,%d}",e,n);
printf("\n\tPrivate Key\t: {%d,%d}",d,n);
printf("\n\nEnter The Plain Text\t: ");
scanf("%d",&M);
encrypt();
printf("\n\nEnter the Cipher text\t: ");
scanf("%d",&C);
decrypt();
getch();
}