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
- 8924 Views
- IIT, I also Faced
- E-Mail Answers
Answer Posted / karthikeyan
stack is used . since it preserves data .
| Is This Answer Correct ? | 3 Yes | 0 No |
Post New Answer View All Answers
how to introdu5ce my self in serco
What is the difference between exit() and _exit() function?
What is adt in c programming?
Write a code of a general series where the next element is the sum of last k terms.
What is the difference between the local variable and global variable in c?
What is the best organizational structure?
What is the difference between struct and typedef struct in c?
How can I dynamically allocate arrays?
Explain what are global variables and explain how do you declare them?
How are Structure passing and returning implemented by the complier?
What are pointers? Why are they used?
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.
How can I find out how much free space is available on disk?
What is #include cctype?
What is structure in c explain with example?
