Tech_Blog

Reliance Jio Offers 100% Cashback For Prime Membership; Upto 120 GB Free  Prime Membership Can Now Be 100% Free Use Jio Money app to purchase Jio Prime membership costing Rs 99. Under their new offer, you will get Rs 50 cashback on Jio Money. Then, use Jio Money again to recharge Rs 303 or Rs 499 for one month. Under the existing offer, you will again get Rs 50 cashback on Jio Money. At this moment, you have already bought Jio Prime Membership by paying Rs 99; recharged your Jio number for Rs 303 or Rs 499 for a month, and received cashback of Rs 100 on Jio Money. Hence, basically, you are getting Jio Prime membership for free. All you need to pay is monthly recharge of Rs 303 or Rs 499 Up to 120 GB Free On Annual Recharges The period post-March 31st would be the real litmus test for Mukesh Ambani’s Jio because, after that day, Jio would be no longer free. The number of Prime’s paid customer base shall determine Jio’s true impact, and the company has left no

**How To Get   Jio Prime Membership @ Rs 49 – with Mobikwik ????** Mobikwik is offering free SuperCash to its users. You can get Jio Prime Membership @ Rs 49 only. Mobikwik is giving Rs 5o cashback called # SuperCash to its users who buy Jio prime membership through Mobikwik. Jio Prime Membersip actually costs Rs 99. You have to recharge Rs 99 to  become Jio Prime member  but using this offer by Mobikwik you get some benefits. STEPS:- 1)  DOWNLOAD   Mobikwik   FROM PLAYSTORE 2) REFER CODE "UNVQFU" FOR CASHBACK 3) ENTER YOUR MOBILE NUMBER 3) PAY WITH     Mobikwik  FOR JIO Prime Membership WITH FOLLOWING PROMO      CODE If you are a Mobikwik user, you will get Rs 20 SuperCash on Jio prime subscription of Rs 99. ****To get Rs 20 SuperCash use code:  PRIME If you are new to Mobikwik, you get flat 50 SuperCash on Jio Prime Membership Subscription. It means you are paying only Rs 49 for Jio Prime Membership worth Rs 99. ****To get Rs 49 Sup

AIM Implement euclidean Algorithm to find GCD of two numbers. CODE #include <stdio.h> int gcd_algorithm(int x, int y) {     if (y == 0) {         return x;     } else if (x >= y && y > 0) {         return gcd_algorithm(y, (x % y));     } } int main(void) {     int num1, num2, gcd;     printf("\nEnter two numbers to find gcd using Euclidean algorithm: ");     scanf("%d%d", &num1, &num2);     gcd = gcd_algorithm(num1, num2);     if (gcd)         printf("\nThe GCD of %d and %d is %d\n", num1, num2, gcd);     else         printf("\nInvalid input!!!\n");     return 0; } OUTPUT

AIM: To implement a program for encryption and decryption using vigenere cipher substitution technique Code: #include<bits/stdc++.h> using namespace std; string generateKey(string str, string key) {     int x = str.size();     for (int i = 0; ; i++)     {         if (x == i)             i = 0;         if (key.size() == str.size())             break;         key.push_back(key[i]);     }     return key; } string cipherText(string str, string key) {     string cipher_text;     for (int i = 0; i < str.size(); i++)     {         int x = (str[i] + key[i]) %26;         x += 'A';         cipher_text.push_back(x);     }     return cipher_text; } string originalText(string cipher_text, string key) {     string orig_text;     for (int i = 0 ; i < cipher_text.size(); i++)     {         // converting in range 0-25         int x = (cipher_text[i] - key[i] + 26) %26;         x += 'A';         orig_text.push_back(x);     }     re

AIM:  To implement a program to encrypt and decrypt using the Hill cipher substitution technique. CODE #include<iostream> #include<cstring> using namespace std; int main(){     int i,j,k,matrix[2][2],inverse[2][2],det,detinv;     char str[20],encrypted[20],decrypted[20],key[4];     cout<<"Enter key : ";     cin>>key;     cin.ignore();     for(i=0;i<2;i++){         for(j=0;j<2;j++){             matrix[i][j]=key[i*2+j]-97;         }     }     cout<<"Encryption Matrix : "<<endl;     for(i=0;i<2;i++){         for(j=0;j<2;j++){             cout<<matrix[i][j]<<"\t";         }         cout<<endl;     }     det=(676+matrix[0][0]*matrix[1][1]-matrix[0][1]*matrix[1][0])%26;     if(det==0||det%2==0||det%13==0){         cout<<"Invalid Key";         return -1;     }     cout<<"Determinant : "<<det<<endl;     i=1;     while(1

AIM :  To implement a program to encrypt a plain text and decrypt a cipher text using play fair Cipher substitution technique. CODE  #include<stdio.h> #include<conio.h> #include<string.h> #include<ctype.h> #define MX 5 void playfair(char ch1,char ch2, char key[MX][MX]) {  int i,j,w,x,y,z;  FILE *out;  if((out=fopen("cipher.txt","a+"))==NULL)   {    printf("File Currupted.");   }  for(i=0;i<MX;i++)  {   for(j=0;j<MX;j++)   {    if(ch1==key[i][j])    {     w=i;     x=j;    }    else if(ch2==key[i][j])    {     y=i;     z=j;    }   }  }  if(w==y)  {   x=(x+1)%5;z=(z+1)%5;   printf("%c%c",key[w][x],key[y][z]);   fprintf(out, "%c%c",key[w][x],key[y][z]);  }  else if(x==z)  {   w=(w+1)%5;y=(y+1)%5;   printf("%c%c",key[w][x],key[y][z]);   fprintf(out, "%c%c",key[w][x],key[y][z]);  }  else  {   printf("%c%c",key[w][z],key[y][x]);   fp