TECH KNOW STUDY

  WAP in C/C++ to implement CRC algorithm.

WAP in C/C++ to implement DLL framing method by bit stuffing.

WAP in C/C++ to implement DLL framing method by character stuffing.

                  Encrypt and decrypt a plain text using
                  transposition cipher method.

Encrypt and decrypt a plain text using substitution cipher(normal method)

METHOD OF ENCRYPTION-: 

The transformation can be represented by aligning two alphabets; the cipher alphabet is the plain alphabet rotated left or right by some number of positions. For instance, here is a Caesar cipher using a left rotation of three places (the shift parameter, here 3, is used as the key):
Plain:   ABCDEFGHIJKLMNOPQRSTUVWXYZ
Cipher:  DEFGHIJKLMNOPQRSTUVWXYZABC

KNAPSACK:

IT is a problem in which we have items with
their weight  & values respective & provided
a knapsack with a given capacity.

OUR objective is to find that subnet of items
which can fit in the Knapsack .So as to maximize
total project to design a recursive equation
for 0/1 KNAPSACK.

pictured EXAMPLE:-

LCS{Longest Common Subsequent}

 In LCS Problem we have given two sequence
and we wish to find maximum length common
subsequent of these two given sequence.

picture output example of lcs :-

PROGRAM:-

#include<stdio.h>
#include<conio.h>
#include<string.h>
void print_lcs(char b[10][10],char x[10],int i,int j)
{

if(i==0||j==0)
{
return;
}
if(b[i][j]=='*')
{
print_lcs(b,x,i-1,j-1);
printf("%c",x[i-1]);
}
else if(b[i][j]=='|')
{
print_lcs(b,x,i-1,j);
}
else
{
print_lcs(b,x,i,j-1);
}

}
void main()
{
char x[10],y[10],b[10][10];
int i,j,m,n,c[10][10];
clrscr();
printf("************enter the first string*************\n");
scanf("%s",&x);
m=strlen(x);
printf("************enter the second string************\n");
scanf("%s",&y);
n=strlen(y);
printf("length of the first string is=\t%d\nlength of second string is=\t%d\n\n\n",m,n);
for(j=0;j<=n;j++)
{
c[0][j]=0;
}
for(i=0;i<=m;i++)
{
c[i][0]=0;
}
for(i=1;i<=m;i++)
{
for(j=1;j<=n;j++)
{
if(x[i-1]==y[j-1])
{
c[i][j]=(c[i-1][j-1])+1;
b[i][j]='*';
}
else if(c[i-1][j]>=c[i][j-1])
{
c[i][j]=c[i-1][j] ;
b[i][j]='|';
}
else
{
c[i][j]=c[i][j-1];
b[i][j]='-';
}
}
}
printf("THE SOLUTION TO THE LCS PROBLEM IS=");
print_lcs(b,x,m,n);

printf("\n\nAND IT CAN BE OBTAINED AS FOLLOWS\n\n");
for(i=0;i<=m;i++)
{
for(j=0;j<=n;j++)
{

printf("%d%c",c[i][j],b[i][j]);
printf("\t");
}
printf("\n");
}
printf("\n");
printf("* = diagonal\n");
printf("| = up\n");
printf("- = side");
getch();
}

CMM{Chain Matrix Multiplication}

CMM is a techniqueto minimize the multiplication of matrix, when we have more than one matrix.
and the other function of CMM is to parentheses.

Here we have a c program for parentheses the matrix multiplication

 Graphics program

 RADIX SORT

 In Radix sort is sorting is done on the base of place element{DIGIT}
exam: in 256 "6" is in ones place.

It is mainly use in arranging the name or we  can say English word. if you use it to arrange the number so please take equal place numbers. Otherwise it may give wrong output.    


}

merge sort 

Merge sort is based on divide and conquer method, which repeatedly cut then problem into

"equal halves" and sort them by following divide and conquer method recursively.

temp++;
temp++;
temp++;
temp++;
}
...

Bubble sort

Bubble sort is also known as sinking sort.In it we compare adjacent pair and swap them if necessary causing.
This process is repeated until we get the sorted list.

#include<conio.h>
#include<stdio.h>
#define max 5
void main()
{
int j,a[max],key,i,k;
clrscr();
printf("enter the array element");
for(i=0;i<=max;i++)
{
scanf("%d",&a[i]);
}
for(j=0;j<=max;j++)
{
for(k=max;k>=j+1;k--)
{
if(a[k]<a[k-1])
{
key=a[k];
a[k]=a[k-1];
a[k-1]=key;
}
}
}
for(i=0;i<=max;i++)
{
printf("%d",a[i]);
}
getch();
}

Insertion sort is a technique to arrange the given no. in a order i.e. ascending order.It like inserting a card between three or four cards which comes in order if a right card insert in between them
Example: