:: Home Page            
 Advertise your Business Here     
Browse  |   Placement Papers  |   Company  |   Code Snippets  |   Certifications  |   Visa Questions
Post Question  |   Post Answer  |   My Panel  |   Search  |   Articles  |   Topics  |   ERRORS new
   Refer this Site  Refer This Site to Your Friends  Site Map  Bookmark this Site  Set it as your HomePage  Contact Us     Login  |  Sign Up                      
Categories >> Software >> Programming Languages >> C


 C interview questions  C Interview Questions (2254)
 C++ interview questions  C++ Interview Questions (1111)
 VC++ interview questions  VC++ Interview Questions (342)
 Delphi interview questions  Delphi Interview Questions (510)
 Programming Languages AllOther interview questions  Programming Languages AllOther Interview Questions (646)
write a program to convert a expression in polish
notation (postfix) to inline (normal)
something like make 723+*  (2+3) x 7 (not sure) just
check out its mainly printing expression in postfix form  
to infix

No Answer is Posted For this Question

Be the First to Post Answer

Other C Interview Questions
  Question Asked @ Answers
who is the father of c Infosys 4
how to set Nth bit of a variable?   1
what is difference between array of characters and string Accenture 18
i=20,k=0; for(j=1;j<i;j=1+4*(i/j)) { k+=j<10?4:3; } printf("%d", k); HCL 8
difference between loading and linking   1
How can I invoke another program from within a C program?   8
O,T,T,F,F,S,S,E,N,?,?,?,T,F,F,S,S,E,N ADP 9
write the function int countchtr(char string[],int ch);which returns the number of timesthe character ch appears in the string. for example the call countchtr("she lives in Newyork",'e') would return 3.   6
pick out the odd one out of the following a.malloc() b.calloc() d.realloc() TCS 2
prototype of sine function. Cadence 2
write a program which counts a product of array elements lower than 10.   1
write c program without semicolon TCS 11
For more C Interview Questions Click Here 

Copyright Policy  |  Terms of Service  |  Articles  |  Site Map  |  RSS Site Map  |  Contact Us
Copyright 2013  All Rights Reserved.   ::