Skip to main content

Home Page

List of All Programs


The Following is the List of all the programs on my Blog


Math Programs

Sorting Algorithms

Linked List Programs

Binary Search Tree

Binary Search Tree

C Graphics Programs

Stack Programs

Queue Programs

Hashing

Encryption Decryption

Miscellaneous

Labels:

Comments

  1. Unknown17 January 2017 at 21:11

    More content needed on blog

    ReplyDelete
  2. Mohit Makhija30 January 2017 at 06:28

    Sure, Working on it. Thanks for your inputs

    ReplyDelete
  3. Unknown26 July 2018 at 07:34

    all contents are very useful.. thanks!! i need playfair cipher using python, can u plz put ur content for that..

    ReplyDelete
  4. Unknown4 December 2018 at 13:39

    amazing blog~ It really helps a lot!

    ReplyDelete

Post a Comment

Popular posts from this blog

Infix to Prefix conversion using Stack

This post is about conversion of Infix expression to Prefix conversion. For this conversion we take help of stack data structure, we need to push and pop the operators in and out of the stack. Infix expressions are the expressions that we normally use, eg. 5+6-7; a+b*c etc. Prefix expressions are the expressions in which the 2 operands are preceded by the operator eg. -+56 7 , +a*bc etc. This method is very similar to the method that we used to convert Infix to Postfix but the only difference is that here we need to reverse the input string before conversion and then reverse the final output string before displaying it. NOTE: This changes one thing that is instead of encountering the opening bracket we now first encounter the closing bracket and we make changes accordingly in our code. So, to convert an infix expression to a prefix expression we follow the below steps (we have 2 string, 1st is the input infix expression string 2nd is the output string which is empty initially)...
Post a Comment
Read more

Encrypt files using Vigenere Cipher

In this post we discuss a method to encrypt your files using  Vigenère Cipher . The  Vigenère cipher  is a method of  encrypting   alphabetic  text by using a series of interwoven  Caesar ciphers  based on the letters of a keyword.  It is a form of  polyalphabetic substitution . Even though the vigenere cipher is easy to understand and implement, for three centuries it resisted all attempts to break it. In order to encrypt a given message, a table of alphabets can be used, termed a  tabula recta , The following is the image of the Table. the above table   consists of the alphabet written out 26 times in different rows, each alphabet shifted cyclically to the left compared to the previous alphabet.  At different points in the encryption process, the cipher uses a different alphabet from one of the rows. The alphabet used at each point depends on a repeating keyword. Now let us consider an example...
Post a Comment
Read more