Interested to Buy Any Domain ? << Click Here >> for more details...
which types of data structure will i use to convert infix to
post fix???
- 5 Answers
- 8894 Views
- IIT, I also Faced
- E-Mail Answers
Answer Posted / abhishek munde
To convert the infix to postfix, STACK datastructure is
used. some may think about tree but by we only denote the
expression actual conversion is done through STACK.
| Is This Answer Correct ? | 12 Yes | 2 No |
Post New Answer View All Answers
What is a static function in c?
What are the disadvantages of c language?
What was noalias and what ever happened to it?
Write a program to print all permutations of a given string.
What are pragmas and what are they good for?
Write a program to generate random numbers in c?
Is that possible to add pointers to each other?
What are the standard predefined macros?
At a shop of marbles, packs of marbles are prepared. Packets are named A, B, C, D, E …….. All packets are kept in a VERTICAL SHELF in random order. Any numbers of packets with these names could be kept in that shelf as in this example: bottom of shelf ---> [AAAJKRDFDEWAAYFYYKK]-----Top of shelf. All these packets are to be loaded on cars. The cars are lined in order, so that the packet could be loaded on them. The cars are also named [A, B, C, D, E,………….]. Each Car will load the packet with the same alphabet. So, for example, car ‘A’ will load all the packets with name ‘A’. Each particular car will come at the loading point only once. The cars will come at the loading point in alphabetical order. So, car ‘B’ will come and take all the packets with name ‘B’ from the shelf, then car ‘C’ will come. No matter how deep in the shelf any packet ‘B’ is, all of the ‘B’ packets will be displaced before the ‘C’ car arrives. For that purpose, some additional shelves are provided. The packets which are after the packet B, are kept in those shelves. Any one of these shelves contains only packets, having the same name. For example, if any particular shelf is used and if a packet with name X is in it, then only the packets having names X will be kept in it. That shelf will look like [XXXXXXX]. If any shelf is used once, then it could be used again only if it is vacant. Packets from the initial shelf could be unloaded from top only. Write a program that finds the minimum total number of shelves, including the initial one required for this loading process.
Explain what are header files and explain what are its uses in c programming?
What is function prototype in c with example?
What are the 32 keywords in c?
Explain why c is faster than c++?
.main() { char *p = "hello world!"; p[0] = 'H'; printf("%s",p); }
What are the advantages of c preprocessor?
