Professional Documents
Culture Documents
Data mining is the task of discovery interesting patterns from large amounts of data,
where the data can be stored in databases , data warehouses , or other information repositories .It
is a young interdisciplinary field ,drawing from areas such as database systems, data
warehousing, statistics ,machine learning ,data visualization, information retrieval and high-
performance computing. other contributing areas include neural networks ,pattern recognition,
spatial data analysis ,image databases ,signal processing and many application fields such as
business, economics and bioinformatics
Data mining refers to extracting or mining knowledge from large amounts of data
.The term is actually a misnomer .remember that the mining of gold from rocks or sand is
referred to as gold mining rather than rock or sand mining .thus ,data mining should have been
more appropriately named knowledge mining from data, simply knowledge mining .
Figure : data mining searching for knowledge (interesting patterns) in the data
Many people treat data mining as a synonym for another popularly used term,
knowledge discovery from data or KDD. Alternatively ,others view data mining as simply an
essential step in the process of knowledge discovery .knowledge discovery as a process is
depicted in the following figure.
Data processing :
Real world databases are highly suspectable to noise, missing, inconsistent data thus it is very
essential to clean the data. cleaning of data involves different methods. These methods help to
remove the noise detection and correction of inconsistency ,integration and transformation of
data from different sources and reducing the size of the data .data preprocessing in Clementine
involves 4 stages.
Reading data from different sources
Maintaining the data quality
Data manipulation
Obtaining the relationships of the data
AIM:
OUTPUT:
STREAM:
OUTPUT:
STREAM:
PROCESS:
OUTPUT:
2.) To explain different field options that facilitates to manipulate the data
AIM:
To implement different field options that facilitates to manipulate the data
a.) TYPE :
Type allows field metadata to be determined and controlled.The type node specifies field
metadata and properties. For example, you can specify a usage type(range, set, ordered set, or
flag) for each field ,set options for handling missing values and system nulls ,set the role of a
field for modeling purpose ,specify field and value labels and specify values for a field .
STEPS:
1. Select type node from the field options on palette onto the canvas.
2. Establish the connection from database/varfile to the type node and table or matrix(output).
3. Then edit the type by double click on the type node.
Field type values missing check direction
F1 type <read> none in/out/both
F2 type <read> none in/out/both
F3 type <read> none in/out/both
F4 type <read> none in/out/both
F5 type <read> none in/out/both
F6 type <read> none in/out/both
F7 type <read> none in/out/both
4. Then execute the table/matrix.
STREAM :
OUTPUT:
b). FILTER :
STREAM :
OUTPUT:
c).DERIVE :
Derive allows new fields to be generated based on existing fields.The derive node
modifies data values or creates new fields from one or more existing fields. It creates fields of
type formula, flag , set , state, count, and conditional .
Formula : the new field is the result of an arbitrary CLEM(Clementine language for
expression manipulation) expression .
Flag: the new field is a flag ,representing a specified condition .
Set : the new field is one of two states ,switching between these states is triggered by a
specified condition.
Count : the new field is based on the number of times that a condition has been true.
Conditional : the new field is the value of one of two expressions ,depending on the value of
the condition
STEPS :
1. Select type node from the field options on palette onto the canvas
2. Establish the connection from database/varfile to the type node and table or matrix(output).
3. Then edit the type by double click on the type node.
Field type values missing check direction
F1 type <read> none in/out/both
F2 type <read> none in/out/both
F3 type <read> none in/out/both
F4 type <read> none in/out/both
F5 type <read> none in/out/both
F6 type <read> none in/out/both
F7 type <read> none in/out/both
4. Then execute the table/matrix.
STREAM :
OUTPUT:
d). BINNING :
Binning allows numeric fields into sets. The binning node automatically creates new set
fields based on the values of one or more existing numeric range fields. For example, you can
transform a scale income field into new categorical field containing Groups of income as
deviations from the mean .once you can have created bins for new field ,you can generate a
derive node based on the cut points .
STEPS :
1. Select the varfile , binning node and table/matrix from the palette onto the canvas.
2. Establish the connection between them
3. Them edit binning and select the bin fields.
Bin fields : sal
4. Then execute the table/matrix.
STREAM :
OUTPUT:
e.) TRANSPOSE :
Transpose transposes records to fields and fields into records.
STEPS :
1) Select the varfile ,transpose node and table/matrix from the palette onto the canvas.
2) Establish the connection between them.
3) Then edit transpose and select
Read from field : ename
Red values : smith
4) Then execute table/matrix.
STREAM :
OUTPUT:
STREAM :
OUTPUT:
3.) To explain different record options that facilitates to manipulate the data
AIM :
To implement different record options that facilitates to manipulate the data
a) SELECT :
Select a subset of records based on a specified condition .the select node selects or
discards a subset of records from the data stream based on a specific condition .For example, you
might select the records that pertain to a particular sales region.
STEPS :
1. Select the varfile, select node, and table/matrix from the palette onto the canvas.
2. Establish the connection between them.
3. Make a connection between the select and another new table and edit the select and give
appropriate data to retrieve the records.
4. Then execute the table/matrix to get the data according to the given condition.
STREAM :
OUTPUT:
b.) AGGREGATE :
Aggregate provides summary information on groups of records.The Aggregate node
replaces a sequence of input records with summarized, aggregated.
STEPS :
1. Select the varfile, aggregate node and table from the palette onto the canvas.
2. Establish the connection between them and made a new output connection to aggregate.
3. Edit the aggregate and select the aggregate field. And then click any of sum, mean, min,
max, sdev according to the requirement.
4. Then execute the table/matrix for output.
STREAM :
OUTPUT:
c.) SAMPLE :
Sample provides different methods for sample data.The sample node trims the size of
dataset according to parameters that you set. It is useful for paring down a large dataset, selecting
a random sample to generate a model or training a neural network.
STEPS :
1. Select the varfile, sample node and table from the palette onto the canvas
2. Establish the connection between them.
3. Make a connection between the sample and another new table and edit the select and give
appropriate data to retrieve the records
4. Then execute the table/matrix to get the data according to the given condition.
STREAM :
OUTPUT:
d.) SORT :
Sort records according to the specified criteria .The sort node sorts records into
ascending or decending order based on the values of one or more fields.
STEPS :
1. Select the varfile , sort node and table from the palette onto the canvas.
2. Establish the connection between them.
3. Edit the sort and select a field on which we want to perform sorting.
4. Then execute the table/matrix.
STREAM :
OUTPUT:
e.) MERGE :
Merge merges records from multiple inputs.The merge node takes multiple input records and
creates a single output record containing some or all of the input fields .it is useful for merging
data from different sources, such as internal customer data and purchased demographic data
STEPS :
1. Select the varfile ,merge node and table from the palette onto yhe canvas.
2. Establish the connection between them.
3. Edit the merge and select two keys (columns) to merge(join).
4. Then execute the table/matrix.
STREAM :
OUTPUT:
f.) DISTINCT :
Distinct includes or discards with distinct values in specified fields.The distinct node
removes duplicate records ,either by passing the first distinct record to the stream or by
discarding the first record and passing any duplicates to the data stream instead.
STEPS :
1. Select the varfile ,distinct node and table/matrix from the palette onto the canvas.\
2. Establish the connection between them.
3. Edit the distinct node and select a field which has duplicate values.
4. Then apply execute the table/matrix.
STREAM :
OUTPUT:
OUTPUT:
b.)DISTRIBUTION :
Distribution node displays a frequency graph of categorical values.Distribution nodes are
used to show the distribution of symbolic values in a dataset. They are frequently used before
manipulation nodes to explore the data and correct any imbalances. For example , if instances of
respondents without children occur much more frequently then other types of respondents ,you
might want to reduce these instances so that a more useful rule can be generated in later data
mining operations . A distribution node will help you to examine and make decisions about such
imbalances.
The distribution node is unusual in that it provides both a graph and a table to analyze your data.
STEPS :
1. Select the varfile, distribution node from the palette onto the canvas.
2. Establish the connection between them.
3. Edit and distribution graph and select the field for the graph.
4. Then apply execute the distribution graph of required field.
STREAM :
OUTPUT:
c.)COLLECTION :
Collection graph displays the distribution of values for a numeric field by another field.
Collection graphs are similar to histograms except that collections show the distribution of
values for one numeric field relative to the values of another , rather than occurrence of values
for a single field. A collection is useful for illustrating a variable or field whose values change
over time .using 3-d graphing you can also include a symbolic axis displaying distributions by
category.
STEPS :
1. Select the varfile , collection node from the palette onto the canvas.
2. Establish the connection between them.
3. Edit the collection and select the collect and over fields.
4. Then apply execute the collection graph.
STREAM :
OUTPUT:
d.) WEBPLOT :
Web displays a co-occurrence frequency graph for the categorized values .A web graph
maps associations between different categories . Start by connecting a web node to the source
node in your workspace .
STEPS :
1. select the varfile and web node from the palette onto the canvas.
2. Establish the connection between them.
3. Edit the web node and select the field to categorize the values.
4. Then apply execute the web graph.
STREAM :
OUTPUT:
e.) MULTIPLOT :
Multiplot displays the data in a 2-d multiplot.
STEPS :
1. Select the varfile and multiplot node from the palette onto the canvas.
2. Establish the connection between them .
3. Edit the multiplot by selecting the x-field and y-field .
4. Then execute the multiplot node(graph).
STREAM :
OUTPUT:
6. Select the var file and edit and load the Basket-in from the demos folder.And observe the
data, filter, types tabs on the same window.
7. Press apply and press ok.
8. Select type and edit the directions fields as follows. For non-product attributes select None
and remaining as both.
9. Click on read values.
10.Select Apriori and click on edit. Set the support and confidence percentages as you wish.
11.Click on Execute.
12.Youll get the output icon in the right side of the stream under modeling tab.
13. Select GRI and click on edit. Set the support and confidence percentages as you wish.
14. Click on Execute.
15. Youll get the output icon in the right side of the stream under modeling tab.
COGNOS
5. Click on ok button.
6. A new report opens and query dialogue appears.
7. In the query dialogue go to data tab page then look into catalog.
8. Expand emp folder.
9. Select required columns then move them to query data.
10. Employee number query data.
Employee name query data.
Job query data.
Salary query data.
11.Expand department folder .select required columns then move
them to query data.
12. Department number query data.
Department name query data
Location query data.
13.Click on ok.
14.Query execution error appears.
7. Click ok button.
11. Double click on select values then select values dialogue appears.
12. Double click on managers.
13. Double click on ) operator.
14. Click on ok button.
6. Click on ok button.
13. Catalog dialogue appears then expand conditions and folder select job then click on ok
button.
18. Expand prompt folder and select designation prompt then click on ok button.
19. Double click on ) operator.
COMPUTER NETWORKS
sdat[j]=txt[i];
if(!strncmp(txt+i,"11111",5))
{
sdat[j+1]='\0';
strcat(sdat,"11110");
j+=5;
i+=4;
}
}
sdat[j]='\0';
strcat(sdat,"01111110");
}
void main()
{
int ch;
char txt[500],sdat[500];
clrscr();
printf("Enter 1 for Character stuffing, any other for Bit stuffing\n");
scanf("%d",&ch);
printf("Enter data to be transmitted\n");
fflush(stdin);
gets(txt);
if(ch==1)
charStuff(txt,sdat);
else
bitStuff(txt,sdat);
printf("After Framing :\n");
printf("The data to be transmitted is\n");
puts(sdat);
getch();
}
OUTPUT:
if(M[m]==-1)
break;
}
printf("\t\t****MENU*****\n""\t\t1.CRC-12\n""\t\t2.CRC-16\n""\t\t3.CRC-32\n"
"\t\t4.CRC-CCIT\n""\t\tEnter your choice\n");
scanf("%d",&c);
if(c<1||c>4)
{
printf("Choose between 1 to 4 Only\n");
getch();
exit(0);
}
n=ch[c-1];
for(i=0;i<n-1;i++)
M[m+i]=0;
csum=(int *)malloc(sizeof(int)*n);
genverChecksum(M,m,G[c-1],n,csum);
printf("The Checksum is\n");
for(i=0;i<n-1;i++)
{
M[m+i]=csum[i];
printf("%d ",csum[i]);
}
printf("\nThe Transmitted data is\n");
for(i=0;i<m+n-1;i++)
printf("%d ",M[i]);
printf("\nAt Receivers side : \n");
printf("The Received data is\n");
for(i=0;i<m+n-1;i++)
printf("%d ",M[i]);
genverChecksum(M,m,G[c-1],n,csum);
printf("\nObtained Remainder is\n");
for(i=0;i<n-1;i++)
printf("%d ",csum[i]);
getch();
}
OUTPUT:
Enter data in 0's and 1's (-1 at end)
1 0 1 0 -1
****MENU*****
1.CRC-12
2.CRC-16
3.CRC-32
4.CRC-CCIT
Enter your choice 2
The Checksum is 0000000000111100
The Transmitted data is 10100000000000111100
At Receivers side :
The Received data is 1 0 1 0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 0 0
Obtained Remainder is 0000000000000000
{
dist[i] = d;
prev[i] = start;
}
if(min>dist[i] && selected[i]==0)
{
min = dist[i];
m = i;
}
}
start = m;
selected[start] = 1;
}
start = target;
j = 0;
while(start != -1)
{
path[j++] = start+65;
start = prev[start];
}
path[j]='\0';
strrev(path);
printf("%s", path);
return dist[target];
}
main()
{
int cost[N][N],i,j,w,ch,co;
int source, target,x,y;
printf("\tShortest Path Algorithm DIJKSRTRA's ALGORITHM\n\n");
for(i=1;i< N;i++)
for(j=1;j< N;j++)
cost[i][j] = IN;
char path[N];
for(i=1;i< N;i++)
{
dist[i] = IN;
prev[i] = -1;
}
start = source;
selected[start]=1;
dist[start] = 0;
while(selected[target] ==0)
{
min = IN;
m = 0;
for(i=1;i< N;i++)
{
d = dist[start] +cost[start][i];
if(d< dist[i]&&selected[i]==0)
{
dist[i] = d;
prev[i] = start;
}
if(min>dist[i] && selected[i]==0)
{
min = dist[i];
m = i;
}
}
start = m;
selected[start] = 1;
}
start = target;
j = 0;
while(start != -1)
{
path[j++] = start+65;
start = prev[start];
}
path[j]='\0';
strrev(path);
printf("%s", path);
return dist[target];
}
main()
{
int cost[N][N],i,j,w,ch,co;
int source, target,x,y;
printf("\tShortest Path Algorithm DIJKSRTRA's ALGORITHM\n\n");
for(i=1;i< N;i++)
for(j=1;j< N;j++)
cost[i][j] = IN;
for(x=1;x< N;x++)
{
for(y=x+1;y< N;y++)
{
printf("Enter the weight of the path between node %d and %d: ",x,y);
scanf("%d",&w);
cost [x][y] = cost[y][x] = w;
}
printf("\n");
}
printf("\nEnter The Source:");
scanf("%d", &source);
printf("\nEnter The target");
scanf("%d", &target);
co = dijsktra(cost,source,target);
printf("\nShortest Path: %d",co);
}
OUTPUT:
Shortest Path: 8
INPUT/ OUTPUT:
ENTER THE NO.OF VERTECES:12
ENTER THE SOURCE VERTEX NUMBER AND NAME:10 J ENTER NO.OF ADJ
VERTECES TO VERTEX 4
ENTER TIME DELAY and NODE NAME:8 A
ENTER TIME DELAY and NODE NAME:10 I
ENTER TIME DELAY and NODE NAME:12 H
ENTER TIME DELAY and NODE NAME:6 K
ENTER THE TIME DELAY FROM A to ALL OTHER NODES: 0 12 25 40 14 23 18 17
21 9 24 29
ENTER THE TIME DELAY FROM I to ALL OTHER NODES: 24 36 18 27 7 20 31 20 0
11 22 33
ENTER THE TIME DELAY FROM H to ALL OTHER NODES: 20 31 19 8 30 19 6 0 14 7
22 9
ENTER THE TIME DELAY FROM K to ALL OTHER NODES: 21 28 36 24 22 40 31 19
22 10 0 9
DELAYVIA--VERTEX 8 a
20 a
28 i
20 h
17i
30i
18h
12h
10i
0-
6k
15 k
INFORMATION SECURITY
IMPLMENTATION OF PGP:
1. Go to site GnuPGP.org this will run on windows as well as Linux.
2. Get the tool, download it.
3. In that go to Documentation, in that click on Guides, in that many are there but we used
Brendans page, click on that
4. List of commands are given
5. Execute it.
EXPECTED OUTPUT :
ABCdef
Value of var : 2
Real output :
ABCdef
Value of var : 8
cout<<j<<" SECONDS";
delay(1000);
}
clrscr();
cout<<"\n1.HARD-DISK CORRUPTION: ";
delay(4000);
cout<<"completed";
cout<<"\n\n2.MOTHER BOARD CORRUPTION: ";
delay(4000);
cout<<"completed";
cout<<"\n\n3.INSTALLING CYBERBOB.DLL -->WINDOWS/COMMAND :";
delay(4000);
cout<<"completed";
cout<<"\n\nPROCRAETORIAN.SYS SUCCESSFULLY PLANTED";
delay(3000); cout<<"\n\n\tVIRUS.EXE";
delay(2000);
cout<<"\n\n*************************";
cout<<"\n\n Sample test ";
cout<<"\n\n*************************";
delay(4000);
cout<<"\n\n**********************************";
cout<<"\n\nFor Real Virus ";
cout<<"\n\nMo: 010101010101 ";
cout<<"\n\n**********************************";
delay(10000);
}
void fool()
{
clrscr();
int g=DETECT,h;
initgraph(&g,&h,"c:\tc\bgi");
cleardevice();
delay(1000);
setcolor(2);
settextstyle(1,0,1);
delay(1000);
setbkcolor(BLUE);
getch();
delay(4000);
closegraph();
exit(0);
}
OUTPUT:
q = n0 / b0;
r = n0 - q * b0;
}
if (b0 != 1)
return 0;
else
return t % n;
}
int main(void)
{
long a = 101, alpha = 4, beta = 449, e1 = 45;
long e2 = 237, f1 = 125, f2 = 9, i, j, p = 467; long q, x = 286, y = 83, c, d, C, D, r, s, t;
clrscr();
q = (p - 1) >> 1;
printf("a = %ld\n", a);
printf("alpha = %ld\n", alpha);
printf("beta = %ld\n", beta);
printf("e1 = %ld\n", e1);
printf("e2 = %ld\n", e2);
printf("f1 = %ld\n", f1);
printf("f2 = %ld\n", f2);
printf("p = %ld\n", p);
printf("q = %ld\n", q);
printf("x = %ld\n", x);
printf("y = %ld\n", y);
i = Extended_Euclidean(a, q);
c = (exp_mod(y, e1, p) * exp_mod(beta, e2, p)) % p;
d = exp_mod(c, i, p);
printf("Alice's challenge c = %ld\n", c);
printf("Bob's response d = %ld\n", d);
if (d != (exp_mod(x, e1, p) * exp_mod(alpha, e2, p)) % p)
printf("d != x ^ e1 * alpha ^ e2 mod p\n");
else
printf("d == x ^ e1 * alpha ^ e2 mod p\n");
C = (exp_mod(y, f1, p) * exp_mod(beta, f2, p)) % p;
D = exp_mod(C, i, p);
OUTPUT:
a = 101
alpha = 4
beta = 449
e1 = 45
e2 = 237
f1 = 125 f2 = 9
p = 467
q = 233
x = 286
y = 83
Alice's challenge c = 305
Bob's response d = 109
d != x ^ e1 * alpha ^ e2 mod p
Alice's challenge C = 270
Bob's response D = 68
D != x ^ f1 * alpha ^ f2 mod p
Alice concludes y is a forgery
for(int j=1;j<=n;j++)
{
textcolor(x[j]);
gotoxy(1,j);
cprintf("queen %d : %d",j,x[j]);
}
getch();
break;
}
else
nqueen(k+1,n);
}
}
return;
}
int queen::place(int k,int i)
{
int j;
for(j=1;j<=k;j++)
{
if((x[j]==i)||(abs(x[j]-i)==abs(j-k)))
return 0;
} return 1;
}
void main()
{
clrscr();
queen q;
}
OUTPUT:
Enter the number of Queens : 4
Queen 1 : 3
Queen 2 : 1
Queen 3 : 4
Queen 4 : 2
Enter the number of Queens : 8
Queen 1 : 1 1 2
Queen 2 : 5 7 8
Queen 3 : 8 4 6
Queen 4 : 6 6 1
Queen 5 : 3 8 3
Queen 6 : 7 2 5
Queen 7 : 2 5 7
Queen 8 : 4 3 4
queen 1 : 2
queen 2 : 8
queen 3 : 6
queen 4 : 1
queen 5 : 3
queen 6 : 5
queen 7 : 7
queen 8 : 4
}
for(i=0;i<9;i++)
{ //Multiple for Loops For Storing The Numbers//
num[i]=i; //An Array //
}
for(i=14;i<31;i++) //Loops Will Store 100 Numbers//
{
num[i-5]=i; //which Will Encrypt The Contents Of A File//
}
for(i=33;i<=68;i++) //To Avoid Theerror Ocuur Caused By The//
{ //Enter Key,Tab Key & Space Key//
num[i-7]=i; //TheseVariations In Loops Is Made//
}
for(i=97;i<=122;i++)
{
num[i-35]=i;
}
while(fin)
{ //Open The Input File//
fin.get(ch);
if(ch==EOF)break; //Exit To Loop When End Of File//
if((ch>=97) && (ch<=122))
{ //Encrypt The Small Letters//
i=97;
mod=num[ch-i];
fout<<mod;
}
if((ch>=65) && (ch<=90))
{
i=39; //Encrypt The Capital Letters//
mod=num[ch-i]; //And Store In An Output File//
fout<<mod;
}
if((ch>=48) && (ch<=57))
{
i=4; //Encrypt The Numbers//
mod=num[ch+i];
fout<<mod;
}
if((ch==10)||(ch==13))
{
mod=ch; //For Enter Key//
fout<<mod;
}
if(ch==32)
fout<<ch; //For Space Key//
if(ch==9)
fout<<ch; //For Tab Key//
if((ch>=33)&&(ch<=47))
{ //For Special Symbols// mod=ch+64;
fout<<mod;
}
if((ch>=58)&&(ch<=64))
{ //For Special Symbols//
mod=ch+54;
fout<<mod;
}
if((ch>=91)&&(ch<=96))
{
mod=ch+28; //For Special Symbols//
fout<<mod;
}
if((ch>=123)&&(ch<=126))
{
mod=ch-40; //For Special Symbols//
fout<<mod;
}
}
fin.close(); //Close The Input File//
fout.close(); //Close The Output file//
cout<<"\nYour File Is Encrypted Now........... ";
getch();
return 0;
}
/*=================================================================*/
/* This Program Will Decrypt The Document */
if(option==2)
{
char name[30],target[30],ch,mod; //Declare Variables//
int num[100],i,flag;
cout<<"\nEnter The Path Of A File Name Which Is To Be Decrypted : ";
gets(name);
ifstream fin(name,ios::binary);
if(!fin) //Open The Encryped File In A Binary Mode//
{
cout<<"\nError In Opening Of A File : ";
return 1; //Show Error If File Does Not Exist//
} //Or Any Occurs In Opening Of A File//
cout<<"\nEnter The New Decrypted File Name : ";
gets(target);
ofstream fout;
fout.open(target,ios::binary); //Opens The Output File In An Binary Mode//
if(!fout)
{ //Show Error if Any Error Occurs In Opening Of A File//
cout<<"\nError In Opening Of A Target File : ";
return 1;
}
for(i=0;i<9;i++)
{
num[i]=i; //In An Array//
}
for(i=14;i<31;i++)
{
num[i-5]=i; //Loops Will Store 100 Numbers//
}
for(i=33;i<=68;i++) //Which encrypts The Document Also Decrypt It//
{
num[i-7]=i;
}
while(fin)
{ //Opens The Encryped File//
fin.get(ch);
flag=0; //Turn Off Flag//
if(ch==EOF)break;
for(i=26;i<52;i++)
{
if(ch==num[i]) //Loop For Match The Small Letters Letters//
{
mod=i+39; //If Match Then Put Appropriate Letter//
fout<<mod; //In A OutPut File//
flag=1;
break ; //Turn On Flag And Exit The Loop//
}
}
if (flag==1) continue ; //If Flag Is On Then Continue Outer Loop//
for(i=0;i<26;i++)
{ //Loop For Match The Capital Letters//
if(ch==num[i])
{ //If Match Then Put Appropriate Letter//
mod=i+97; //In A OutPut File//
fout<<mod;
flag=1;break; //Turn On Flag And Exit From This Loop//
}
}
if (flag==1) continue ; //If Flag Is On Then Continue Outer Loop//
for(i=52;i<62;i++)
{ //Loop For Numerical Numbers//
if(ch==num[i])
{
mod=i-4;
fout<<mod;
flag=1; break ;
}
}
if (flag==1) continue ;
if((ch==10)||(ch==13))
{
mod=ch; //Condition For Enter Key//
fout<<mod;
}
if(ch==32)
fout<<ch; //condition For Space Key//
if(ch==9)
fout<<ch; //Condition For Tab Key//
if((ch>=97)&&(ch<=111))
{
mod=ch-64; //For Special Symbols//
fout<<mod;
}
if((ch>=112)&&(ch<=118))
{
mod=ch-54; //For Special Symbols//
fout<<mod;
}
if((ch>=119)&&(ch<=124))
{
mod=ch-28; //For Special Symbols//
fout<<mod;
}
if((ch>=83)&&(ch<=86))
{ //For Special Symbols//
mod=ch+40;
fout<<mod;
}
}
fin.close(); //Close The Encrypted File//
fout.close(); //Close Your Original Decrypted File//
cout<<"\nThe File Is Being Decrypted............ ";
getch();
return 0; }
return 0;
}
OUTPUT:
Enter Your Option
1. To Encrypt The File
2. To Decrypt The File
Option : 1
Enter The Path Of A File Which Is To Be Encrypted : c:\a.txt
Enter The New Encrypted File Name : c:\enc.txt
Option : 1
Enter The Path Of A File Which Is To Be Decrypted : c:\enc.txt
Enter The New Decrypted File Name : c:\dec.txt
The File Is Being Decrypted .............