Interested to Buy Any Domain ? << Click Here >> for more details...
How can I invoke another program from within a C program?
- 8 Answers
- 25139 Views
- I also Faced
- E-Mail Answers
Answer Posted / vamshi
simply use
#include<file_name.exe>.
the file with appropriate extention.
| Is This Answer Correct ? | 1 Yes | 3 No |
Post New Answer View All Answers
What is a structure in c language. how to initialise a structure in c?
How many levels of indirection in pointers can you have in a single declaration?
Is it better to use malloc() or calloc()?
What is the general form of #line preprocessor?
What is wrong with this declaration?
Write a code to generate a series where the next element is the sum of last k terms.
What is a pointer variable in c language?
Is linux written in c?
What are pointers really good for, anyway?
Q.1 write a program to create binary tree 1 to 16 numbers? Q.2 write a program to creat a binary search tree for the member that is given by user?
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.
What is difference between structure and union in c programming?
What happens if you free a pointer twice?
in iso what are the common technological language?
What are disadvantages of C language.
