What's the difference between calloc() and malloc()?
- 4 Answers
- 7057 Views
- I also Faced
- E-Mail Answers
Answer Posted / k.thejonath
Malloc allocates a block of memory whereas using calloc we
can allocate array of memory blocks and all locations are
initialized to zeros
| Is This Answer Correct ? | 5 Yes | 3 No |
Post New Answer View All Answers
How will you declare an array of three function pointers where each function receives two ints and returns a float?
What are header files in c?
printf(), scanf() these are a) library functions b) userdefined functions c) system functions d) they are not functions
main use of recursive function a) processing speed high b) reduce program length/reduce repeated statements c) if you do not, use iterative methods like, for, while or do-while d) all the above
How do you construct an increment statement or decrement statement in C?
What is hashing in c?
Explain the use of 'auto' keyword
What is the difference between #include
How can I recover the file name given an open stream?
What is c method?
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 the use of bit field?
How can I convert a number to a string?
Is anything faster than c?
FILE PROGRAMMING
