C program to count the leaves of the binary tree.

Posted on March 14, 2012 by Sandeepa Nadahalli

Write a C program to count the leaves of the binary tree.
Binary tree is the ordered directed tree data structure, in which each node has at most two nodes.
A node is called as a leaf node, if it does not contains any child elements. In this program, We used the structures to create the binary tree.
Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include <stdio.h>
#include <stdlib.h>
#include <conio.h>

struct node
{
 int data;
 struct node* leftnode;
 struct node* rightnode;
};

//get the leaves count
unsigned int getLeafCount(struct node* node)
{
 if(node == NULL)
  return 0;
 if(node->leftnode == NULL && node->rightnode==NULL)
  return 1;
 else
  return getLeafCount(node->leftnode)+
    getLeafCount(node->rightnode);
}


struct node* newNode(int data)
{
 struct node* node = (struct node*)
  malloc(sizeof(struct node));
 node->data = data;
 node->leftnode = NULL;
 node->rightnode = NULL;

 return(node);
}


int main()
{

 clrcsr();
 struct node *root = newNode(1);
 root->leftnode = newNode(2);
 root->rightnode = newNode(3);
 root->leftnode->leftnode = newNode(4);
 root->leftnode->rightnode = newNode(5); 


 printf("nnLeaf count of the binary tree is %d", getLeafCount(root));

 getch();
 return 0;
}

Read more Similar C Programs
Data Structures
Breadth First Search(BFS)
Learn C Programming

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C Program to implement hashing.

Posted on March 13, 2012 by Sandeepa Nadahalli

Write a C Program to implement hashing.
Hashing is the function or routine used to assign the key values to the each entity in the database. Using hashing, We can easily access or search the values from database.
In this program we used the open addressing hashing, also called as closed hashing.
Read more about C Programming Language.

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/
#include<stdio.h>
#include<conio.h>
void main() {
 int a[10] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
 int n, value;
 int temp, hash;
 clrscr();
 printf("nEnter the value of n(table size):");
 scanf("%d", &n);
 do {
  printf("nEnter the hash value");
  scanf("%d", &value);
  hash = value % n;
  if (a[hash] == 0) {
   a[hash] = value;
   printf("na[%d]the value %d is stored", hash, value);
  } else {
   for (hash++; hash < n; hash++) {
    if (a[hash] == 0) {
     printf("Space is allocated give other value");
     a[hash] = value;
     printf("n a[%d]the value %d is stored", hash, value);
     goto menu;
    }
   }

   for (hash = 0; hash < n; hash++) {
    if (a[hash] == 0) {
     printf("Space is allocated give other value");
     a[hash] = value;
     printf("n a[%d]the value %d is stored", hash, value);
     goto menu;
    }
   }
   printf("nnERRORn");
   printf("nEnter '0' and press 'Enter key' twice to exit");

  }

  menu:

  printf("n Do u want enter more");

  scanf("%d", &temp);

 }

 while (temp == 1);

 getch();

}

Read more Similar C Programs
C Basic
C Data Structure
Search Algorithms.

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

K & R C Chapter 1 Exercise Solutions

Posted on March 1, 2012 by Sandeepa Nadahalli

We have already provided solutions to all the exercises in the book “C Programming Language (2nd Edition)“ popularly known as K & R C book.

In this blog post I will give links to all the exercises from Chapter 1 of the book for easy reference.

Chapter 1: A Tutorial Introduction

Exercise 1-1. Run the “hello, world” program on your system. Experiment with leaving out parts of the program to see what error messages you get.
Solution to Exercise 1-1.
Exercise 1-2. Experiment to find what happens when printf’s argument string contains c, where c is some character not listed above.
Solution to Exercise 1-2.
Exercise 1-3. Modify the temperature conversion program to print a heading above the table.
Solution to Exercise 1-3.
Exercise 1-4. Write a program to print the corresponding Celsius to Fahrenheit table.
Solution to Exercise 1-4.
Exercise 1-5. Modify the temperature conversion program to print the table in reverse order, that is, from 300 degrees to 0.
Solution to Exercise 1-5.
Exercise 1-6. Verify that the expression getchar() != EOF is 0 or 1.
Solution to Exercise 1-6.
Exercise 1-7. Write a program to print the value of EOF.
Solution to Exercise 1-7.
Exercise 1-8.Write a program to count blanks, tabs, and newlines.
Solution to Exercise 1-8.
Exercise 1-9.Write a program to copy its input to its output, replacing each string of one or more blanks by a single blank.
Solution to Exercise 1-9.
Exercise 1-10. Write a program to copy its input to its output, replacing each tab by t , each backspace by b , and each backslash by \ . This makes tabs and backspaces visible in an unambiguous way.
Solution to Exercise 1-10.
Exercise 1-11.How would you test the word count program? What kinds of input are most likely to uncover bugs if there are any?
Solution to Exercise 1-11.
Exercise 1-12.Write a program that prints its input one word per line.
Solution to Exercise 1-12.
Exercise 1-13.Write a program to print a histogram of the lengths of words in its input. It is easy to draw the histogram with the bars horizontal; a vertical orientation is more challenging.
Solution to Exercise 1-13.
Exercise 1-14.Write a program to print a histogram of the frequencies of different characters in its input.
Solution to Exercise 1-14.
Exercise 1-15.Rewrite the temperature conversion program of Section 1.2 to use a function for conversion.
Solution to Exercise 1-15.
Exercise 1-16.Revise the the main routine of the longest-line program so it will correctly print the length of arbitrarily long input lines, and as much as possible of the text.
Solution to Exercise 1-16.
Exercise 1-17. Write a program to print all input lines that are longer than 80 characters.
Solution to Exercise 1-17.
Exercise 1-18. Write a program to remove all trailing blanks and tabs from each line of input, and to delete entirely blank lines.
Solution to Exercise 1-18.
Exercise 1-19. Write a function reverse(s) that reverses the character string s. Use it to write program that reverse thes its input a line at a time.
Solution to Exercise 1-19.
Exercise 1-20. Write a program detab that replaces tabs in the input with the proper number of blanks to space to the next tab stop. Assume a fixed set of tab stops, say every n columns. Should n be a variable or a symbolic parameter?
Solution to Exercise 1-20.
Exercise 1-21. Write a program entab that replaces strings of blanks with the minimum number of tabs and blanks to achieve the same spacing. Use the same stops as for detab . When either a tab or a single blank would suffice to reach a tab stop, which should be given preference?
Solution to Exercise 1-21.
Exercise 1-22. Write a program to “fold” long input lines into two or more shorter lines after the last non-blank character that occurs before the n -th column of input. Make sure your program does something intelligent with very long lines, and if there are no blanks or tabs before the specified column.
Solution to Exercise 1-22.
Exercise 1-23. Write a program to remove all comments from a C program. Don’t forget to handle quoted strings and character constants properly. C comments do not nest.
Solution to Exercise 1-23.
Exercise 1-24. Write a program to check a C program for rudimentary syntax errors like unbalanced parentheses, brackets and braces. Don’t forget about quotes, both single and double, escape sequences, and comments. (This program is hard if you do it in full generality.)
Solution to Exercise 1-24.

You can purchase the book from here or here.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C Program to find the size of a given file.

Posted on February 27, 2012 by Sandeepa Nadahalli

Write a C Program to find the size of a given file.
The function fseek() is used to set the file pointer at the specified position. In general, it is used to move the file pointer to the desired position within the file.
In this program we moved the file pointer to the end of file, and obtain the current position of the file pointer. Function rewind() also moves the file pointer to the beginning of the file, but syntax and number of parameters are different. Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/


#include<stdio.h>
#include<process.h>
long file_size(FILE *fp)
 {
     long len;
    //move file pointer to end of the file */
    fseek(fp, 0L, 2);
    //Obtain the current position of file pointer
    len = ftell(fp);
    return len;
 }
void main(void)
 {
   FILE *fp;
   char filename[20];
   printf("nEnter the file name:nn");
   scanf("%s",filename);

   fp = fopen(filename, r);
   
   if(fp == NULL)
    {
       printf("Error:  file not found!nn");
       exit(0);
    }
  printf("File size of %s is %ld bytesnn",filename, file_size(fp));
  fclose(fp);
 }

Read more Similar C Programs
C Basic

C File i/o

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C Program to implement address calculation sort.

Posted on February 16, 2012 by Sandeepa Nadahalli

Write a C Program to implement address calculation sort.
Address calculation sort is the sorting method which sorts the given array by using insertion method.
In this algorithm, a hash function is used and applied to the each key. Result of hash function is placed in the linked lists. The hash function must be a order preserving function which places the elements in linked lists are called as sub files. An item is placed into a sub-file in correct sequence by using any sorting method. After all the elements are placed into subfiles, the list is concatenated to produce the sorted list.
Address calculation sort is used to efficiently store non-contiguous keys (account numbers, part numbers, etc.) that may have wide gaps in their alphabetic and numeric sequences.
Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include<stdio.h>
 
#include<malloc.h>
 
#define MAX 20
 
struct  node
 
{
 
  int info ;
 
  struct node *link;
 
};
 
struct node *head[10];
 
int n,i,arr[MAX];
 
main()
 
{
 
  int i;
 
  printf("Enter the number of elements in the list : ");
 
  scanf("%d", &n);
 
  for(i=0;i<n;i++)
 
  {
 
    printf("Enter element %d : ",i+1);
 
    scanf("%d",&arr[i]);
 
  }/*End of for */
 
  printf("Unsorted list is :n");
 
  for(i=0;i<n;i++)
 
    printf("%d  ",arr[i]);
 
  printf("n");
 
  addr_sort();
 
  printf("Sorted list is :n");
 
  for(i=0;i<n;i++)
 
    printf("%d  ",arr[i]);
 
  printf("n");
 
}/*End of main()*/
 
addr_sort()
 
{
 
  int i,k,dig;
 
  struct node *p;
 
  int addr;
 
  k=large_dig();
 
  for(i=0;i<=9;i++)
 
    head[i]=NULL;
 
  for(i=0;i<n;i++)
 
  {
 
    addr=hash_fn( arr[i],k );
 
    insert(arr[i],addr);
 
  }
 
  for(i=0; i<=9 ; i++)
 
  {
 
    printf("head(%d) -> ",i);
 
    p=head[i];
 
    while(p!=NULL)
 
    {
 
      printf("%d ",p->info);
 
      p=p->link;
 
    }
 
    printf("n");
 
  }
 
 
  i=0;
 
  for(k=0;k<=9;k++)
 
  {
 
    p=head[k];
 
    while(p!=NULL)
 
    {
 
      arr[i++]=p->info;
 
      p=p->link;
 
    }
 
  }
 
}/*End of addr_sort()*/
 
/*Inserts the number in sorted linked list*/
 
insert(int num,int addr)
 
{
 
  struct node *q,*tmp;
 
  tmp= malloc(sizeof(struct node));
 
  tmp->info=num;
 
  /*list empty or item to be added in begining */
 
  if(head[addr] == NULL || num < head[addr]->info)
 
  {
 
    tmp->link=head[addr];
 
    head[addr]=tmp;
 
    return;
 
  }
 
  else
 
  {
 
    q=head[addr];
 
    while(q->link != NULL && q->link->info < num)
 
      q=q->link;
 
    tmp->link=q->link;
 
    q->link=tmp;
 
  }
 
}/*End of insert()*/
 
/* Finds number of digits in the largest element of the list */
 
int large_dig()
 
{
 
  int large = 0,ndig = 0 ;
 
  for(i=0;i<n;i++)
 
  {
 
    if(arr[i] > large)
 
      large = arr[i];
 
  }
 
  printf("Largest Element is %d , ",large);
 
  while(large != 0)
 
  {
 
    ndig++;
 
    large = large/10 ;
 
  }
 
  printf("Number of digits in it are %dn",ndig);
 
  return(ndig);
 
} /*End of large_dig()*/
 
hash_fn(int number,int k)
 
{
 
  /*Find kth digit of the number*/
 
  int digit,addr,i;
 
  for(i = 1 ; i <=k ; i++)
 
  {
 
    digit = number % 10 ;
 
    number = number /10 ;
 
  }
 
  addr=digit;
 
  return(addr);
 
}/*End of hash_fn()*/

Read more Similar C Programs

Data Structures


 C Sorting

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C Program to solve Dining philosophers problem.

Posted on February 16, 2012 by Sandeepa Nadahalli

Write a C Program to solve Dining philosophers problem.
Dining philosophers problem is a classic synchronization problem.A problem introduced by Dijkstra concerning resource allocation between processes. Five silent philosophers sit around table with a bowl of spaghetti. A fork is placed between each pair of adjacent philosophers.

Each philosopher must alternately think and eat.
Eating is not limited by the amount of spaghetti left: assume an infinite supply.
However, a philosopher can only eat while holding both the fork to the left and the fork to the right
(an alternative problem formulation uses rice and chopsticks instead of spaghetti and forks).

Each philosopher can pick up an adjacent fork, when available, and put it down, when holding it.
These are separate actions: forks must be picked up and put down one by one.
The problem is how to design a discipline of behavior (a concurrent algorithm) such that each philosopher won’t starve, i.e. can forever continue to alternate between eating and thinking.
Read more about C Programming Language.

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

#include<stdio.h>
#include<semaphore.h>
#include<pthread.h>
 
#define N 5
#define THINKING 0
#define HUNGRY 1
#define EATING 2
#define LEFT (ph_num+4)%N
#define RIGHT (ph_num+1)%N
 
sem_t mutex;
sem_t S[N];
 
void * philospher(void *num);
void take_fork(int);
void put_fork(int);
void test(int);
 
int state[N];
int phil_num[N]={0,1,2,3,4};
 
int main()
{
    int i;
    pthread_t thread_id[N];
    sem_init(&mutex,0,1);
    for(i=0;i<N;i++)
        sem_init(&S[i],0,0);
    for(i=0;i<N;i++)
    {
        pthread_create(&thread_id[i],NULL,philospher,&phil_num[i]);
        printf("Philosopher %d is thinkingn",i+1);
    }
    for(i=0;i<N;i++)
        pthread_join(thread_id[i],NULL);
}
 
void *philospher(void *num)
{
    while(1)
    {
        int *i = num;
        sleep(1);
        take_fork(*i);
        sleep(0);
        put_fork(*i);
    }
}
 
void take_fork(int ph_num)
{
    sem_wait(&mutex);
    state[ph_num] = HUNGRY;
    printf("Philosopher %d is Hungryn",ph_num+1);
    test(ph_num);
    sem_post(&mutex);
    sem_wait(&S[ph_num]);
    sleep(1);
}
 
void test(int ph_num)
{
    if (state[ph_num] == HUNGRY && state[LEFT] != EATING && state[RIGHT] != EATING)
    {
        state[ph_num] = EATING;
        sleep(2);
        printf("Philosopher %d takes fork %d and %dn",ph_num+1,LEFT+1,ph_num+1);
        printf("Philosopher %d is Eatingn",ph_num+1);
        sem_post(&S[ph_num]);
    }
}
 
void put_fork(int ph_num)
{
    sem_wait(&mutex);
    state[ph_num] = THINKING;
    printf("Philosopher %d putting fork %d and %d downn",ph_num+1,LEFT+1,ph_num+1);
    printf("Philosopher %d is thinkingn",ph_num+1);
    test(LEFT);
    test(RIGHT);
    sem_post(&mutex);
}

Read more Similar C Programs
C Basic

Search Algorithms.

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C Program to demonstrate dynamic memory allocation example.

Posted on February 15, 2012 by Sandeepa Nadahalli

Write a C Program to demonstrate dynamic memory allocation example.
Dynamic memory allocation means you can allocate or relocate (manipulate) the memory at the run time, using malloc, calloc, and realloc functions.
Using malloc, We can allocate block of memory for a variable
Using calloc function, We can allocate multiple blocks of memory for a variable.
We can alter, reassign the allocated memory using the realloc function.
We can releasing the allocated memory using the free function. Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/



#include<stdio.h>
#include<stdlib.h>

int main() {
 int* grades;
 int sum = 0, i, numberOfStudents;
 float average;


 printf("Enter the number of students: ");
 scanf("%d", &numberOfStudents);
 getchar();

 if((grades = (int*) malloc(numberOfStudents * sizeof(int))) == NULL) {
  printf("nError: Not enough memory to allocate grades arrayn");
  exit(1);
 }

 printf("nEnter the grades of %d students (in separate lines):n", numberOfStudents);

 for(i = 0; i < numberOfStudents; i++) {
  scanf("%d", &grades[i]);
  getchar();
 }

 /* calculate sum */
 for(i = 0; i < numberOfStudents; i++)
  sum += grades[i];

 /* calculate the average */
 average = (float) sum / numberOfStudents;

 printf("nThe average of the grades of all students is %.2f", 
   average);

 getchar();
 return(0);
}

Read more Similar C Programs
Learn C Programming

Number System

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C program to generate and print prime numbers in a given range.

Posted on February 15, 2012 by Sandeepa Nadahalli

Write a C program to generate and print prime numbers in a given range. Also print the number of prime numbers.
Prime number is a whole number and greater than 1, which is divisible by one or itself.
Example: 2, 3, 5, 7, 11, 13………… Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/

 
#include <stdio.h>
#include <conio.h>
#include <stdlib.h>
#include <math.h>

void main()
{
 int M, N, i, j, flag, temp, count = 0;

 clrscr();

 printf("Enter the value of M and Nn");
 scanf("%d %d", &M,&N);

 if(N < 2)
 {
  printf("There are no primes upto %dn", N);
  exit(0);
 }
 printf("Prime numbers aren");
 temp = M;

 if ( M % 2 == 0)
 {
  M++;
 }
 for (i=M; i<=N; i=i+2)
 {
  flag = 0;

  for (j=2; j<=i/2; j++)
  {
   if( (i%j) == 0)
   {
    flag = 1;
    break;
   }
  }
  if(flag == 0)
  {
   printf("%dn",i);
   count++;
  }
 }
 printf("Number of primes between %d  and %d = %dn",temp,N,count);
}

Read more Similar C Programs
Learn C Programming

Number System

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C Program to copy and concatenate strings without using standard functions.

Posted on February 14, 2012 by Sandeepa Nadahalli

C Program to copy and concatenate strings without using standard functions.
In this program , we copy one string from another, and without using the standard library function strcpy from string.h .
Here we appends the one string to another without using the strcat function. Read more about C Programming Language .

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/



#include <stdio.h>

void newStrCpy(char *,char *);
void newStrCat(char *,char *);

void main()
{
 char str1[80],str2[80];
 int opn;
 do
 {
   printf("Press 1- NewStrCpy t 2- NewStrCatt 3- Exitt Your Option?");
   scanf("%d",&opn);
   switch(opn)
   {
    case 1: flushall();
     printf("n Read the Source String n");
     gets(str1);
     newStrCpy(str2,str1);
     printf(" Copied String: %sn",str2);
     break;
    case 2: flushall();
     printf(" Read the First String n");
     gets(str1);
     printf(" Read the Second String n");
     gets(str2);
     newStrCat(str1,str2);
     printf("Concatenated String: n");
     puts(str1);
     break;
    case 3: printf(" Exit!! Press a key . . .");
     getch();
     break;
    default: printf(" Invalid Option!!! Try again !!!n");
     break;
     }
 }while(opn != 3);
}   /* End of main() */

void newStrCpy(char *d,char *s)
 {
  while( (*d++ = *s++));
 }
void newStrCat(char *s, char *t)
 {
  while(*s)
  s++;
  while(*s++ = *t++);
 }

Read more c programs

C Basic
C Strings

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link

C Program to convert from infix expression into prefix expression

Posted on February 10, 2012 by Sandeepa Nadahalli

C Program to convert from infix expression into prefix expression.
We use the infix expressions for the mathematical expressions in a program, these expressions will converted into equivalent machine instructions by the compiler using stacks.
Using stacks we can efficiently convert the expressions from infix to postfix, infix to prefix, postfix to infix, and postfix to prefix.
Example: infix to prefix:
infix: x^y^z-m+n+p/q,
postfix: ++-^x^yzmn/pq. Read more about C Programming Language.

/***********************************************************
* You can use all the programs on  www.c-program-example.com
* for personal and learning purposes. For permissions to use the
* programs for commercial purposes,
* contact [email protected]
* To find more C programs, do visit www.c-program-example.com
* and browse!
* 
*                      Happy Coding
***********************************************************/


#include<stdio.h>

#include<conio.h>

//Stack precedence function

 int F(char symbol)

  {

      switch(symbol)

               {

                   case ‘+’ :

                   case ‘-‘ :

                          return 1;

                   case ‘*’:

                  case ‘^’:

                         return 6:

                case ‘)’:

                       return 0:;

                case ‘#’:

                       return -1;

                  default:

                       return 8;

                       }

      }

//Input precedence function

int G(char symbol)

    {

      switch(symbol)

            {

               case ‘+’ :

               case ‘-‘ :

                      return 2;

               case ‘*’:

                     return 4;

               case ‘^’:

                     return  5:

                case ‘(‘:

                    return 0;

                 case ‘)’:

                   return 9:;

                 case ‘#’:

                 return -1;

               default:

                  return 7;

              }

}

Void infix_prefix(char infix[], char prefix[])

{

      int top, j, i;

     char symbol, s[40];

      top = -1;

      s[++top] = ‘#’;

      J = 0;

      strrev(infix);

     for(i = 0;i < strlen(infix); i++)

          {

              symbol= infix[i];

              while(F(s[top]) > G(symbol))

                     {

                             prefix[j] = s[top--];

                             j++;

                      }

              if(F(s[top]) != G(symbol))

              s[++top] = symbol;

             else

                       top--;

             }

  while(s[top != ‘#’)

      {

           prefix[j++] = s[top--];

       }

 prefix[j] = ‘’;

 strrev(prefix);

}

void main()

   {

     char infix[20];

     char prefix[20];

    printf(“/nEnter a valid infix expressionn”);

    scanf(“%s”,infix);

    infix_prefix(infix, prefix);

    printf(“nnThe prefix expression isn”);

   printf(“%sn”,prefix);

  }

Read more Similar C Programs
C Basic
C Data Structure
Search Algorithms.

You can easily select the code by double clicking on the code area above.

To get regular updates on new C programs, you can Follow @c_program

You can discuss these programs on our Facebook Page. Start a discussion right now,

our page!

Share this program with your Facebook friends now! by liking it

(you can send this program to your friend using this button)

Like to get updates right inside your feed reader? Grab our feed!

To browse more C Programs visit this link