Latest Blog

January 25, 2014 | 1 Comment

This program shows how to convert an infix expression to postfix expression. Before proceeding to program, first understand what is difference between infix expression and postfix expression. Infix notation: X + Y. Operators are written in-between their operands. Postfix notation (also known as “Reverse Polish notation”) : X Y + . Operators are written after […]

January 25, 2014 | No Comments

The following program prints first 10 automorphic number.  I am giving you all brief introduction about what actually automorphic numbers are, assuming that some of you might not be aware about that.  In mathematics an automorphic number (sometimes referred to as a circular number) is a number whose square “ends” in the same digits as number itself. For example, 52 = 25, 62 = 36, 762 = […]

January 17, 2014 | No Comments

/* Calculate Permutation and Combination (nCr and nPr) Using Function */ #include<stdio.h> #include<conio.h> void main()

January 11, 2014 | No Comments

/* Fibonacci series using recursion */ #include<stdio.h> #include<conio.h> void main() {

January 11, 2014 | 2 Comments

/* Program to draw pyramid of numbers displaying  following Pattern  */ /*  1 2 3 4 5 6 7 8 9 10   */

January 10, 2014 | No Comments

/* Q. program to produce the following form of Floyd’s Triangle.       0       10       010       1010 */ #include<stdio.h> #include<conio.h> void main()

January 10, 2014 | No Comments

/* This program read n value into array calculate reverse array and display all data in reverse order  */ #include<stdio.h> #include<conio.h> void main() {

January 9, 2014 | No Comments

/* HPSORT.C : PROGRAM TO CREATE A HEAP AND TO SORT A HEAP, HEAP IS STORED IN AN ARRAY */ #include<stdio.h> #include<conio.h> void crheap(int [], int); void processheap(int [],int);