How do you write a program which produces its own source
code as its output?
Answer Posted / sharath
can we use system() to print source code of a file??
if yes please with an example.
also explain how to execute please please
i am in an urgent need.
please
| Is This Answer Correct ? | 0 Yes | 0 No |
Post New Answer View All Answers
Are there constructors in c?
What is data structure in c programming?
What the different types of arrays in c?
the constant value in the case label is followed by a a) semicolon b) colon c) braces d) none of the above
What is the difference between %d and %i?
What are runtime error?
What is the difference between a free-standing and a hosted environment?
What is difference between arrays and pointers?
Not all reserved words are written in lowercase. TRUE or FALSE?
Why does everyone say not to use gets?
What are reserved words?
Difference between Shallow copy and Deep copy?
Explain a pre-processor and its advantages.
Write an efficient algo and C code to shuffle a pack of cards.. this one was a feedback process until we came up with one with no extra storage.
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.